摘要:
The present invention is to provide a parallel filtering method, which is implemented to an interpolation filter and comprises the steps of separating coefficients of the interpolation filter into two sets comprising the positive and negative coefficients respectively for parallelly filtering a plurality of input data pixels packed into data words inputted to the interpolation filter concurrently to obtain a first result data word, and clipping and shifting the first result data word to obtain a final output data word containing packed half-pel pixels for parallelly and efficiently filtering data stream of video without increasing the complexity, cost, size and power consumption of circuitry of an electronic video apparatus.
摘要:
The present invention is to provide a variable length decoding method for decoding complete binary tree code, which is implemented to an entropy coding module for executing the process comprising the steps of: procuring a TabIndex to calculate a value T=└log2(TabIndex)┘; reading T bits from a bitstream to obtain a first result M; determining whether or not the result M is smaller than (TabIndex−(1
摘要:
The present invention is to provide a parallel filtering method, which is implemented to an interpolation filter and comprises the steps of separating coefficients of the interpolation filter into two sets comprising the positive and negative coefficients respectively for parallelly filtering a plurality of input data pixels packed into data words inputted to the interpolation filter concurrently to obtain a first result data word, and clipping and shifting the first result data word to obtain a final output data word containing packed half-pel pixels for parallelly and efficiently filtering data stream of video without increasing the complexity, cost, size and power consumption of circuitry of an electronic video apparatus.
摘要:
The present invention is to provide a variable length decoding method for decoding complete binary tree code, which is implemented to an entropy coding module for executing the process comprising the steps of: procuring a TabIndex to calculate a value T=└log2(TabIndex)┘; reading T bits from a bitstream to obtain a first result M; determining whether or not the result M is smaller than (TabIndex-(1