Very Fast Fourier Transform Algorithms Hardware for Implementation
Despain · IEEE Transactions on Computers · 1979
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].