In this paper, we will propose a new fast two-dimensional inverse discrete cosine transform (2D-IDCT) algorithm which is developed on bases of the DCT computational kernel matrices. With the symmetrical properties of kernel matrices, we can greatly reduce the number of multiplications. With carefully grouping the DCT coefficients, the computational complexity can be further reduced, for example, if the 2D-DCT coefficients are coded and transmitted according to the zig-zag scanning. The proposed fast 2D-IDCT algorithm which takes the advantage of zero-valued DCT elements is suitable for high throughput HDTV receiving systems.
All Science Journal Classification (ASJC) codes