This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Storage Efficient Way to Implement the Discrete Cosine Transform
July 1976 (vol. 25 no. 7)
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.
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
Usage of this product signifies your acceptance of the Terms of Use.