MFTA: Transform Size N = Mr M-Composite Integer and r-Prime

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

Abstract

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

Keywords

Fast Fourier Transform Direct Computation Discrete Fourier Transform Digital Signal Processing Complete System 
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, Chapter 6, 8. Addison-Wesley, 1985.Google Scholar
  2. [2]
    Johnson, R.W. Lu, Chao and Tolimieri, R. “Fast Fourier Algorithms for the Size of 4p and 4pq and Implementations on VAX”, submitted for publication.Google Scholar
  3. [3]
    Lu, Chao Fast Fourier Transform Algorithms for Special N’s and the Implementations on VAX, Ph.D. Dissertation. Jan., 1988, the City University of New York.Google Scholar
  4. [4]
    Nussbaumer, H. J. Fast Fourier Transform and Convolution Algorithms, second edition, Chapter 7, Springer-Verlag,1982.Google Scholar

Copyright information

© Springer Science+Business Media New York 1989

Authors and Affiliations

  • R. Tolimieri
    • 1
  • Myoung An
    • 1
  • Chao Lu
    • 1
  1. 1.Center for Large Scale ComputingCity University of New YorkNew YorkUSA

Personalised recommendations