MFTA: Composite Size

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

Abstract

In this chapter, we extend the methods introduced in the preceding two chapters to include the case of a transform size that is a product of three or more distinct primes. In fact, we will give a procedure for designing algorithms for transform size N = Mr, r a prime not dividing M, whenever an algorithm for transform size M is given. We will also include FT algorithms for transform size 4M, where M is a product of distinct odd primes.

Keywords

Fast Fourier Transform Discrete Fourier Transform Complete System Fundamental Factorization 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]
    Blahut, R. E. Fast Algorithms for Digital Signal Processing, Addison-Wesley, 1985, Chapters 6 and 8.Google Scholar
  2. [2]
    Lu, C. Fast Fourier Transform Algorithms for Special N’s and the Implementations on VAX, Ph.D. Dissertation, The City University of New York, Jan. 1988.Google Scholar
  3. [3]
    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