Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
H. J. Nussbaumer, P. Quandalle: Fast computation of discrete Fourier transforms using polynomial transforms. IEEE Trans. ASSP-27, 169–181 (1979)
H. 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–513
C. M. Rader: Discrete Fourier transforms when the number of data samples is prime. Proc. IEEE 56, 1107–1108 (1968)
G. Bonnerot, M. Bellanger: Odd-time odd-frequency discrete Fourier transform for symmetric real-valued series. Proc. IEEE 64, 392–393 (1976)
C. M. Rader, N. M. Brenner: A new principle for fast Fourier transformation IEEE Trans. ASSP-24, 264–266 (1976)
I. J. Good: The relationship between two fast Fourier transforms. IEEE Trans. C-20, 310–317 (1971)
S. Winograd: On computing the discrete Fourier transform. Math. Comput. 32, 175–199 (1978)
H. J. Nussbaumer: DFT computation by fast polynomial transform algorithms. Electron. Lett. 15 701–702 (1979)
H. J. Nussbaumer, P. Quandalle: Computation of convolutions and discrete Fourier transforms by polynomial transforms. IBM J. Res. Dev. 22, 134–144 (1978)
R. C. Agarwal, J. W. Cooley: New algorithms for digital convolution. IEEE Trans. ASSP-25, 392–410 (1977)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Nussbaumer, H.J. (1982). Computation of Discrete Fourier Transforms by Polynomial Transforms. In: Fast Fourier Transform and Convolution Algorithms. Springer Series in Information Sciences, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-81897-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-81897-4_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11825-1
Online ISBN: 978-3-642-81897-4
eBook Packages: Springer Book Archive