August 1, 1987

A prime factor FFT algorithm implementation using a program generation technique

FPFrancisco Bordas PérezBank of Mexico TTT. TakaokaUniversity of Canterbury

Key Points

Key points are not available for this paper at this time.

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.

KI fragen

Bookmark

View Full Paper

Cite This Study

Pérez et al. (Sat,) studied this question.

synapsesocial.com/papers/6a1eb1a5e5c5a32e9d9a771d https://doi.org/https://doi.org/10.1109/tassp.1987.1165265

KI fragen

Bookmark

View Full Paper