A Fast 8*8 2D IDCT Architecture, Avoiding Zero Transformed Coefficients
Θωμάς Τζιόρτζιος, Stavros Dokouzyannis · 2010
A new architecture is proposed for the fast computation of the 8*8 two dimensional Inverse Discrete Cosine Transform (2D IDCT). We take advantage of the fact that the most DCT coefficients in image processing are equal to zero and we skip computations associated with those particular coefficients. As the number of nonzero DCT coefficients decreases, the computation time also decreases. The key idea is that we store all of the basis matrices of 8*8 2D DCT. The proposed architecture computes simultaneously all 64 pixel luminance values of the 8*8 block. High-level MATLAB simulations were made to confirm the efficiency of the proposed architecture.