In this chapter we study the discrete-time Fourier analysis techniques, i.e., the DTFT (Discrete-Time Fourier Transform), DFT (Discrete Fourier Transform), and DFS (Discrete Fourier Series) of a discrete-time sequence, which will be used to describe and analyze the frequency characteristics of discrete-time signals and the frequency-domain behavior of discrete-time systems. We also deal with the fast Fourier transform (FFT), which is a very efficient algorithm for computing the DFT.
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.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Yang, W.Y. (2009). Discrete-Time Fourier Analysis. In: Signals and Systems with MATLAB. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92954-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-92954-3_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92953-6
Online ISBN: 978-3-540-92954-3
eBook Packages: EngineeringEngineering (R0)