Skip to Main Content
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.
Acoustics, Speech and Signal Processing, IEEE Transactions on (Volume:35 , Issue: 8 )
Date of Publication: Aug 1987