A prime factor FFT algorithm implementation using a program generation technique
Francisco Bordas Pérez, T. Takaoka · IEEE Transactions on Acoustics Speech and Signal Processing · 1987
This correspondence presents details of a new implementation of the prime factor FFT algorithm (PFA) for computing the discrete Fourier transform (DFT). This implementation applies a program generation technique to the PFA algorithm and saves about 40 percent of the execution time of the conventional one.