Answers are grounded in this paper and cite their sources.
Prime factor fast Fourier transform (FFT) algorithms have two important advantages: they can be simultaneously self-sorting and in-place, and they have a lower operation count than conventional FFT algorithms. The major disadvantage of the prime factor FFT has been that it was only applicable to a limited set of values of the transform length N. This paper presents a generalized prime factor FFT, which is applicable for any N = 2ᵖ 3q 5ʳ, while maintaining both the self-sorting in-place capability and the lower operation count. Timing experiments on the Cray Y-MP demonstrate the advantages of the new algorithm.
No takes yet. Share an insight, caveat, or question.
Clive Temperton (1992) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: