Advertisement

Multiplicative Fourier Transform Algorithm

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

Abstract

The Cooley-Tukey FFT algorithm and its variants depend upon the existence of nontrivial divisors of the transform size N. These algorithms are called additive algorithms since they rely on the subgroups of the additive group structure of the indexing set. A second approach to the design of FT algorithms depends on the multiplicative structure of the indexing set. We applied the multiplicative structure previously, in chapter 5, in the derivation of the Good-Thomas PFA.

Keywords

Discrete Fourier Transform Permutation Matrice Fast Fourier Transform Algorithm Multiplicative Structure Multiplicative Complexity 
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]
    Rader, C. M. “Discrete Fourier Transforms When the Number of Data Samples Is Prime”, Proc. IEEE, 56, 1968, pp. 1107–1108.CrossRefGoogle Scholar
  2. [2]
    Winograd, S. “On Computing the Discrete Fourier Transform”, Proc. Nat. Acad. Sci. USA., 73(4), April 1976, pp. 1005–1006.MathSciNetzbMATHCrossRefGoogle Scholar
  3. [3]
    Winograd, S. “On Computing the Discrete Fourier Transform”, Math. of Computation, 32(141), Jan. 1978, pp. 175–199.MathSciNetzbMATHCrossRefGoogle Scholar
  4. [4]
    Temperton, C. “A Note on Prime Factor FFT Algorithms”, J. Comp. Phys., 52, 1983, pp. 198–204.zbMATHCrossRefGoogle Scholar
  5. [5]
    Blahut, R. E. Fast Algorithms for Digital Signal Processing, Addison-Wesley, 1985, Chapter 8.Google Scholar
  6. [6]
    Kolba, D. P. and Parks, T. W. “Prime Factor FFT Algorithm Using High Speed Convolution”, IEEE Trans. Acoust., Speech and Signal Proc., 25, 1977, pp. 281–294.zbMATHCrossRefGoogle Scholar
  7. [7]
    Temperton, C. “Implementation of Prime Factor FFT Algorithm on Cray-1”, to be published.Google Scholar
  8. [8]
    Agarwal, R. C. and Cooley, J. W. “Fourier Transform and Convolution Subroutines for the IBM 3090 Vector Facility”, IBM J. Res. Devel., 30, Mar. 1986, pp. 145–162.MathSciNetCrossRefGoogle Scholar
  9. [9]
    Agarwal, R. C. and Cooley, J. W. “Vectorized Mixed Radix Discrete Fourier Transform Algorithms”, IEEE Proc., 75 (9), Sep. 1987.Google Scholar
  10. [10]
    Heideman, M. T. Multiplicative Complexity, Convolution, and the DFT, Springer-Verlag, 1988.Google Scholar
  11. [11]
    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
  12. [12]
    Tolimieri, R., Lu, C. and Johnson, W. R. “Modified Winograd FFT Algorithm and Its Variants for Transform Size N = p k and Their Implementations”, accepted for publication by Advances in Applied Mathematics.Google Scholar
  13. [13]
    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, Scotland, May 22–26.Google Scholar
  14. [14]
    Gertner, I. “A New Efficient Algorithm to Compute the Two-Dimensional Discrete Fourier Transform”, IEEE Trans. Acoust., Speech and Signal Proc., 36 (7), July 1988.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