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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Nievergelt, Y. (2013). Discrete and Fast Fourier Transforms. In: Wavelets Made Easy. Modern Birkhäuser Classics. Birkhäuser, New York, NY. https://doi.org/10.1007/978-1-4614-6006-0_5
Download citation
DOI: https://doi.org/10.1007/978-1-4614-6006-0_5
Published:
Publisher Name: Birkhäuser, New York, NY
Print ISBN: 978-1-4614-6005-3
Online ISBN: 978-1-4614-6006-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)