In this paper, we propose an efficient two-dimensional inverse discrete cosine transform (2-D IDCT) algorithm based upon coefficient-by-coefficient implementations. The algorithm, which is developed in the use of the symmetrical properties of computational kernel matrices, can effectively combine with the run length code (RLC) decoder in progressive manners. The proposed method requires only N /2 multipliers in an ‘N x N’ 2-D IDCT processor. By evaluating the efficiency performance, the processor can complete 2N/M pixels per multiplier per system cycle where M is the number of non-zero quantized DCT coefficients. Due to its inherent parallel and coefficient-by-coefficient characteristics, the proposed efficient 2-D IDCT algorithm is suitable for the future digital HDTV receivers and recording systems.
|Number of pages||6|
|Journal||IEEE Transactions on Circuits and Systems for Video Technology|
|Publication status||Published - 1995 Feb|
All Science Journal Classification (ASJC) codes
- Media Technology
- Electrical and Electronic Engineering