Digital Signal Processing

  • Pierre Brémaud
Chapter

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 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2002

Authors and Affiliations

  • Pierre Brémaud
    • 1
    • 2
  1. 1.École Polytechnique Fédérale de LausanneSwitzerland
  2. 2.INRIA/École Normale SupérieureFrance

Personalised recommendations