This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Very Fast Fourier Transform Algorithms Hardware for Implementation
May 1979 (vol. 28 no. 5)
pp. 333-341
A.M. Despain, Computer Science Division, Department of Electrical Engineering and Computer Science, University of California
A new method of deriving very fast Fourier transform (FFT) algorithms is described. The resulting algorithms do not employ multiplication and have a form suitable for high performance hardware implementations. The complexity of the algorithms compares favorably to the recent results of Winograd [1].
Index Terms:
vector rotation., CORDIC, digital signal processing, FFT, Fourier transform, parallel processors, pipeline processors
Citation:
A.M. Despain, "Very Fast Fourier Transform Algorithms Hardware for Implementation," IEEE Transactions on Computers, vol. 28, no. 5, pp. 333-341, May 1979, doi:10.1109/TC.1979.1675363
Usage of this product signifies your acceptance of the Terms of Use.