Title :
On Computing the Discrete Cosine Transform
Author :
Tseng, B.D. ; Miller, W.C.
Author_Institution :
Department of Electrical Engineering, University of Windsor
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 :
Complex FFT; complex operations; discrete cosine transform; real FFT; Costs; Discrete cosine transforms; Discrete transforms; Electrons; Fast Fourier transforms; Network synthesis; Notice of Violation; Pattern recognition; Complex FFT; complex operations; discrete cosine transform; real FFT;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1978.1674977
