Title :
Fast computation of real discrete Fourier transform for any number of data points
Author :
Hu, N.C. ; Ersoy, O.K.
Author_Institution :
Sch. of Electr. Eng., Purdue Univ., West Lafayette, IN, USA
Abstract :
In many applications, it is desirable to have a fast algorithm (FRFT) for the computation of the real discrete Fourier transform (RDFT) for any number of data points. To achieve this, the two-factor Cooley-Tukey FRFT algorithm is developed and expressed in terms of matrix factorization using Kronecker products. This is generalized to any number of factors. Each factor M involves the computation of size M RDFTs, which is carried out by the best size M FRFT algorithm available
Keywords :
fast Fourier transforms; matrix algebra; DFT; Kronecker products; fast algorithm; matrix factorization; real discrete Fourier transform; two-factor Cooley-Tukey FRFT algorithm; Discrete Fourier transforms; Discrete transforms; Ducts; Fast Fourier transforms; Fourier transforms; Frequency conversion;
Conference_Titel :
Circuits and Systems, 1989., IEEE International Symposium on
Conference_Location :
Portland, OR
DOI :
10.1109/ISCAS.1989.100352
