MFTA: Product of Two Distinct Primes

  • R. Tolimieri
  • Myoung An
  • Chao Lu
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 transform size N, N a product of two distinct primes. As mentioned in the general introduction to multiplicative FT algorithms, several approaches exist for combining small size FT algorithms into medium or large size FT algorithms by the Good-Thomas FT algorithms. Our approach emphasizes and is motivated by the results of chapter 9. By employing tensor product rules to a generalization of Rader’s multiplicative FT algorithms, we derive the fundamental factorization
$$F\pi =CA$$
(1)
where C is a block-diagonal matrix having skew-circulant blocks (rotated Winograd cores) and tensor products of these skew-circulant blocks and A is a matrix of pre-additions, all of whose entries are 0, 1 or −1. Variants will then be derived.

Keywords

Tensor Product Discrete Fourier Transform Unit Group Fundamental Factorization Zero Divisor 
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, vol. 20, No. 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., Boston, Mass., 1963.Google Scholar
  3. [3]
    Burrus, C.S. and Eschenbacher, P.W. “An In-place In-order Prime Factor FFT Algorithm”, IEEE Trans. on ASSP, Vol. 29, No. 4, pp. 806–817, Aug. 1981.MATHCrossRefGoogle Scholar
  4. [4]
    Chu, S. and Burrus, C.S. “A Prime Factor FFT Algorithm Using Distributed Arithmetic”, IEEE Trans. on ASSP, Vol. 30, No. 2, pp. 217–227, April 1982.MathSciNetMATHCrossRefGoogle Scholar
  5. [5]
    Kolba, D.P. and Parks, T.W. ” A Prime Factor FFT Algorithm Using High-speed Convolution”, IEEE Trans. on ASSP, Vol. 25, No. 4, pp. 281–294, Aug. 1977.MATHCrossRefGoogle Scholar
  6. [6]
    Johnson, R. W. Lu, Chao and Tolimieri, R. “Fast Fourier Transform Algorithms for the Sizes of Product of Distinct Primes and Implementations on VAX”, to be published.Google Scholar
  7. [7]
    Blahut, R. E. Fast Algorithms for Digital Signal Processing, Chapter 4 nad 8, Addison-Wesley Pub. Co., 1985.Google Scholar
  8. [8]
    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