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
0 20 40 60 80 100 t (ms)
10

-10
0 10 20 30 40 50 n (samples)
Copyright (C) 2005 Güne 351M Digital Signal Processing 2
r Arslan
 Basic Sequences and Operations
• Delaying (Shifting) a sequence
y[n]  x[n  no ]
1.5
• Unit sample (impulse) sequence
1
0 n  0
[n]   0.5
1 n  0 0
-10 -5 0 5 10
1.5
• Unit step sequence
0 n  0 1
u[n]  
1 n  0 0.5

0
-10 -5 0 5 10
• Exponential sequences 1

x[n]  An 0.5

0
-10 -5 0 5 10
Copyright (C) 2005 Güne 351M Digital Signal Processing 3
r Arslan
 Sinusoidal Sequences
• Important class of sequences
xn  cos on  
jo
• An exponential sequence with complex    e and A  A e j

xn  An  A e j  e jon  A  e j on   

n n

xn  A  cos on    j A  sin on  

n n

• x[n] is a sum of weighted sinusoids

• Different from continuous-time, discrete-time sinusoids
– Have ambiguity of 2k in frequency
cos  o  2k n    cos on  

– Are not necessary periodic with 2/o

2k
cos on    cos on  oN   only if N  is an integer
o
Copyright (C) 2005 Güne 351M Digital Signal Processing 4
r Arslan
 Demo

Rotating Phasors Demo

Copyright (C) 2005 Güne 351M Digital Signal Processing 5

r Arslan
 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 x[n], x[n  1], x[n  2]

– Ideal Delay System
y[n]  x[n  no ]

Copyright (C) 2005 Güne 351M Digital Signal Processing 6

r Arslan
 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]
2

– Sign
y[n]  sign x[n]

• Counter Example
– Ideal Delay System

y[n]  x[n  no ]

Copyright (C) 2005 Güne 351M Digital Signal Processing 7

r Arslan
 Linear Systems
• Linear System: A system is linear if and only if

T{x1[n]  x2[n]}  T x1[n]  T x2[n] (additivity)

and
Tax[n]  aT x[n] (scaling)

• Examples
– Ideal Delay System
y[n]  x[n  no ]

T{x1[n]  x2[n]}  x1[n  no ]  x2[n  no ]

T{x2[n]}  T x1[n]  x1[n  no ]  x2[n  no ]
Tax[n]  ax1[n  no ]
aT x[n]  ax1[n  no ]

Copyright (C) 2005 Güne 351M Digital Signal Processing 8

r Arslan
 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 x[n  no ]

• Example
– Square

y1 n   x[n  no ]
2
Delay the input the output is
y[n]   x[n]
2

yn - no    x[n  no ]
2
Delay the output gives

• Counter Example
– Compressor System

Delay the input the output is y1 n  x[Mn  no ]

y[n]  x[Mn]
Delay the output gives yn - no   xMn  no  

Copyright (C) 2005 Güne 351M Digital Signal Processing 9

r Arslan
 Causal System
• Causality
– A system is causal it’s 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 Güne 351M Digital Signal Processing 10

r Arslan
 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]  Bx    y[n]  By  

• Example
y[n]   x[n]
2
– Square
if input is bounded by x[n]  Bx  
output is bounded by y[n]  B2x  

• Counter Example
– Log
y[n]  log10  x[n] 
even if input is bounded by x[n]  Bx  
output not bounded for xn  0  y0  log10  xn   
Copyright (C) 2005 Güne 351M Digital Signal Processing 11
r Arslan