ECE 3331b

Introduction to Signal Processing

Lecture 8

Instructor: Dr. Ilia G. Polushin

Department of Electrical & Computer Engineering

Faculty of Engineering

The University of Western Ontario

Winter 2017
Schedule: Laboratories
Matlab tutorials: January 23rd January 27th

4 Lab sessions:

Lab 1: January 30th February 3rd

Lab 2: February 13th February 17th
Lab 3: March 13th March 17th
Lab 4: March 27th March 31st

Location: SEB 1004

Reports are due one week after the lab session. To be submitted to locker #
206, 2nd floor of TEB
Schedule: Laboratories

Lab Schedule by Section:

Section 003: Tuesday 9:30 a.m. 12:30 p.m. TAs: Farid, Anastasiia

Section 004: Thursday 4:30 p.m. 7:30 p.m. TAs: Soulaimane, Yousef
Section 005: Friday 12:30 p.m. 3:30 p.m. TAs: Samantha, Hessam
Section 006: Wednesday 2:30 p.m. 5:30 p.m. TAs: Samantha, Hessam

Section 007: Wednesday 11:30 a.m. 2:30 p.m. TAs: Farid, Anastasiia
Section 008: Monday 2:30 p.m. 5:30 p.m. TAs: Soulaimane, Yousef
Content:
Introduction: Signals, Systems and Signal Processing, Classification of Signals, The Concept
of Frequency in Continuous-Time and Discrete-Time Signals, Analog-to-Digital and Digital-to-
Analog Conversion.

Discrete-Time Signals and Systems: Discrete-Time Signals, Discrete-Time Systems, Anal-

ysis of Discrete-Time Linear Time-Invariant (LTI) Systems, Discrete-Time Systems Described
by Dierence Equations, Implementation of Discrete-Time Systems

The z-Transform and its Application to the Analysis of LTI Systems: The z-Transform,
Properties of the z-Transform, Rational z-Transforms, Inversion of the z-Transform, Analysis of
LTI Systems in the z-Domain, The One-sided z-Transform

Frequency Analysis of Signals: Frequency Analysis of Continuous-Time Signals Frequency

Analysis of Discrete-Time Signals Properties of the Fourier Transform for Discrete-Time Signals

Frequency-Domain Analysis of LTI Systems: Frequency-Domain Characteristics of LTI

Systems, Frequency Response of LTI Systems

The Discrete Fourier Transform: Frequency-Domain Sampling: The Discrete Fourier Trans-
form (DFT), Properties of the DFT

The Fast Fourier Transform

Homework 2

Homework 2 is posted on OWL

Solutions to Homework 2 will be posted on OWL on February 7th, 2017

Topic 3: The z-Transform and Its Application to the
Analysis of LTI Systems

The z-Transform

Properties of the z-Transform

Rational z-Transforms

Inversion of the z-Transform

Analysis of LTI Systems in the z-Domain

The One-sided z-Transform

The z-Transform

The z-Transform:

Is an important tool in the analysis of DT signals and DT LTI systems

Is a discrete-time counterpart to the Laplace transform

Simplifies the analysis of LTI systems

Provides with a means of characterizing an LTI system (in terms of pole-zero location)
The z-Transform

The z-transform transforms a discrete-time signal x(n) into a complex-

valued function X(z) 2 C of a complex variable z 2 C, according to the
formula

1
X
n
X(z) := x(n)z (ZT )
n= 1

Notation:
X(z) := Z [x(n)] .

The z-transform is defined only for those z 2 C for which the series in the
right-hand side of (ZT) converges.

The set of all values of z 2 C for which (ZT) converges is called the region
of convergence (ROC) of X(z).
The z-Transform
Example 3.1.1 (from Proakis & Manolakis, 2007): Determine the z-transforms
(and ROCs) of the following finite-duration signals

(a.) x1 (n) = {1, 2, 5, 7, 0, 1}

"
Answer: X1 (z) = 1 + 2z 1 + 5z 2 + 7z 3
+ z 5,
ROC: entire z-plane except z = 0.

(b.) x2 (n) = {1, 2, 5, 7, 0, 1}

"
Answer: X2 (z) = z 2 + 2z + 5 + 7z 1 + z 3 ,
ROC: entire z-plane except z = 0 and z = 1.

(e.) x3 (n) = (n)

Answer: X3 (z) = 1, ROC: entire z-plane.

(f.) x4 (n) = (n k), k > 0

Answer: X4 (z) = z k , ROC: entire z-plane except z = 0.

(g.) x5 (n) = (n + k), k > 0

Answer: X5 (z) = z k , ROC: entire z-plane except z = 1.
Families of Signals and Their ROCs
The z-Transform

For a finite-duration sequences, ROC is the entire z-plane except possibly

z = 0 and/or z = 1.

The case of infinite-duration sequences is more complicated.

Examples of regions of convergence for some infinite-duration sequences:

Families of Signals and Their ROCs
The Inverse z-Transform

Suppose we know z-transform of a signal X(z) and we must determine the

signal sequence x(n). The procedure of transforming back from z-domain to
time-domain is called the inverse z-transform.

The general formula for inverse z-transform is

I
1
x(n) = X(z)z n 1 dz, (IZT )
2j C
H
where C denotes the integral over a closed contour C
in the ROC of X(z) taken in counterclockwise direction.
C can be any contour in the ROC of X(z) which
encloses the origin.

We will never use formula (IZT) for calculation

of the inverse z-transform. Instead, simpler methods
for inversion of X(z) will be developed.
Topic 3: The z-Transform and Its Application to the
Analysis of LTI Systems

The z-Transform

Properties of the z-Transform

Rational z-Transforms

Inversion of the z-Transform

Analysis of LTI Systems in the z-Domain

The One-sided z-Transform

Some properties of the z-Transform
Linearilty: If

z z
x1 (n) ! X1 (z) and x2 (n) ! X2 (z),

then for any constants a1 , a2 ,

z
x(n) = a1 x1 (n) + a2 x2 (n) ! X(z) = a1 X1 (z) + a2 X2 (z).

Proof: We have
1
X 1
X
n n
X1 (z) := x1 (n)z , X2 (z) := x2 (n)z ,
n= 1 n= 1

therefore
1
X 1
X 1
X
n n n
X(z) := [a1 x1 (n) + a2 x2 (n)]z = a1 x1 (n)z + a2 x2 (n)z
n= 1 n= 1 n= 1

= a1 X1 (z) + a2 X2 (z).
Some properties of the z-Transform
Time shifting: If

z
x(n) ! X(z),

then for any integer k,

z k
x(n k) ! z X(z)

Proof: Denote y(n) := x(n k). We have

1
X
n
X(z) := x(n)z ,
n= 1

therefore
1
X 1
X 1
X
n n m k
Y (z) := y(n)z = x(n k)z = x(m)z
n= 1 n= 1 m= 1

1
X 1
X
m k k m k
= x(m)z z =z x(m)z =z X(z).
m= 1 m= 1

In the derivation above, we used the change of variables m := n k.

Some properties of the z-Transform
Folding (time-reversal): If

z
x(n) ! X(z) with ROC: r1 < |z| < r2 ,

then

z 1 1 1
x( n) ! X z with ROC: < |z| <
r2 r1
Scaling in the z-domain: If

z
x(n) ! X(z) with ROC: r1 < |z| < r2

then for any a 2 C

z
an x(n) ! X a 1
z with ROC: |a|r1 < |z| < |a|r2
Some properties of the z-Transform
Convolution: If

z z
x1 (n) ! X1 (z) and x2 (n) ! X2 (z),

then

z
x(n) = x1 (n) x2 (n) ! X(z) = X1 (z)X2 (z)

Convolution property is one of the most important properties of the z-transform because
it can greatly simplify the analysis of DT systems.
Some Properties of the z-Transform

Procedure for computation of convolution using z-transform:

Find z-transforms of x1 (n), x2 (n):

X1 (z) = Z [x1 (n)] , X2 (z) = Z [x2 (n)]

Multiply the two z-transform:

X(z) = X1 (z)X2 (z)

Find the inverse z-transform of X(z):

1
x(n) = Z [X(z)]

Typically, the above procedure is much easier computationally comparing to direct evaluation
of x1 (n) x2 (n) in the time domain
Some Properties of the z-Transform
Example 3.2.9 (from Proakis & Manolakis, 2007): Compute the convolution x(n) of the signals
(
1, 0 n 5
x1 (n) = {1, 2, 1} , x2 (n) :=
0, elsewhere
"
Solution:

Find z-transforms of x1 (n), x2 (n). We have

1 2 1 2 3 4 5
X1 (z) = 1 2z +z , X2 (z) = 1 + z +z +z +z +z

Multiply X1 (z) by X2 (z) to find X(z), as follows

1 6 7
X(z) = X1 (z)X2 (z) = 1 z z +z

Find the inverse z-transform of X(z) to obtain

x1 (n) = {1, 1, 0, 0, 0, 0, 1, 1} .
"
Some properties of the z-Transform

The Initial Value Theorem: If x(n) is causal (i.e., x(n) = 0 for n < 0), then

x(0) = lim X(z)

z!1

Proof: Since x(n) is causal, we have

1
X
n 1 2
X(z) = x(n)z = x(0) + x(1)z + x2 z + ...
n=0

We see that all terms in the right-hand side, except x(0), tend to zero as z ! 1.
Properties of the z-Transform: Summary
Properties of the z-Transform: Summary
Some Common z-Transform Pairs