DocumentCode
3004769
Title
Fast algorithms for the real discrete Fourier transform
Author
Ersoy, O.K. ; Hu, N.C.
Author_Institution
Sch. of Electr. Eng., Purdue Univ., West Lafayette, IN, USA
fYear
1988
fDate
11-14 Apr 1988
Firstpage
1902
Abstract
Fast algorithms for the computation of the real discrete Fourier transform (RDFT) are discussed. Implementations based on the RDFT are always efficient, whereas the implementations based on the DFT are efficient only when signals to be processed are complex. The fast real Fourier transform (FRFT) algorithms discussed are the radix-2 decimation-in-time (DIT), the radix-4 DIT, the split-radix DIT, the split-radix DIF, the prime factor, and the Winograd FRFT algorithm
Keywords
fast Fourier transforms; signal processing; Winograd FRFT; algorithms; fast real Fourier transform; prime factor; radix-2 decimation-in-time; radix-4 DIT; real discrete Fourier transform; signal processing; split-radix DIF; split-radix DIT; Covariance matrix; Discrete Fourier transforms; Discrete cosine transforms; Discrete transforms; Finite impulse response filter; Fourier transforms; Image coding; Signal processing; Signal representations; Symmetric matrices;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech, and Signal Processing, 1988. ICASSP-88., 1988 International Conference on
Conference_Location
New York, NY
ISSN
1520-6149
Type
conf
DOI
10.1109/ICASSP.1988.196998
Filename
196998
Link To Document