Good-Thomas PFA

  • Richard Tolimieri
  • Chao Lu
  • Myoung An
Part of the Signal Processing and Digital Filtering book series (SIGNAL PROCESS)


The additive FFT algorithms of the preceding two chapters make no explicit use of the multiplicative structure of the indexing set. We will see how the multiplicative structure can be applied, in the case of transform size N = RS, where R and S are relatively prime, to design an FT algorithm that is similar in structure to these additive algorithms but no longer requires the twiddle factor multiplication. The idea is due to Good [2] in 1958 and Thomas [8] in 1963, and the resulting algorithm is called the Good-Thomas Prime Factor algorithm (PFA).


Discrete Fourier Transform Permutation Matrix Index Point Permutation Matrice Multiplicative Structure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Burrus, C. S. and Eschenbacher, P. W. “An In-place In-order Prime Factor FFT Algorithm”, IEEE Trans. Acoust., Speech and Signal Proc, 29, 1981, pp. 806–817.zbMATHCrossRefGoogle Scholar
  2. [2]
    Good, I. J. “The Interaction Algorithm and Practical Fourier Analysis”, J. Royal Statist. Soc, Ser. B20, 1958, pp. 361–375.MathSciNetGoogle Scholar
  3. [3]
    Kolba, D. P. and Parks, T. W. “A Prime Factor FFT Algorithm Using high-speed Convolution”, IEEE Trans. Acoust., Speech and Signal Proc., 25, 1977.Google Scholar
  4. [4]
    Temperton, C. “A Note on Prime Factor FFT Algorithms”, J. Comput. Phys., 52, 1983, pp. 198–204.zbMATHCrossRefGoogle Scholar
  5. [5]
    Temperton, C. “A New Set of Minimum-add Small-n Rotated DFT Modules”, to appear in J. Comput. Phys. Google Scholar
  6. [6]
    Temperton, C. “Implementation of A Prime Factor FFT Algorithm on CRAY-1”, to appear in Parallel Computing. Google Scholar
  7. [7]
    Temperton, C. “A Self-Sorting In-place Prime Factor Real/half-complex FFT Algorithm”, to appear in J. Comput. Phys. Google Scholar
  8. [8]
    Thomas, L. H. “Using a Computer to Solve Problems in Physics”, in Applications of Digital Computers, Ginn and Co., 1963.Google Scholar
  9. [9]
    Chu, S. and Burrus, C. S. “A Prime Factor FFT Algorithm Using Distributed Arithmetic”, IEEE Trans. Acoust., Speech and Signal Proc., 30(2), April 1982, pp. 217–227.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1997

Authors and Affiliations

  • Richard Tolimieri
    • 1
  • Chao Lu
    • 2
  • Myoung An
    • 3
  1. 1.Department of Electrical EngineeringCity College of CUNYNew YorkUSA
  2. 2.Department of Computer and Information SciencesTowson State UniversityTowsonUSA
  3. 3.A.J. Devaney AssociatesAllstonUSA

Personalised recommendations