Advertisement

MFTA: Product of Two Distinct Primes

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

Abstract

The results of chapter 9 will now be extended to the case of a transform size that is a product of two distinct primes. As mentioned in the general introduction to multiplicative FT algorithms, several approaches exist for combining small size algorithms into medium or large size FT algorithms by the Good-Thomas FFT. The advantage of using the Good-Thomas FFT is that tensor product rules directly construct multiplicative FT algorithms for appropriate composite size cases. The method is completely algebraic and results in composite size algorithms whose factors contain tensor products of prime size factors. However, these results are not totally appealing since complex permutations appear. A related problem is that tensor products are taken over direct sum factors.

Keywords

Tensor Product Discrete Fourier Transform Fundamental Factorization Basic Algebra Real Multiplication 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Good, I. J. “The Interaction Algorithm and Practical Fourier Analysis”, J. R. Statist Soc. B, 20(2), 1958, pp. 361–372.MathSciNetMATHGoogle Scholar
  2. [2]
    Thomas, L. H. Using a Computer to Solve Problems in Physics, Application of Digital Computers, Ginn and Co., 1963.Google Scholar
  3. [3]
    Burrus, C. S. and Eschenbacher, P. W. “An In-place In-order Prime Factor FFT Algorithm”, IEEE Trans. Acoust. Speech and Signal Proc., 29(4), Aug. 1981, pp. 806–817.MATHCrossRefGoogle Scholar
  4. [4]
    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.MathSciNetMATHCrossRefGoogle Scholar
  5. [5]
    Kolba, D. P. and Parks, T. W. “A Prime Factor FFT Algorithm Using High-speed Convolution”, IEEE Trans. Acoust. Speech and Signal Proc., 25(4), Aug. 1977, pp. 281–294.MATHCrossRefGoogle Scholar
  6. [6]
    Blahut, R. E. Fast Algorithms for Digital Signal Processing, Addison-Wesley, 1985, Chapters 4 and 8.Google Scholar
  7. [7]
    Nussbaumer, H. J. Fast Fourier Transform and Convolution Algorithms, Second Edition, Springer-Verlag, 1982, Chapter 7.Google 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