EEE324 Digital Signal Processing

Instructor: Dr Muhammad Fasih Uddin Butt

Course Objectives
„ To give the students a comprehension of the
concepts of discrete-time signals and systems
„ To give the students a comprehension of the
Z- and the Fourier transform and their inverse
„ To give the students a comprehension of the
relation between digital filters, difference
equations and system functions
„ To give the students knowledge about the most
important issues in sampling and reconstruction

1
 Course Objectives (contd…)
„ To make the students able to apply digital filters
according to known filter specifications
„ To provide the knowledge about the principles
behind the discrete Fourier transform (DFT) and
its fast computation
„ To be able to use MATLAB programming to
digital signal processing problems

Text & References

Course Text:
Discrete-Time Signal Processing, Alan V. Oppenheim,
Ronald W. Schafer with J. R. Buck, Second Edition.
References:
Digital Signal Processing, Alan V. John, G. Proakis,
Dimitris, G. Manolakis, Third Edition.
Signals and Systems, Alan V. Oppenheim, Alan S.Willsky
and S. Hamid Nawab, Second Edition.

2
 Prerequisites
Laplace and Fourier Transform

Recommended
Signals and Systems

Course Outline
„ Syllabus:
… Signals and Systems, LTI systems, Fourier Series,
Fourier Transform => Ch. 2
… Z-Transform => Ch. 3
… Sampling => Ch. 4
… Transform analysis LTI systems => Ch. 5
„ Multirate signal processing
„ Quantization issues
„ Noise shaping
… Structures for Discrete-Time systems => Ch. 6
… Filter Design Techniques => Ch. 7
… The Discrete Fourier Transform => Ch. 8
… Computation of DFT using FFT => Ch. 9

3
 Group home page:
http://groups.yahoo.com/group/ciit_betsp11_dsp
Group email address:
ciit_betsp11_dsp@yahoogroups.com

Grading Policy
Assignments 18%
Quizzes 07%
Sessional 1 10%
Sessional 2 15%
Final Exam 50%

Consultation Hours:
Tuesday 1:00 pm till 2:30pm, Room 417
Wednesday 11:30 am till 1:00pm, Room 417

4
 Motivation
LTI
System

+ H(z)

G(z)

Motivation

…Concept arises in all areas of technology

ranging from application to home devices to
very sophisticated engineering innovations.

…Advancement in technology is a result of

advancement in theory of digital signals and
systems.

5
Applications of DSP

„ Speech processing
… Enhancement – noise filtering
… Text-to-speech (synthesis)
… Recognition
„ Image processing
„ Multimedia processing
… Media transmission, digital TV, video conferencing
„ Communications
„ Biomedical engineering
„ Navigation, radar, GPS
„ Control, robotics

Signals
„ Broad definition: Functions of independent
variables.
… Examples: music, velocity of some car, your
cash, voltage or current in a circuit, your body
temperature, your heart’s blood pumping
rate..
„ Discrete in nature signals
… Examples: Stock market indices, population
statistics, average daily temperature

6
Analog and Discrete Signals
‰ An analog signal x(t) is a continuous
function of time; that is, x(t) is
uniquely defined for all t

‰ A discrete signal x(kT) is one that

exists only at discrete times; it is
characterized by a sequence of
numbers defined for each time, kT,
where
k is an integer
T is a fixed time interval.

Systems
System is a black box that transforms input signals to output
signals.
… Discrete-Time System: Input and output signals are discrete.
x[n] y[n]
h[n]

… Continuous-Time System: Input and output signals are

continuous.
x(t) y(t)
h(t)

… Combination is also possible, e.g. analog-to-digital or digital-to-

analog converters.

7
 Linear System
input output
‰ System: Linear System
T{.}
y(n) = T{x(n)}
where T{.} is an operator that maps an input sequence
x(n) into an output sequence y(n).
‰ Linear System: A system is linear if it obeys the
principle of superposition.
‰ Principle of superposition: If the input of a
system contains the sum of multiple signals then the
output of this system is the sum of the system responses
to each separate signal.

Superposition Example
u1 + u2 y1 + y2
Linear System
… Additivity T{.}

„ y1 = T{u1}; y2 = T{u2}
„ Y3 = T{u1 + u2} = y1 + y2
… Homogenity
au1 + bu2 ay1 + by2
Linear System
„ ky1 = T(ku1) T{.}

Non-linear Systems:
y(n) = x²(n) (i.e. T{.} = (.) ²)
T{x1(n) + x2(n)} = x1²(n) + x2²(n) + 2x1(n)x2(n)

8
 Linear Time Invariant System
„ A time-invariant system has properties unvarying
with time, i.e.:
if y(n) = T {x(n)}
implies
y(n-k) = T {x(n-k)}
„ Linear Time-invariant (LTI) system is a system
that is both linear and time-invariant (sometimes referred
to as a Linear Shift-Invariant (LSI) system)

Unit Step Function

9
The Unit Impulse Function

„ Dirac delta function δ(t) or impulse function is an

abstraction—an infinitely large amplitude pulse,
with zero pulse width, and unity weight (area
under the pulse), concentrated at the point where
its argument is zero.

Impulse Response
The sequence h[n] is the impulse response of
the System
h[n]
δ[n]

LTI system

10
 Operations with Signals
„ Add
„ Subtract
„ Multiply

Transformations of time variable

„ Shifting
… -ve shift

… +ve shift

11
 x(t) x(-t)
„ Flipping 1 1
t t
-2 -1 1 2
„ Scaling

x(2t) x(t/2)
1 1
t t
-1 -1/2 -4 -3 -2 -1

Superposition in LTI Systems

„ Exercise: Given response y(t) of an LTI system to the input signal x(t)
below, find response of that system to the input signals x1(t) and x2(t)
shown below. x(t) y(t)
2
1
t t
1 -1 1

x1(t) x2(t)
4
2
2
1 3 t
t
-1
-1/2 1/2 1

12
Sifting property of δ(t)
X(t)

„ x(t0) is the weight of X(t0)

the new scaled δ(t).
So x(t0) has been
sifted out
δ(t-t0)
1

X(t0)

Types of Systems
„ Linearity
„ Time invariance
„ Memory-less System: current input value is
being operated upon
y[n] = 2x[n]
These values are not stored in a register
„ Memory Holding System (Accumulator)
n
y[n] = ∑ x[ k ] = … … . + x[n - 2] + x[n - 1] + x[n]
k = −∞
n −1
y[n - 1] = ∑ x[ k ]
k = −∞

y [ n ] = y [ n − 1] + x[ n ]

13
„ Invertible System

„ Causality: The causal system is one in which

the output y[n] depends on the past and
present values of inputs. i.e { …. x[n-2], x[n-1],
x[n]} only.
y[n] = x[n]+y[n-1]

Noncausal if: y[n] = x[n]+y[n+1]

or y(t) = x(t+3)

Causality
An LTI system is causal if and only if its impulse
response
h[n] = 0 for n < 0
∞
y[n] = ∑ h[ k ] x[ n − k ]
k = −∞

From the definition of a causal system

(i.e., if h[n] = 0 for n < 0)
∞
y[n] = ∑ h[ k ] x[ n − k ]
k =0

So ,
−1

∑ h[ k ] x[ n − k ] = 0
k = −∞

14
Stability
An LTI system is stable if
∞

∑ | h[k ] |< ∞
k = −∞

The system is stable if the output signal is bounded for all bounded
Input signals; called the bounded input-bounded output (BIBO)
stability.
Let the input x[n] be bounded, as
| x[ n ] | ≤ M
Where M is a positive real finite number
∞
| y[n] | = ∑ h[k ]x[n − k ]
k = −∞
∞
≤ ∑ | h[k ] || x[n − k ] |
k = −∞
∞ ∞
≤M ∑ | h[k ] |
k = −∞
⇒ | y[n] |< ∞ if ∑ | h[k ] |< ∞
k = −∞

Means for an LTI system to be stable its impulse

response is absolutely summable
∞

∑ | h[k ] |< ∞
k = −∞

Which is the necessary and sufficient condition.

Example: Is h[n] stable?
h[n] = a nu[n]
compute sum,
∞ ∞

∑| a
k =0
k
| = ∑ | a |k = 1 + | a | + | a |2 + .....
k =0

From a mathematical handbook, the above geometric

series converges to
∞
1
k =0
∑| a
1- |a|
k
|=

The system is stable only for | a | < 1

15
Convolution Sum
Let h[n] be the response of the system to δ[n] Due to time-
invariance property, the response to δ[n-k] is simply h[n-k]
⇒ y[n] = T {x[n]}
⎧ ∞ ⎫
= T ⎨ ∑ x[k ]δ [n − k ]⎬
⎩k = −∞ ⎭
∞
= ∑ x[k ]T {δ [n − k ]}
k = −∞
∞
= ∑ x[k ]h[n − k ] = x[n] * h[n] called convolution sum
k = −∞

Order of convolution is not important

∞ ∞
x[n] * h[n] = ∑ x[k ]h[n − k ] = ∑ h[k ]x[n − k ] = h[n] * x[n]
k = −∞ k = −∞

For a continuous system

∞
y (t ) = ∫ h(τ ) x(t − τ )dτ
−∞

∞
y[n] = ∑ x[k ]h[n − k ]
k = −∞

„ Notice that this is not multiplication of x[n]

and h[n].
„ Visualizing meaning of convolution:
… Flip h[k]
… By shifting h[k] for all possible values of n, pass
it through x[n].

16
Properties of Convolution
„ Associativity x[n] * {h1[n] * h2[n]}
{x[n] * h1[n]} * h2[n]

„ Distributivity x[n] * {h1[n] + h2[n]}

x[n] * h1[n] + x[n] * h2[n]

x[n] y[n] x[n] y[n]

h1[n] h2[n] h2[n] h1[n]

x[n] h1[n]*h2[n] y[n]

h1[n]
x[n] y[n] x[n] y[n]
h1[n]+h2[n]
h2[n]

17