A Storage Efficient Way to Implement the Discrete Cosine Transform
- 1 July 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-25 (7) , 764-765
- https://doi.org/10.1109/tc.1976.1674687
Abstract
Ahmed has shown that a discrete cosine transform can be implemented by doing one double length fast Fourier transform (FFT). In this correspondence, we show that the amount of work can be cut to doing two single length FFT's.Keywords
This publication has 3 references indexed in Scilit:
- Comments on "Discrete Cosine Transform"IEEE Transactions on Computers, 1975
- Discrete Cosine TransformIEEE Transactions on Computers, 1974
- On the asymptotic eigenvalue distribution of Toeplitz matricesIEEE Transactions on Information Theory, 1972