On Computing the Discrete Cosine Transform
- 1 October 1978
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-27 (10) , 966-968
- https://doi.org/10.1109/tc.1978.1674977
Abstract
Haralick has shown that the discrete cosine transform of N points can be computed more rapidly by taking two N-point fast Fourier transforms (FFT's) than by taking one 2N-point FFT as Ahmed had proposed. In this correspondence, we show that if Haralick had made use of the fact that the FFT's of real sequences can be computed more rapidly than general FFT's, the result would have been reversed. A modified algorithm is also presented.Keywords
This publication has 5 references indexed in Scilit:
- A Fast Karhunen-Loeve Transform for a Class of Random ProcessesIEEE Transactions on Communications, 1976
- A Storage Efficient Way to Implement the Discrete Cosine TransformIEEE Transactions on Computers, 1976
- Discrete Cosine TransformIEEE Transactions on Computers, 1974
- A radix-eight fast Fourier transform subroutine for real-valued seriesIEEE Transactions on Audio and Electroacoustics, 1969
- Numerical Analysis: A fast fourier transform algorithm for real-valued seriesCommunications of the ACM, 1968