Waqas Ahmed

Introduction
z-Transform
Zeros and Poles
Region of Convergence
z-Transform Properties
Introduction
A generalization of Fourier transform
Why generalize it?
FT does not converge on all sequence
Notation good for analysis
Bring the power of complex variable theory deal
with the discrete-time signals and systems
z-Transform
The z-transform of sequence x(n) is defined by

=
n
n
z n x z X ) ( ) (
Let z = e
je
.
( ) ( )
j j n
n
X e x n e
e e

=
=

Fourier
Transform
Re
Im
z = e
je
e

=
n
n
z n x z X ) ( ) (
( ) ( )
j j n
n
X e x n e
e e

=
=

Fourier Transform is to evaluate z-transform
on a unit circle.
Zeros and Poles
Give a sequence, the set of values of z for which the
z-transform converges, i.e., |X(z)|<, is called the
region of convergence.
< = =


=

n
n
n
n
z n x z n x z X | || ) ( | ) ( | ) ( |
ROC is centered on origin and
consists of a set of rings.
A stable system requires that its Fourier transform is
uniformly convergent.
Re
Im
1
Fact: Fourier transform is to
evaluate z-transform on a unit
circle.
A stable system requires the
ROC of z-transform to include
the unit circle.
) ( ) ( n u a n x
n
=
n
n
n
z n u a z X

= ) ( ) (

=
0 n
n n
z a

=
0
1
) (
n
n
az
For convergence of X(z), we
require that
<

0
1
| |
n
az
1 | |
1
<

az
| | | | a z >
a z
z
az
az z X
n
n

= =

1
0
1
1
1
) ( ) (
| | | | a z >
a a
| | | | , ) ( a z
a z
z
z X >

=
Re
Im
1
a a
Re
Im
1
Which one is stable?
) 1 ( ) ( = n u a n x
n
n
n
n
z n u a z X

= ) 1 ( ) (
For convergence of X(z), we
require that
<

0
1
| |
n
z a
1 | |
1
<

z a
| | | | a z <
a z
z
z a
z a z X
n
n

= =

1
0
1
1
1
1 ) ( 1 ) (
| | | | a z <
n
n
n
z a

=
1
n
n
n
z a

=
1
n
n
n
z a

=
0
1
a a
| | | | , ) ( a z
a z
z
z X <

=
Re
Im
1
a a
Re
Im
1
Which one is stable?
Region of
Convergence
) (
) (
) (
z Q
z P
z X =
where P(z) and Q(z) are
polynomials in z.
Zeros: The values of zs such that X(z) = 0
Poles: The values of zs such that X(z) =
) ( ) ( n u a n x
n
=
| | | | , ) ( a z
a z
z
z X >

=
Re
Im
a
ROC is bounded by the
pole and is the exterior
of a circle.
) 1 ( ) ( = n u a n x
n
| | | | , ) ( a z
a z
z
z X <

=
Re
Im
a
ROC is bounded by the
pole and is the interior
of a circle.
A ring or disk in the z-plane centered at the origin.
The Fourier Transform of x(n) is converge absolutely iff the ROC includes
the unit circle.
The ROC cannot include any poles
Finite Duration Sequences: The ROC is the entire z-plane except possibly
z=0 or z=.
Right sided sequences: The ROC extends outward from the outermost
finite pole in X(z) to z=.
Left sided sequences: The ROC extends inward from the innermost
nonzero pole in X(z) to z=0.

Re
Im
a b c
Consider the z-transform
with the pole pattern:
Case 1: A right sided Sequence.
Re
Im
a b c
Consider the rational z-transform
with the pole pattern:
Case 2: A left sided Sequence.
Re
Im
a b c
Consider the rational z-transform
with the pole pattern:
Case 3: A two sided Sequence.
Re
Im
a b c
Consider the rational z-transform
with the pole pattern:
Case 4: Another two sided Sequence.
Important
z-Transform
Pairs
Sequence z-Transform ROC
) (n o 1
All z
) ( m n o
m
z

All z except 0 (if m>0)

or (if m<0)
) (n u
1
1
1

z
1 | | > z
) 1 ( n u
1
1
1

z
1 | | < z
) (n u a
n
1
1
1

az
| | | | a z >
) 1 ( n u a
n
1
1
1

az
| | | | a z <
z-Transform Theorems
and Properties
x
R z z X n x e = ), ( )] ( [ Z
y
R z z Y n y e = ), ( )] ( [ Z
y x
R R z z bY z aX n by n ax e + = + ), ( ) ( )] ( ) ( [ Z




Overlay of
the above two
ROCs
x
R z z X n x e = ), ( )] ( [ Z
x
n
R z z X z n n x e = + ) ( )] ( [
0
0
Z
+
< < =
x x-
R z R z X n x | | ), ( )] ( [ Z
x
n
R a z z a X n x a e =

| | ) ( )] ( [
1
Z
x
R z z X n x e = ), ( )] ( [ Z
x
R z
dz
z dX
z n nx e =
) (
)] ( [ Z
x
R z z X n x e = ), ( )] ( [ Z
x
R z z X n x / 1 ) ( )] ( [
1
e =

Z
x
R z z X n x e = ), ( )] ( [ Z
y
R z z Y n y e = ), ( )] ( [ Z
y x
R R z z Y z X n y n x e = ) ( ) ( )] ( * ) ( [ Z
33
both. of e convergenc of regions the inside of values for ) ( ) ( ) (
) ( ) ( ) (
let
) ( ) (
) ( ) ( ) (
Then
) ( ) ( ) (
z z Y z X z W
z z m y k x z W
k n m
z k n y k x
z k n y k x z W
k n y k x n w
k
k m
m
n
k n
n
n k
k
=
(
(

=
=
=
(
(

=
=