Abstract
This paper will be divided into two parts. The first is intended as a companion to a tutorial session on those basic properties of the DFT which lead to Fast Fourier Transform algorithms. The second part will range more widely, in particular considering ways in which certain less well-known properties of the DFT could be turned to practical use. The two parts are independent.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.W. Gooley and J.W. Tukey, An algorithm for the machine calculation of comples Fourier series, Maths. Computation, 19, 297–301, (1965).
I.E.E.E. Trans. Audio Electroacoust. Vol. AU-15, June 1967.
I.E.E.E. Trans. Audio Electroacoust. Vol. AU-15, June 1969.
I.J. Good, The relationship between two Fast Fourier Transforms, I.E.E.E. Transactions on Computers C-20, 310–317, 1971.
G.H. Hardy and E.M. Wright, An Introduction to the theory of numbers, Oxford: Clarendon Press, (1938).
I.J. Good, Analogues of Poisson’s summation formula, American Mathematical Monthly, 69, 259–266, 1962,
I.J. Good, A new finite series for Legendre polynomials, Proc. Camb. Phil. Soc. 51, 385–388, 1955.
M. Abramowitz, et al, Handbook of Mathematical Functions, Dover Publications Inc., New York, 1965.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1977 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Conolly, B.W. (1977). Properties of the Discrete Fourier Transform (DFT). In: Tacconi, G. (eds) Aspects of Signal Processing With Emphasis on Underwater Acoustics, Part 2. NATO Advanced Study Institutes Series, vol 33-2. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-3036-3_11
Download citation
DOI: https://doi.org/10.1007/978-94-011-3036-3_11
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-5350-1
Online ISBN: 978-94-011-3036-3
eBook Packages: Springer Book Archive