Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Kolba et al. (1977) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: