Properties of the Discrete Fourier Transform (DFT)
Conference paper
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.
Keywords
Fast FOURIER Transform Discrete FOURIER Transform Chinese Remainder Theorem Fast FOURIER Transform Algorithm Computational Saving
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.
References
- 1.J.W. Gooley and J.W. Tukey, An algorithm for the machine calculation of comples Fourier series, Maths. Computation, 19, 297–301, (1965).CrossRefGoogle Scholar
- 2.I.E.E.E. Trans. Audio Electroacoust. Vol. AU-15, June 1967.Google Scholar
- 3.I.E.E.E. Trans. Audio Electroacoust. Vol. AU-15, June 1969.Google Scholar
- 4.I.J. Good, The relationship between two Fast Fourier Transforms, I.E.E.E. Transactions on Computers C-20, 310–317, 1971.CrossRefGoogle Scholar
- 5.G.H. Hardy and E.M. Wright, An Introduction to the theory of numbers, Oxford: Clarendon Press, (1938).Google Scholar
- 1.I.J. Good, Analogues of Poisson’s summation formula, American Mathematical Monthly, 69, 259–266, 1962,MathSciNetMATHCrossRefGoogle Scholar
- 2.I.J. Good, A new finite series for Legendre polynomials, Proc. Camb. Phil. Soc. 51, 385–388, 1955.MathSciNetMATHCrossRefGoogle Scholar
- 3.M. Abramowitz, et al, Handbook of Mathematical Functions, Dover Publications Inc., New York, 1965.Google Scholar
Copyright information
© Springer Science+Business Media Dordrecht 1977