The Community for Technology Leaders
Green Image
Issue No. 07 - July (1976 vol. 25)
ISSN: 0018-9340
pp: 764-765
R.M. Haralick , Remote Sensing Laboratory, University of Kansas
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.
Data compression, fast Fourier transform (FFT), fast transform.

R. Haralick, "A Storage Efficient Way to Implement the Discrete Cosine Transform," in IEEE Transactions on Computers, vol. 25, no. , pp. 764-765, 1976.
81 ms
(Ver 3.3 (11022016))