The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (1976 vol.25)
pp: 764-765
R.M. Haralick , Remote Sensing Laboratory, University of Kansas
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.
INDEX TERMS
Data compression, fast Fourier transform (FFT), fast transform.
CITATION
R.M. Haralick, "A Storage Efficient Way to Implement the Discrete Cosine Transform", IEEE Transactions on Computers, vol.25, no. 7, pp. 764-765, July 1976, doi:10.1109/TC.1976.1674687
48 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool