1987IEEE Transactions on Acoustics Speech and Signal ProcessingRequires access

A prime factor FFT algorithm implementation using a program generation technique

Francisco Bordas Pérez, T. Takaoka

Open publisher page 11 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 11 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

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

Related papers

Back to paper searchBrowse research topicsOriginal source
A prime factor FFT algorithm implementation using a program generation technique — Research Paper | ScholarLens