1992/05/01 by Clive Temperton · 1 citation
Computer Science · Engineering · Mathematics · #Digital Filter Design and Implementation #Advancements in PLL and VCO Technologies #Numerical Methods and Algorithms #Prime-factor FFT algorithm #Fast Fourier transform #Split-radix FFT algorithm #Rader's FFT algorithm #Algorithm #Prime (order theory) #Sorting #Prime factor #Cooley–Tukey FFT algorithm #Factor (programming language) #Mathematics #Twiddle factor #Computer science #Fourier transform #Combinatorics #Fourier analysis #Fractional Fourier transform #Mathematical analysis #Short-time Fourier transform
paper · doi:10.1137/0913039
openalex publication_date 1992/05/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/26
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 = 2p 3q 5r , 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.