Loading [MathJax]/extensions/MathMenu.js
On Computing the Discrete Cosine Transform | IEEE Journals & Magazine | IEEE Xplore

On Computing the Discrete Cosine Transform


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...Show More

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.
Published in: IEEE Transactions on Computers ( Volume: C-27, Issue: 10, October 1978)
Page(s): 966 - 968
Date of Publication: 31 October 1978

ISSN Information:


Contact IEEE to Subscribe

References

References is not available for this document.