Recursive algorithms for the forward and inverse discrete cosine transform with arbitrary length
- 1 July 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 1 (7) , 101-102
- https://doi.org/10.1109/97.311803
Abstract
The authors first demonstrate that the forward and inverse discrete cosine transform (DCT, IDCT) can be represented by Chebyshev polynomials of the third and second kind, respectively. Then, they derive recursive algorithms for the DCT and IDCT with arbitrary length from the recursive formulae for the Chebyshev polynomials. The proposed algorithms are particularly suitable for VLSI implementation using array processing architectures.Keywords
This publication has 3 references indexed in Scilit:
- Recursive algorithm for the discrete cosine transformwith general lengthsElectronics Letters, 1994
- A VLSI architecture for the real time computation of discrete trigonometric transformsJournal of Signal Processing Systems, 1993
- DISCRETE COSINE TRANSFORMPublished by Elsevier ,1990