Abstract
This chapter introduces a few features of the Discrete Fourier Transform (DFT) and its computation through the Fast Fourier Transform (FFT), which interpolates finite sequences of numbers by Fourier Series. The Fast Fourier Transform provides a comparison and contrast with the Fast Haar and Daubechies Wavelet Transforms in a context that involves complex exponentials and some linear algebra but that does not yet require calculus.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Nievergelt, Y. (1999). Discrete and Fast Fourier Transforms. In: Wavelets Made Easy. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0573-9_5
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0573-9_5
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6823-9
Online ISBN: 978-1-4612-0573-9
eBook Packages: Springer Book Archive