This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Fast Fourier Transform for High-Speed Signal Processing
August 1971 (vol. 20 no. 8)
pp. 843-846
An arbitrary-radix fast Fourier transform algorithm and a design of its implementing signal processing machine are introduced. The algorithm yields an implementation with a level of parallelism proportional to the radix r of factorization of the discrete Fourier transform, allows 100 percent utilization of the arithmetic unit, and yields properly ordered Fourier coefficients without the need for pre- or postordering of data.
Index Terms:
Convolution, correlation, digital filtering, digital signal processing, fast Fourier transform, machine organization, special-purpose computer, spectral analysis, time-series analysis.
Citation:
M.J. Corinthios, "A Fast Fourier Transform for High-Speed Signal Processing," IEEE Transactions on Computers, vol. 20, no. 8, pp. 843-846, Aug. 1971, doi:10.1109/T-C.1971.223359
Usage of this product signifies your acceptance of the Terms of Use.