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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Addition is a fundamental function in arithmetic operation; several adder designs have been proposed for implementations in… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 5
  • figure 4
Is this relevant?
2012
2012
This paper presents a new prime factor algorithm (PFA) for non-power-of-two point FFT. Compared with the conventional prime… (More)
  • figure 1
  • table I
  • figure 4
  • figure 3
Is this relevant?
2008
2008
To achieve better sound quality and to improve data reception, digital radio mondiale (DRM) offers a worldwide initiative to… (More)
  • figure 1
  • table II
  • table I
  • figure 3
  • figure 2
Is this relevant?
Highly Cited
2006
Highly Cited
2006
DIAGNOSIX is a comprehensive fault diagnosis methodology for characterizing failures in digital ICs. Using limited layout… (More)
  • figure 1
  • figure 3
  • figure 2
  • table 1
  • figure 4
Is this relevant?
2004
2004
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… (More)
  • table 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
Highly Cited
2002
Highly Cited
2002
The 2-way quantum finite automaton introduced by Kondacs and Watrous[KW97] can accept non-regular languages with bounded error in… (More)
Is this relevant?
1995
1995
In this correspondence, new algorithms are presented for computing the 1-D and 2-D discrete cosine transform (DCT) of even length… (More)
  • figure 1
  • figure 2
Is this relevant?
1992
1992
Prime factor fast Fourier transform (FFT) algorithms have two important advantages: they can be simultaneously self-sorting and… (More)
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
1992
1992
In this correspondence, a method to convert any nesting DFT algorithm to the type I discrete W transform (DWT-I) is introduced. A… (More)
  • figure I
  • figure 4
  • table I
  • table I
Is this relevant?
1987
1987
This correspondence presents details of a new implementation of the prime factor FFT algorithm (PFA) for computing the discrete… (More)
  • table IV
  • table I
Is this relevant?