Abstract
Having discussed sampling and time-limiting and how they affect a signal’s spectrum, we move on to the estimation of the spectrum of a signal from the signal’s samples. In this chapter, we introduce the discrete Fourier transform, we discuss its significance, and we derive its properties. Then we discuss the family of algorithms know as fast Fourier transforms. We explain their significance, describe how one uses them, and discuss zero-padding and the fast convolution algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag London Limited
About this chapter
Cite this chapter
(2008). Fourier Analysis and the Discrete Fourier Transform. In: Digital Signal Processing. Signals and Communication Technology. Springer, London. https://doi.org/10.1007/978-1-84800-119-0_4
Download citation
DOI: https://doi.org/10.1007/978-1-84800-119-0_4
Publisher Name: Springer, London
Print ISBN: 978-1-84800-118-3
Online ISBN: 978-1-84800-119-0
eBook Packages: EngineeringEngineering (R0)