The z-Transform

z-Transform Theorems and

Properties

Digital Signal Processing Lecture 1

Linearity

Z[ x(n)] = X ( z), z  Rx
Z[ y(n)] = Y ( z ), z  Ry

Z[ax(n) + by(n)] = aX ( z ) + bY ( z ), z  Rx  Ry
Overlay of
the above two
ROC’s
Digital Signal Processing Lecture 2
Shift
Z[ x(n)] = X ( z), z  Rx

Z[ x(n + n0 )] = z X ( z ) n0
z  Rx

Digital Signal Processing Lecture 3

Multiplication by an Exponential Sequence

Z[ x(n)] = X ( z), Rx- | z | Rx+

−1
Z[a x(n)] = X (a z )
n
z | a | Rx

Digital Signal Processing Lecture 4

Differentiation of X(z)

Z[ x(n)] = X ( z), z  Rx

dX ( z )
Z[nx(n)] = − z z  Rx
dz
Digital Signal Processing Lecture 5
Conjugation

Z[ x(n)] = X ( z), z  Rx

Z[ x * (n)] = X * ( z*) z  Rx
Digital Signal Processing Lecture 6
Reversal

Z[ x(n)] = X ( z), z  Rx

−1
Z[ x(−n)] = X ( z ) z 1 / Rx
Digital Signal Processing Lecture 7
Real and Imaginary Parts

Z[ x(n)] = X ( z), z  Rx

Re[ x(n)] = 12 [ X ( z) + X * ( z*)] z  Rx

Im [ x(n)] = 21j [ X ( z ) − X * ( z*)] z  Rx
Digital Signal Processing Lecture 8
Initial Value Theorem

x(n) = 0, for n  0

x(0) = lim X ( z )
z →
Digital Signal Processing Lecture 9
Convolution of Sequences

Z[ x(n)] = X ( z), z  Rx
Z[ y(n)] = Y ( z ), z  Ry

Z[ x(n) * y(n)] = X ( z )Y ( z ) z  Rx  Ry
Digital Signal Processing Lecture 10
Convolution of Sequences


x ( n) * y ( n) =  x(k ) y (n − k )
k = −

 

 −n
Z[ x(n) * y (n)] =    x(k ) y (n − k )  z
n = −  k = − 
   
=  x(k )  y(n − k )z −n
= 
k = −
x(k ) z −k  y (
n = −
n )z −n

k = − n = −

= X ( z)Y ( z)
Digital Signal Processing Lecture 11
The z-Transform
System Function

Digital Signal Processing Lecture 12

Shift-Invariant System

x(n) y(n)=x(n)*h(n)
h(n)

X(z) H(z) Y(z)=X(z)H(z)

Digital Signal Processing Lecture 13
Shift-Invariant System

X(z) Y(z)
H(z)
Y ( z)
H ( z) =
X ( z)
Digital Signal Processing Lecture 14
Nth-Order Difference Equation

N M

a
k =0
k y (n − k ) =  br x(n − r )
r =0

N M
Y ( z ) ak z − k = X ( z ) br z − r
k =0 r =0

M N
−r −k
H ( z ) =  br z  ak z
r =0 k =0
Digital Signal Processing Lecture 15
Representation in Factored Form

Contributes poles at 0 and zeros at cr

M
A (1 − cr z −1 )
H ( z) = N
r =1

 r )
(1
k =1
− d z −1

Contributes zeros at 0 and poles at dr

Digital Signal Processing Lecture 16
Stable and Causal Systems

Causal Systems : ROC extends outward from the outermost pole.

Im

M
A (1 − cr z −1 )
H ( z) = N
r =1
Re

 r )
(1
k =1
− d z −1

Digital Signal Processing Lecture 17

Stable and Causal Systems

Stable Systems : ROC includes the unit circle.

Im

M
A (1 − cr z −1 ) 1

H ( z) = N
r =1
Re

 r )
(1 −
k =1
d z −1

Digital Signal Processing Lecture 18

Example
Consider the causal system characterized by

y(n) = ay(n −1) + x(n) Im

1 1
H ( z) =
1 − az −1 a Re

h(n) = a nu(n)
Digital Signal Processing Lecture 19
Determination of Frequency Response from pole-zero pattern

• A LTI system is completely characterized by its pole-

zero pattern.
Im

Example: p1
z − z1 e j0
H ( z) =
( z − p1 )( z − p2 ) z1
Re

j0 e j0 − z1 p2
H (e )=
(e j0 − p1 )(e j0 − p2 )
Digital Signal Processing Lecture 20
Determination of Frequency Response from pole-zero pattern

j is completely characterized
• A LTI system
|H(e )|=?
zero pattern.
j H(e )=?
by its pole-

Im

Example: p1
z − z1 e j0
H ( z) =
( z − p1 )( z − p2 ) z1
Re

j0 e j0 − z1 p2
H (e )=
(e j0 − p1 )(e j0 − p2 )
Digital Signal Processing Lecture 21
Determination of Frequency Response from pole-zero pattern

• A LTI system
|H(e )|=?
zero pattern. H(e )=?
j is completely characterized
j by its pole-

Im

Example: p1
2
| |
|H(ej)| = e j0
| || | z1
1
3 Re

H(ej) = 1−(2+ 3 ) p2
Digital Signal Processing Lecture 22
Example
1
H ( z) =
20

−1
1 − az 10

dB
Im 0

-10
0 2 4 6 8

a Re 0

-1

-2
0 2 4 6 8

Digital Signal Processing Lecture 23