Title :
A Storage Efficient Way to Implement the Discrete Cosine Transform
Author :
Haralick, Robert M.
Author_Institution :
Remote Sensing Laboratory, University of Kansas
fDate :
7/1/1976 12:00:00 AM
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.
Keywords :
Data compression, fast Fourier transform (FFT), fast transform.; Computer languages; Discrete Fourier transforms; Discrete cosine transforms; Documentation; Fast Fourier transforms; Fourier transforms; Image coding; Karhunen-Loeve transforms; Markov processes; Production; Data compression, fast Fourier transform (FFT), fast transform.;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1976.1674687
