Very Fast Fourier Transform Algorithms Hardware for Implementation

1 May 1979

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers

Vol. C-28 (5) , 333-341
https://doi.org/10.1109/tc.1979.1675363

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].

Keywords

This publication has 6 references indexed in Scilit:

A prime factor FFT algorithm using high-speed convolution
IEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
On computing the Discrete Fourier Transform
Proceedings of the National Academy of Sciences, 1976
Fourier Transform Computers Using CORDIC Iterations
IEEE Transactions on Computers, 1974
What is the fast Fourier transform?
Proceedings of the IEEE, 1967
Fast Fourier Transforms
Published by Association for Computing Machinery (ACM) ,1966
An algorithm for the machine calculation of complex Fourier series
Mathematics of Computation, 1965