This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A High-Speed Algorithm for the Computer Generation of Fourier Transforms
April 1968 (vol. 17 no. 4)
pp. 373-375
Abstract?An efficient algorithm is presented for performing the Fourier transformation operation on a digital computer. This algorithm completes the transform calculation with Nlog2N complex additions (complex additions include complex subtractions) and ?N [log2(N)-2]+1 complex multiplications. This is a considerable savings over a brute-force method of N2complex additions and multiplications, especially when considering the use of digital machines whose MULTIPLY time is much longer than ADD time.
Index Terms:
Index terms?Fast Fourier transform algorithm, Fourier transforms, spectral analysis.
Citation:
H. Andrews, "A High-Speed Algorithm for the Computer Generation of Fourier Transforms," IEEE Transactions on Computers, vol. 17, no. 4, pp. 373-375, April 1968, doi:10.1109/TC.1968.229396
Usage of this product signifies your acceptance of the Terms of Use.