Abstract
Suppose we need to compute numerically the FT of a stable signal s(t). In practice only a finite vector of samples is available,
where s n = s(nΔ). The Fourier sum of this vector evaluated at pulsations ω k = 2kπ/N is the discrete Fourier transform (DFT).
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
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Brémaud, P. (2002). Digital Signal Processing. In: Mathematical Principles of Signal Processing. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3669-4_6
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3669-4_6
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-2956-3
Online ISBN: 978-1-4757-3669-4
eBook Packages: Springer Book Archive