Digital Signal Processing

Dr. Ahmad Salman

BEE2-CD
SEECS
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.
Course Outline
Objective :Develop basic understanding of Digital Signal
Processing Theory and Applications
A natural extension of Signals and Systems
Know the fundamental signal processing tools
Know how and where to use which tool
Develop a mathematical foundation for
advanced signal processing techniques
Course Outline
Required Text
Discrete-Time Signal Processing, 3
rd
Edition
Prentice Hall, Alan Oppenheim, Ronald Schafer
Lecture Notes

References
Schaums Outlines: Digital Signal Processing
M. H. Hayes (Practice Problems)
Understanding DSP-Lyons (2
nd
Edition)
DSP-System analysis and design
Paulo S. R. Diniz et al.

MATLAB Exercises
Signal Processing First J. H. McClellan et al.
Digital Signal Processing-A computer based approach Mitra
Unlimited resources on internet

DSP Where !
Communication Signal Processing for Communication
Equalization, Channel Estimation, Echo cancellation,
Detection, etc.
Cellular phones, Satellite receivers, Modems, etc.
Courtesy : Lake of Soft
DSP Where !
Speech (sound) applications
Speech compression, speaker identification, speech
enhancement in noisy environment, special effects
Cell Phones, MP3 Players, Movies, Dictation, Text-to-
speech,

Speech enhancement
Speaker Recognition
DSP Where !
Image Processing
Image is after all a 2-D signal
Raw Image
Filtered Image
Object tracking
DSP Where !
Biomedical Signal Processing
Magnetic Resonance, Tomography,
Electrocardiogram,

DSP Where !
Military
Radar, Sonar, Space photographs, remote
sensing
DSP Where !
Mechanical
Motor control, process control, oil and mineral
prospecting,
Automotive
ABS, GPS, Active Noise Cancellation, Cruise Control,
Parking,

Course Outline
Review (Chapter 2)
Discrete-Time Signals and System
Discrete-Time Signals: Sequences
Discrete-Time Systems
Linear Time-Invariant Systems
Properties of Linear Time-Invariant Systems
Linear Constant-Coefficient Difference Equations
Freq. Domain Representation of Discrete-Time Signals
Representation of Sequences by Fourier Transforms
Symmetry Properties of the Fourier Transform
Fourier Transform Theorems
Z-Transform (Chapter 3)
Properties of the Region of Convergence of the z-Transform
The Inverse Z-Transform
Z-Transform Properties

Course Outline
Sampling of Continuous-Time Signals (Chapter 4)
Periodic (Uniform) Sampling / Frequency-Domain
Representation
Reconstruction of a Bandlimited Signal from Its Samples
Discrete time processing of continuous time signals
Continuous time processing of discrete time signals

Transform Analysis of Linear Time-Invariant Systems
(Chapter 5)
The Frequency Response of LTI Systems
Constant-Coefficient Difference Equations
Frequency Response for Rational System Functions
Relationship between Magnitude and Phase
All-Pass Systems / Minimum-Phase Systems

Structures for Discrete-Time Systems (Chapter 6)
Block Diagram Representation /Signal Flow Graph
Representation
Basic Structures for IIR Systems / Transposed Forms
Basic Structures for FIR Systems
Effects of Coefficient Quantization
Effects of Round-Off Noise in Digital Filters (optional)
Course Outline
Filter Design Techniques (Chapter 7)
Design of Discrete-Time IIR Filters from Continuous-Time Filters
Design of FIR Filters by Windowing
Optimum Approximation of FIR Filters (time permitting)

The Discrete-Fourier Transform (Chapter 8)
Discrete Fourier Series
Properties of the Discrete Fourier Series
The Fourier Transform of Periodic Signals
Sampling the Fourier Transform
The Discrete Fourier Transform
Properties of the DFT

Computation of the Discrete-Fourier Transform FFT (Chapter 9)
Course Outline
Theory :
Quizzes (6-7, unannounced) 10%
Assignments (3-4) : 5%
OHTs (1 and 2) 30-40%
Final Exam 40 - 50%


Practical :
Labs : 40-50%
Project*: 15-20%
Final Lab Exam** : 20-30%
Discrete-Time Signals: Sequences
Discrete-time signals are represented by sequence of numbers
The n
th
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 x
c
(nT)
Where T is the sampling period
0 20 40 60 80 100
-10
0
10
t (ms)
0 10 20 30 40 50
-10
0
10
n (samples)
Basic Sequences and Operations
Delaying (Shifting) a sequence


Unit sample (impulse) sequence



Unit step sequence



Exponential sequences



] n n [ x ] n [ y
o
=

=
=
= o
0 n 1
0 n 0
] n [

>
<
=
0 n 1
0 n 0
] n [ u
n
A ] n [ x o =
-10 -5 0 5 10
0
0.5
1
1.5
-10 -5 0 5 10
0
0.5
1
1.5
-10 -5 0 5 10
0
0.5
1
Sinusoidal Sequences
Important class of sequences


An exponential sequence with complex




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


Are not necessary periodic with 2t/e
o


| | ( ) | + e = n cos n x
o
| e
= o = o
j j
e A A and e
o
| |
( )
| | ( ) ( ) | + e o + | + e o =
o = o = o =
| + e e |
n sin A j n cos A n x
e A e e A A n x
o
n
o
n
n j
n
n j
n
j n
o o
( ) ( ) ( ) | + e = | + t + e n cos n k 2 cos
o o
( ) ( ) integer an is
k 2
N if only N n cos n cos
o
o o o
e
t
= | + e + e = | + e
Demo
Sinusoidal Sequences
Discrete-Time Systems
Discrete-Time Sequence is a mathematical operation that
maps a given input sequence x[n] into an output sequence
y[n]



Example Discrete-Time Systems
Moving (Running) Average


Maximum


Ideal Delay System


]} n [ x { T ] n [ y =
T{.} x[n] y[n]
] 3 n [ x ] 2 n [ x ] 1 n [ x ] n [ x ] n [ y + + + =
{ } ] 2 n [ x ], 1 n [ x ], n [ x max ] n [ y =
] n n [ x ] n [ y
o
=
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


Sign


Counter Example
Ideal Delay System


( )
2
] n [ x ] n [ y =
{ } ] n [ x sign ] n [ y =
] n n [ x ] n [ y
o
=
Linear Systems
Linear System: A system is linear if and only if





Examples
Ideal Delay System







{ } { }
{ } { } (scaling) ] n [ x aT ] n [ ax T
and
y) (additivit ] n [ x T ] n [ x T ]} n [ x ] n [ x { T
2 1 2 1
=
+ = +
] n n [ x ] n [ y
o
=
T{x
1
[n]+x
2
[n]} = x
1
[n-n
o
]+x
2
[n-n
o
]
T{x
2
[n]}+T x
1
[n]
{ }
= x
1
[n-n
o
]+x
2
[n-n
o
]
T ax[n]
{ }
= ax
1
[n-n
o
]
aT x[n]
{ }
= ax
1
[n-n
o
]
Time-Invariant Systems
Time-Invariant (shift-invariant) Systems
A time shift at the input causes corresponding time-shift at output


Example
Square




Counter Example
Compressor System

{ } ] n n [ x T ] n n [ y ]} n [ x { T ] n [ y
o o
= =
( )
2
] n [ x ] n [ y =
| | ( )
| | ( )
2
o o
2
o 1
] n n [ x n - n y gives output the Delay
] n n [ x n y is output the input the Delay
=
=
] Mn [ x ] n [ y =
| |
| | ( ) | |
o o
o 1
n n M x n - n y gives output the Delay
] n Mn [ x n y is output the input the Delay
=
=
Causal System
Causality
A system is causal its output is a function of only the current and
previous samples

Examples
Backward Difference


Counter Example
Forward Difference



] n [ x ] 1 n [ x ] n [ y + + =
] 1 n [ x ] n [ x ] n [ y =
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


Example
Square




Counter Example
Log


< s < s
y x
B ] n [ y B ] n [ x
( )
2
] n [ x ] n [ y =
< s
< s
2
x
x
B ] n [ y by bounded is output
B ] n [ x by bounded is input if
( ) ] n [ x log ] n [ y
10
=
| | | | | | ( ) = = =
< s
n x log 0 y 0 n x for bounded not output
B ] n [ x by bounded is input if even
10
x