Implementation of the discrete cosine transform and its inverse by digital filtering
Zichen Wang, GRAHAM A. JULLIEN, W.C. Miller · 2002
In this paper, we first demonstrate that the discrete cosine transform (DCT) and the inverse discrete cosine transform (IDCT) can be represented by the Chebyshev polynomials of the third and second kind, respectively. Then we derive recursive algorithms for the DCT and IDCT with arbitrary length from the recursive formulae for the Chebyshev polynomials. These new algorithms are particularly suitable for massively parallel VLSI implementation.