IEEE Transactions on Acoustics Speech and Signal Processing · 1982 · 37 citations · 10 references
ComputingComputer EngineeringComputer ScienceAlgorithmsData StructuresTheory Of ComputationData CompressionDigital Signal ProcessingFourier AnalysisDiscrete Fourier TransformFast Fourier TransformFast Fourier Transform MultiplicationFourier Transform
This paper develops and presents a radix-2 fast Fourier transform (FFT) algorithm that reduces the computational effort (as measured by the number of multiplications) to two-thirds of the effort required by most radix-2 algorithms. The resulting algorithm is similar to one obtained by applying a principle suggested by Rader and Brenner; however, its structure is particularly appealing when transforming pure real or imaginary sequences and/or symmetric or antisymmetric sequences; furthermore, memory requirements (other than those for storing the input data) do not grow with the size of the transform.
10
An algorithm for the machine calculation of complex Fourier series
J.W. Cooley, John W. Tukey · Mathematics of Computation · 1965 · 12.2K citations
The Art of Computer Programming
G.E. Whitesides · Nuclear Science and Engineering · 1970 · 6.1K citations
Theory and application of digital signal processing
T.N. Trick · Proceedings of the IEEE · 1975 · 1.9K citations
On computing the discrete Fourier transform
S. Winograd · Mathematics of Computation · 1978 · 614 citations · Full text