This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Generalization of the Fast Fourier Transform
February 1970 (vol. 19 no. 2)
pp. 105-116
A procedure for factoring of the N?N matrix representing the discrete Fourier transform is presented which does not produce shuffled data. Exactly one factor is produced for each factor of N, resulting in a fast Fourier transform valid for any N. The factoring algorithm enables the fast Fourier transform to be implemented in general with four nested loops, and with three loops if N is a power of two. No special logical organization, such as binary indexing, is required to unshuffle data. Included are two sample programs, one which writes the equations of the matrix factors employing the four key loops, and one which implements the algorithm in a fast Fourier transform for N a power of two. The algorithm is shown to be most efficient for Na power of two.
Index Terms:
Cooley-Tukey algorithm, discrete Fourier transform, fast Fourier transform, mixed radix, spectral analysis.
Citation:
J.A. Glassman, "A Generalization of the Fast Fourier Transform," IEEE Transactions on Computers, vol. 19, no. 2, pp. 105-116, Feb. 1970, doi:10.1109/T-C.1970.222875
Usage of this product signifies your acceptance of the Terms of Use.