Discrete-Time Signals and Systems

Quote of the Day Mathematics is the tool specially suited for dealing with abstract concepts of any kind and there is no limit to its power in this field. Paul Dirac
Content and Figures are from Discrete-Time Signal Processing, 2e by Oppenheim, Shafer, and Buck, 1999-2000 Prentice Hall Inc.

Discrete-Time Signals: Sequences

Discrete-time signals are represented by sequence of numbers
The nth number in the sequence is represented with x[n]

Often times sequences are obtained by sampling of continuous-time signals

In this case x[n] is value of the analog signal at xc(nT) Where T is the sampling period
10

-10 10

20

40

60

80

100

t (ms)

-10

10

20

30

40

50

n (samples)
2

Copyright (C) 2005 Gner Arslan

351M Digital Signal Processing

Basic Sequences and Operations

Delaying (Shifting) a sequence

y[n] ! x[n  no ]
Unit sample (impulse) sequence
1.5 1 0.5 0 -10 1.5 1 0.5 0 -10 1 -5 0 5 10 -5 0 5 10

0 n{0 H[n] ! 1 n!0

Unit step sequence

0 n 0 u[n] ! 1 nu0
Exponential sequences

x[n] ! AEn

0.5

0 -10
Copyright (C) 2005 Gner Arslan

-5

10

351M Digital Signal Processing

Sinusoidal Sequences
Important class of sequences

x? A ! cos[on  J n
An exponential sequence with complex E ! E e
j[o

and A ! A e jJ

x? A ! AE ! A e E e n
n jJ n

j[on

! A E e j[on  J
n

x? A ! A E cos[on  J  j A E sin[on  J n

x[n] is a sum of weighted sinusoids Different from continuous-time, discrete-time sinusoids
Have ambiguity of 2Tk in frequency

cos[o  2Tk  J ! cos[on  J n

Are not necessary periodic with 2T/[o cos[on  J ! cos[on  [oN  J only if N !
Copyright (C) 2005 Gner Arslan

2Tk is an integer [o
4

351M Digital Signal Processing

Demo

Rotating Phasors Demo

Copyright (C) 2005 Gner Arslan

351M Digital Signal Processing

Discrete-Time Systems
Discrete-Time Sequence is a mathematical operation that maps a given input sequence x[n] into an output sequence y[n]

y[n] ! T{x[n]}

x[n]

T{.}

y[n]

Example Discrete-Time Systems

Moving (Running) Average

y[n] ! x[n]  x[n  1]  x[n  2]  x[n  3]

Maximum

y[n] ! max_ [n], x[n  1], x[n  2]a x

Ideal Delay System

y[n] ! x[n  no ]
Copyright (C) 2005 Gner Arslan

351M Digital Signal Processing

Memoryless System
Memoryless System
A system is memoryless if the output y[n] at every value of n depends only on the input x[n] at the same value of n

Example Memoryless Systems

Square

y[n] ! x[n]
Sign

y[n] ! sign_ [n]a x

Counter Example
Ideal Delay System

y[n] ! x[n  no ]
Copyright (C) 2005 Gner Arslan

351M Digital Signal Processing

Linear Systems
Linear System: A system is linear if and only if

T{x1[n]  x2[n]} ! T_ 1[n]a T_ 2[n]a (additivity) x x and T_ [n]a! aT_ [n]a (scaling) ax x
Examples
Ideal Delay System

y[n] ! x[n  no ] T{x1[n]  x2[n]} T{x2[n]}  T_ 1[n]a x T_ [n]a ax aT_ [n]a x

Copyright (C) 2005 Gner Arslan

! x1[n  no ]  x2[n  no ] ! x1[n  no ]  x2[n  no ] ! ax1[n  no ] ! ax1[n  no ]

8

351M Digital Signal Processing

Time-Invariant Systems
Time-Invariant (shift-invariant) Systems
A time shift at the input causes corresponding time-shift at output

y[n] ! T{x[n]} y[n  no ] ! T_ [n  no ]a x

Example
Square
2

y[n] ! x[n]

Delay the input the output is Delay the output gives

y1 ? A ! x[n  no ] n

2 2

y? - no A ! x[n  no ] n

Counter Example
Compressor System

y[n] ! x[Mn]

Delay the input the output is Delay the output gives

y1 ? A ! x[Mn  no ] n

A y? - no A ! x?   no n Mn
9

Copyright (C) 2005 Gner Arslan

351M Digital Signal Processing

Causal System
Causality
A system is causal its output is a function of only the current and previous samples

Examples
Backward Difference

y[n] ! x[n]  x[n  1]

Counter Example
Forward Difference

y[n] ! x[n  1]  x[n]

Copyright (C) 2005 Gner Arslan

351M Digital Signal Processing

10

Stable System
Stability (in the sense of bounded-input bounded-output BIBO)
A system is stable if and only if every bounded input produces a bounded output

x[n] e Bx
Example
Square

g y[n] e By

y[n] ! x[n]

if input is bounded by x[n] e Bx output is bounded by y[n] e B2 x

g g

Counter Example
Log

y[n] ! log10 x[n]

even if input is bounded by x[n] e Bx g
11

output not bounded for x? A ! 0 y? A ! log10 x? A ! g n 0 n

Copyright (C) 2005 Gner Arslan

351M Digital Signal Processing