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.
2016
2016
Durability performance of structural concrete made with coarse recycled concrete aggregates
There is often a poor perception of the durability of concrete made with recycled concrete aggregates (RCA), as well as concerns… 
2013
2013
Proofs of the convergence of the rewriting system for the weaving of aspects in the AO-PFA language by Qinglei Zhang
AO-PFA is an aspect oriented feature modelling language. This report discusses several theoretical issues regarding the weaving… 
2012
2012
On the strength of PFA I ∗ †
Building on the work of Schimmerling ([11]) and Steel ([17]), we show that the failure of square principle at a singular strong… 
2011
2011
Component Modeling and Three-phase Power-flow Analysis for Active Distribution Systems
Component Modeling and Three-Phase Power-Flow Analysis for Active Distribution Systems Mohamed Zakaria Kamh Doctor of Philosophy… 
2010
2010
Possibility of measuring thermal effects in the Casimir force
We analyze the possibility of measuring small thermal effects in the Casimir force between metal test bodies in configurations of… 
Review
2008
Review
2008
USING COAL FLY ASH IN ROAD CONSTRUCTION
Coal fly ash, or Pulverised Fuel Ash (PFA) as it has been traditionally known in the UK, has been used for many years in road… 
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… 
1993
1993
New high-speed prime-factor algorithm for discrete Hartley transform
Fast algorithms for computing the DHT of short transform lengths (N = 2, 3, 4, 5, 7, 8, 9 and 16) are derived. A new prime-factor… 
1993
1993
An efficient prime-factor algorithm for the discrete cosine transform and its hardware implementations
The input index mapping adopted is the Ruritanian mapping; the output index mapping is the same as B.G. Lee's (IEEE Trans. vol… 
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… 
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)