A prime factor FFT algorithm using high-speed convolution
Dean P. Kolba, Thomas W. Parks · IEEE Transactions on Acoustics Speech and Signal Processing · 1977
Two recently developed ideas, the conversion of a discrete Fourier transform (DFT) to convolution and the implementation of short convolutions with a minimum of multiplications, are combined to give efficient algorithms for long transforms. Three transform algorithms are compared in terms of the number of multiplications and additions. Timing for a prime factor fast Fourier transform (FFT) algorithm using high-speed convolution, which was programmed for an IBM 370 and an 8080 microprocessor, is presented.
Cited by 308 works. doi:10.1109/tassp.1977.1162973
Authors
References
- An Algorithm for the Machine Calculation of Complex Fourier Series
- The Art of Computer Programming
- DIGITAL PROCESSING OF SIGNALS
- Theory and Application of Digital Signal Processing
- The Interaction Algorithm and Practical Fourier Analysis
- Theory and application of digital signal processing
- An algorithm for computing the mixed radix fast Fourier transform
- Fundamental Structures of Algebra.
- Discrete Fourier transforms when the number of data samples is prime
- On computing the Discrete Fourier Transform