The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1979 vol.28)
pp: 333-341
A.M. Despain , Computer Science Division, Department of Electrical Engineering and Computer Science, University of California
ABSTRACT
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
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool