Computation of Discrete Fourier Transforms by Polynomial Transforms
- 420 Downloads
As indicated in the previous chapter, polynomial transforms can be used to efficiently map multidimensional convolutions into one-dimensional convolutions and polynomial products. In this chapter, we shall see that polynomial transforms can also be used to map multidimensional DFTs into one-dimensional DFTs. This mapping is very efficient because it is accomplished using ordinary arithmetic without multiplications, and because it can be implemented by FFT-type algorithms when the dimensions are composite.
KeywordsDiscrete Fourier Transform Arithmetic Operation Real Multiplication Real Operation Reduction Modulo
Unable to display preview. Download preview PDF.
- 7.2H. J. Nussbaumer, P. Quandalle: “New Polynomial Transform Algorithms for Fast DFT Computation”, in IEEE 1979 Intern. Acoustics, Speech and Signal Processing Conf. Proc., pp. 510–513Google Scholar
- 7.5C. M. Rader, N. M. Brenner: A new principle for fast Fourier transformation IEEE Trans. ASSP-24, 264–266 (1976)Google Scholar
- 7.6I. J. Good: The relationship between two fast Fourier transforms. IEEE Trans. C-20, 310–317 (1971)Google Scholar
- 7.10R. C. Agarwal, J. W. Cooley: New algorithms for digital convolution. IEEE Trans. ASSP-25, 392–410 (1977)Google Scholar