A prime factor FFT algorithm implementation using a program generation technique
Francisco Bordas Pérez, T. Takaoka
Abstract
Francisco Bordas Pérez, T. Takaoka
Abstract
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.
OpenAlex reports 11 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Fast Fourier transform, Prime-factor FFT algorithm, Split-radix FFT algorithm, Prime (order theory), Cooley–Tukey FFT algorithm, Factor (programming language), Computer science, Algorithm