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.
2014
2014
A Highly Granular Silicon-Tungsten Electromagnetic Calorimeter and Top Quark Production at the International Linear Collider
This thesis deals with two aspects of the International Linear Collider (ILC) which is a project of a linear electron-positron… 
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… 
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
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… 
2004
2004
RADAR DETECTION IN COMPOUND-GAUSSIAN CLUTTER
In this paper, we study the adaptive version of the asymptotical Bayesian Optimum Radar Detector (BORD) built with a covariance… 
1996
1996
Likelihood-ratio detection of frequency-hopped signals
The optimum system for intercepting frequency-hopped signals uses a channelized receiver and a likelihood-ratio test (LRT… 
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… 
1985
1985
Prime factor decomposition of the discrete cosine transform and its hardware realization
The discrete cosine transform (DCT) is an useful tool in solving many digital signal processing problems. One of its more… 
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)