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.
KeywordsFast Fourier Transform Discrete Fourier Transform Unit Group Fast Fourier Transform Algorithm Multiplicative Structure
Unable to display preview. Download preview PDF.
- Blahut, R. E. Fast Algorithms for Digital Signal Processing, Addison-Wesley, 1985, Chapters 4 and 8.Google Scholar
- Heideman, M. T. Multiplicative Complexity, Convolution, and the DFT, Springer-Verlag, 1988, Chapter 5.Google Scholar
- 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
- 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
- Nussbaumer, H. J. Fast Fourier Transform and Convolution Algorithms, Second Edition, Springer-Verlag, 1982.Google Scholar