Skip to search formSkip to main contentSkip to account menu

Prime-factor FFT algorithm

Known as: PFA, Prime-factor FFT algorithm. 
The prime-factor algorithm (PFA), also called the Good–Thomas algorithm (1958/1963), is a fast Fourier transform (FFT) algorithm that re-expresses… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
Cooley–Tukey FFT algorithmDiscrete Fourier transformDiscrete Hartley transformFFTW

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Explorer Pleiotropic effects of extended blockade of CSF 1 R signaling in adult mice
We investigated the role of CSF1R signaling in adult mice using prolonged treatment with anti-CSF1R antibody. Mutation of the… 
2012
2012
A novel overall in-place in-order prime factor FFT algorithm
This paper presents a new prime factor algorithm (PFA) for non-power-of-two point FFT. Compared with the conventional prime… 
2010
2010
Casimir energies of cylinders: Universal function
New exact results are given for the interior Casimir energies of infinitely long waveguides of triangular cross section… 
Highly Cited
2008
Highly Cited
2008
Spectrum Sensing for Wireless Microphone Signals
Spectrum sensing in the context of wireless microphone (WM) signals is considered in this paper. The spectrum sensing algorithm… 
2008
2008
Non-line-of-sight detection based on TOA and signal strength
This paper addresses the problem of identifying NLOS propagation by applying the statistical decision theory. A time-of-arrival… 
Highly Cited
2008
Highly Cited
2008
An implementation of a fast backprojection image formation algorithm for spotlight-mode SAR
In this paper we describe an algorithm for fast spotlight-mode synthetic aperture radar (SAR) image formation that employs… 
2001
2001
Automated analysis of rotating probe multi-frequency eddy current data from steam generator tubes
An algorithm is presented for the automated analysis of rotating probe multifrequency eddy current data obtained from nuclear… 
1995
1995
Computing the inverse DFT with the in-place, in-order prime factor FFT algorithm
We present a method for computing the inverse discrete Fourier transform (IDFT) by the in-place, in-order prime factor FFT… 
1984
1984
Prime factor FFT algorithms for real-valued series
This paper presents two techniques for computing a discrete transform of a vector of real-valued data using the Prime Factor… 
1981
1981
A new prime factor FFT algorithm
This paper presents an approach to calculating the discrete Fourier transform (DFT) using a prime factor algorithm (PFA). A very… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)