Advertisement

MFTA: p2

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

Abstract

Multiplicative prime power FT algorithms will be derived. Although multiplicative indexing will play a major role as in the preceding chapters, the multiplicative structure of the underlying indexing ring is significantly more complex, and this increased complexity will be reflected in the resulting algorithms.

Keywords

Fast Fourier Transform Discrete Fourier Transform Unit Group Fast Fourier Transform Algorithm 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.

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 4 and 8.Google Scholar
  2. [2]
    Heideman, M. T. Multiplicative Complexity, Convolution, and the DFT, Springer-Verlag, 1988, Chapter 5.Google Scholar
  3. [3]
    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
  4. [4]
    Lu, C. and Tolimieri, R. “Extension of Winograd Multiplicative Algorithm to Transform Size N=p 2 q, p 2 qr and Their Implementation”, Proc. ICASSP 89, 19 (D.3), Scotland.Google Scholar
  5. [5]
    Nussbaumer, H. J. Fast Fourier Transform and Convolution Algorithms, Second Edition, Springer-Verlag, 1982.Google Scholar
  6. [6]
    Tolimieri, R., Lu, C. and Johnson, W. R. “Modified Winograd FFT Algorithm and Its Variants for Transform Size N=p n and Their Implementations,” Advances in Applied Mathematics, 10 pp. 228–251, 1989.MathSciNetzbMATHCrossRefGoogle Scholar
  7. [7]
    Winograd, S. “On Computing the Discrete Fourier Transform”, Proc. Nat. Acad. Sci. USA, 73(4), April 1976, pp. 1005–1006.MathSciNetzbMATHCrossRefGoogle Scholar
  8. [8]
    Winograd, S. “On Computing the Discrete Fourier Transform”, Math. of Computation, 32, Jan. 1978, pp. 175–199.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