DocumentCode :
754008
Title :
On the Computation of the Discrete Cosine Transform
Author :
Narasimha, Madihally J. ; Peterson, Allen M.
Author_Institution :
Stanford Univ., CA
Volume :
26
Issue :
6
fYear :
1978
fDate :
6/1/1978 12:00:00 AM
Firstpage :
934
Lastpage :
936
Abstract :
An 
-point discrete Fourier transform (DFT) algorithm can be used to evaluate a discrete cosine transform by a simple rearrangement of the input data. This method is about two times faster compared to the conventional method which uses a 
-point DFT.
-point discrete Fourier transform (DFT) algorithm can be used to evaluate a discrete cosine transform by a simple rearrangement of the input data. This method is about two times faster compared to the conventional method which uses a -point DFT.Keywords :
DFT; Discrete Fourier transforms (DFT´s); Transforms; Communications Society; Communications technology; Discrete Fourier transforms; Discrete cosine transforms; Error probability; Gaussian noise; Intersymbol interference; Notice of Violation; Power generation; Spread spectrum radar;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/TCOM.1978.1094144
Filename :
1094144
Link To Document :
