Digital Signal Processing

Pierre Brémaud ()
Additional contact information
Pierre Brémaud: École Polytechnique Fédérale de Lausanne

Chapter B3 in Mathematical Principles of Signal Processing, 2002, pp 95-113 from Springer

Abstract: 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, $$s = \left( {{s_0},...,{s_{N - 1}}} \right)$$ where s n = s(nΔ). The Fourier sum of this vector evaluated at pulsations ω k = 2kπ/N is the discrete Fourier transform (DFT).

Keywords: Impulse Response; Discrete Fourier Transform; Digital Signal Processing; Inversion Formula; Laurent Expansion (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4757-3669-4_6

Ordering information: This item can be ordered from
http://www.springer.com/9781475736694

DOI: 10.1007/978-1-4757-3669-4_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().