ECTE301: Digital Signal Processing

Lecture 3
The z-transform: Forward Transform & Properties
Part A's contents
Textbook
Lecture Topic Practice
Chapter
Lab 1
L1 Introduction to DSP 1, 2.1, 2.2
Tutorial 1
Lab 2
L2 Convolution and LTI Systems 2.3, 2.4
Tutorial 2
The z-transform: Tutorial 3
L3 3.1, 3.2, 3.3
Forward Transform and Properties Lab 3
The z-transform:
L4 3.4, 3.5 Tutorial 4
Inverse Transform and Applications
2.4, 2.5,
Random signals and Tutorial 4
L5 2.6, 12.1
Cross-correlation Sequences Report

L6 Revision of Weeks 1 to 6 - -

Digital Signal Processing S. L. Phung & A. Bouzerdoum 2/41

Lecture 3's objectives

 Learn the definition of the z-transform and its region of convergence.

 Understand the properties of the z-transform, and the common pairs of

z-transform.

 Learn techniques to find the z-transform and ROC for a sequence x(n).

Digital Signal Processing S. L. Phung & A. Bouzerdoum 3/41

Lecture 3's sequence

3.1 Definition of the z-transform

3.2 Region of convergence

3.3 Properties of the z-transform

Digital Signal Processing S. L. Phung & A. Bouzerdoum 4/41

3.1 Definition of the z-transform
 The z-transform of a sequence x(n) is defined as

 Here, z is a complex variable.

 The z-transform of x(n) is also denoted by

 The pair x(n) and X(z) are sometimes indicated as

Digital Signal Processing S. L. Phung & A. Bouzerdoum 5/41

Definition of the z-transform
 Example 3.1: Find z-transform of the unit sample sequence

-2 -1 0 1 2 n
 Answer: The z-transform is

Digital Signal Processing S. L. Phung & A. Bouzerdoum 6/41

Definition of the z-transform
 Example 3.2: Find z-transform of the unit step sequence

-2 -1 0 1 2 n

 Answer: The z-transform is

Digital Signal Processing S. L. Phung & A. Bouzerdoum 7/41

Lecture 3's sequence

3.1 Definition of the z-transform

3.2 Region of convergence

3.3 Properties of the z-transform

Digital Signal Processing S. L. Phung & A. Bouzerdoum 8/41

3.2 Region of convergence

 For a sequence x(n), the set of z values for which the z-transform
converges is called the region of convergence:

 Signal x(n) is uniquely determined by its X(z) and the ROC of X(z).

What is the general shape of the ROC?

Digital Signal Processing S. L. Phung & A. Bouzerdoum 9/41

Region of convergence
 If the z-transform exists, then the ROC is an annular region:

where r1 can be 0, and r2 can be ∞.

 Explanation:
● Express z as:

● The first sum converges if r is large enough:

● The second sum converges if r is small enough:

● If r2 > r1, the z-transform does not converge.

Digital Signal Processing S. L. Phung & A. Bouzerdoum 10/41
Region of convergence

Im{z}

r1 ROC: r1 < r
Im{z}
Re{z}
X(z) ROC
r1 < r < r2
r1

Im{z} r2
Re{z}

ROC: r < r2
r1 can be 0,
and r2 can be ∞.
Re{z}
r2

Digital Signal Processing S. L. Phung & A. Bouzerdoum 11/41

Region of convergence

We now analyze the ROC for four types of sequences.

3.2.1 3.2.2
Finite-duration Right-sided
sequences sequences

3.2.3 3.2.4
Left-sided Two-sided
sequences sequences

Digital Signal Processing S. L. Phung & A. Bouzerdoum 12/41

3.2.1 Finite-duration sequences
 x(n) has a finite-duration if it has a finite number of nonzero samples.

 That is, x(n) is nonzero for n1 ≤ n ≤ n2.

n1 n2

 The z-transform of x(n):

 The ROC exists everywhere, except possibly at:

Digital Signal Processing S. L. Phung & A. Bouzerdoum 13/41

Finite-duration sequences
 Example 3.3: Find z-transform and the ROC for

Arrow indicates x(n=0)

 Answer: The z-transform is

n -2 -1 0 1 2 3
x 1 2 5 7 0 1

The ROC is the entire z-plane, except at z = 0 and z = ∞.

Digital Signal Processing S. L. Phung & A. Bouzerdoum 14/41

Finite-duration sequences
 Example 3.4: Find z-transform and the ROC for

 Answer:

The ROC is the entire z-plane.

The ROC is the entire z-plane except at z = 0. (k positive integer)

The ROC is the entire z-plane except at z = ∞.

Digital Signal Processing S. L. Phung & A. Bouzerdoum 15/41

3.2.2 Right-sided sequences
 x(n) is a right-sided sequence if x(n) ≠ 0 for n > n1.

 The z-transform of this sequence is

 The ROC is the exterior of a circle:

 If n1 < 0, the ROC must exclude z = ∞.

Digital Signal Processing S. L. Phung & A. Bouzerdoum 16/41

Right-sided sequences
 Example 3.5: Find X(z) and its ROC for

 Answer: The z-transform is

Digital Signal Processing S. L. Phung & A. Bouzerdoum 17/41

Right-sided sequences

Im{z}
ROC: |a| < |z|
|a|

Re{z}

Digital Signal Processing S. L. Phung & A. Bouzerdoum 18/41

3.2.3 Left-sided sequences
 x(n) is a left-sided sequence if x(n) ≠ 0 for n < n2.

 The z-transform of this sequence is

 The ROC is the interior of a circle:

 If n2 > 0, the ROC must excludes z = 0.

Digital Signal Processing S. L. Phung & A. Bouzerdoum 19/41

Left-sided sequences
 Example 3.6: Find X(z) and its ROC for

 Answer: The z-transform is

Digital Signal Processing S. L. Phung & A. Bouzerdoum 20/41

Left-sided sequences

Im{z}
|a| ROC: |z| < |a|

Re{z}

Digital Signal Processing S. L. Phung & A. Bouzerdoum 21/41

Uniqueness of the z-transform

 X(z) by itself does not uniquely specify sequence x(n).

 From Examples 3.5 and 3.6:

 X(z) and its ROC together uniquely specify sequence x(n).

Digital Signal Processing S. L. Phung & A. Bouzerdoum 22/41

3.2.4 Two-sided sequences
 x(n) is a two-sided sequence if it extends for n = -∞ to ∞.

 The z-transform of such a sequence is

 The first series (right-sided) converges for:

 The second series (left-sided) converges for:

 If r1 < r2, the ROC is:

Digital Signal Processing S. L. Phung & A. Bouzerdoum 23/41

Two-sided sequences
 Example 3.7: Find X(z) and its ROC for

 Answer: The z-transform is

The ROC is:

If |a| ≥ |b|, the ROC does not exist.

Digital Signal Processing S. L. Phung & A. Bouzerdoum 24/41
Two-sided sequences

Im{z}

a Re{z}

Digital Signal Processing S. L. Phung & A. Bouzerdoum 25/41

Lecture 3's sequence

3.1 Definition of the z-transform

3.2 Region of convergence

3.3 Properties of the z-transform

Digital Signal Processing S. L. Phung & A. Bouzerdoum 26/41

3.3 Properties of the z-transform

 In this section, we study the properties of the z-transform and the

common z-transform pairs.

 These are summarized in two tables.

 These tables are important tools in solving z-transform problems.

Digital Signal Processing S. L. Phung & A. Bouzerdoum 27/41

Properties of the z-transform

Section 3.3.1
Section 3.3.2
Section 3.3.3
Section 3.3.4

Section 3.3.5
Section 3.3.6

Section 3.3.7
Section 3.3.8

Digital Signal Processing S. L. Phung & A. Bouzerdoum 28/41

Common z-transform pairs

Slide 6
Slide 7
Slide 17

Slide 20

Slide 30

Slide 33

Digital Signal Processing S. L. Phung & A. Bouzerdoum 29/41

3.3.1 Linearity
 A linear combination in time-domain corresponds to a linear
combination in the z-domain:

 Example 3.8: Find the z-transform of

 Answer:

Digital Signal Processing S. L. Phung & A. Bouzerdoum 30/41

3.3.2 Time shifting
 Shifting right by k samples in the time-domain is equivalent to
multiplication by z-k in the z-domain:

 Example 3.9: Find the relationship between Y(z) and X(z) for the
following LTI system:

 Answer: Applying the z-transform to both sides gives

 The ratio Y(z)/X(z) is called the system function.

Digital Signal Processing S. L. Phung & A. Bouzerdoum 31/41
3.3.3 Time-reversal
 Reversal in time-domain is equivalent to z-inversion in the z-domain:

 Example 3.10: Find the z-transform of

 Answer: We know already that (Slide 30)

Applying the time-reversal property gives

Note:

Digital Signal Processing S. L. Phung & A. Bouzerdoum 32/41

3.3.4 Scaling
 Multiplication with an in time-domain is equivalent to scaling by a-1 in
the z-domain:

 Example 3.11: Find the z-transform of

 Answer: We already know (Slide 30):

Applying the scaling property gives

Digital Signal Processing S. L. Phung & A. Bouzerdoum 33/41

3.3.5 Differentiation
 Multiplication with n in time-domain is equivalent to differentiation in
the z-domain:

 Example 3.12: Find the z-transform of

 Answer: We already know:

Hence, applying the differentiation property gives

Note:

Digital Signal Processing S. L. Phung & A. Bouzerdoum 34/41

3.3.6 Convolution
 Convolution in time is equivalent to multiplication in the z-domain:

h(n)

H(z)

Digital Signal Processing S. L. Phung & A. Bouzerdoum 35/41

Convolution
 Example 3.13: Use the z-transform to compute the output of the
following system (assuming a ≠ b)

 Answer:
Note:

Compare with
Tutorial 2,
Problem 2(b)

Digital Signal Processing S. L. Phung & A. Bouzerdoum 36/41

3.3.7 Initial value theorem

 If x(n) is a causal sequence, i.e., x(n) = 0 for n < 0, then

 Using this theorem, we can find x(0) without having to find the inverse
z-transform.

 This theorem is also useful for checking errors in z-transform

calculation.

Digital Signal Processing S. L. Phung & A. Bouzerdoum 37/41

Initial value theorem
 Example 3.14: Given that

find x(0).

 Answer:

Note:

Digital Signal Processing S. L. Phung & A. Bouzerdoum 38/41

3.3.8 Final value theorem

 If a causal sequence x(n) converges, then

 Using this theorem, we can find x(∞) without having to find the inverse
z-transform.

 This theorem is also useful for checking errors in z-transform

calculation.

Digital Signal Processing S. L. Phung & A. Bouzerdoum 39/41

Final value theorem
 Example 3.15: Given that

find x(∞).

 Answer:

Note:

Digital Signal Processing S. L. Phung & A. Bouzerdoum 40/41

Lecture 3's summary
To revise for this lecture:

 Define the z-transform.

 Determine the ROC for different types of sequences x(n).

 Understand the key properties of the z-transform.

 Familiarize with the common z-transform pairs.

 Learn to compute the z-transform X(z) for a given x(n).

 Practice: Tutorial 3, Lab 2 Appendix.

Digital Signal Processing S. L. Phung & A. Bouzerdoum 41/41