Discrete-time systems

Introduction

This module introduces the concept of processing a discrete-time signal by a discrete-time system and the classification of such systems.

Screencast video [⯈]



Module overview

This module will cover the following topics:

  1. System properties - Systems can be characterized in multiple ways. These properties will be discussed in this section.
  2. System visualization - This section will introduce the basic building blocks of a discrete-time systems.
  3. Impulse response - A system can be characterized by its impulse response, which represents the output of the first when a short pulse is applied to its input.
  4. Convolution - The operation performed by the filter can be denoted mathematically using the convolution operation.
  5. Cascading systems - When a signal is passed through multiple systems, these signals may be combined, such that the signal is passing to another single filter.
  6. Special convolutions [⯈] - When dealing with real-time signals or when having limited memory, the convolution operation might not be ideal, therefore some special convolution operations are introduced that solve these problems.



Summary

Most important system properties

x[n]y[n] ; x1[n]y1[n] ; x2[n]y2[n]

Memoryless:Output at n=n0 depends only on input at n=n0Causality:Response at n0 depends on input up to n=n0Invertibility:Input may be uniquely determined from outputAdditivity:x[n]=x1[n]+x2[n]y[n]=y1[n]+y2[n]Homogeneity:cx[n]cy[n]Impulse response:Response to δ[n]δ[n]h[n](BIBO) Stability:For A,B<,|x[n]|<A|y[n]|<B LTI n=|h[n]|<Linearity:x[n]=αx1[n]+βx2[n]y[n]=αy1[n]+βy2[n]Time-Invariance:x[nn0y[nn0]LTI:Linear Time-Invariance

Basic building blocks

Basic building blocks.

Realization scheme

Flow diagram.

Difference Equation

y[n]=k=0M1bkx[nk]+k=1N1aky[nk]

Impulse response properties LTI

BIBO stablility:n=|h[n]|<Causalilty:h[n]=0 for n<0

Convolution sum

y[n]=k=x[k]h[nk]=x[n]h[n]

Convolution sum procedure:

  1. Plot both input x and impulse response h as function of index k
  2. Mirror (reverse) h[k] h[k]
  3. For each new index n:
    1. Shift mirrored h[k] to index n h[nk].
    2. Output y[n] is equal to the result of the sum of element by element multiplications of x[k] and h[nk].
When the length of an input sequence of signal samples is N and the length of the sequence of impulse response values is M, then the convolution sum procedure results in a sequence of length N+M1 output signal samples y[n].

Convolution sum properties

Commutative:h[n]x[n]=x[n]h[n]Associative:{x[n]h1[n]}h2[n]=x[n]{h1[n]h2[n]}Distributive:x[n]h1[n]+x[n]h2[n]=x[n]{h1[n]+h2[n]}

Cascade equivalence properties LTI system

  • The cascading of two LTI systems, one with impulse response h1[n] and the other one with impulse response h2[n], can be combined to one LTI system with impulse response h[n]=h1[n]h2[n].
  • The order of two LTI systems, one with impulse response h1[n] and the other one with h2[n], can be interchanged.