BSP M5
BSP M5
Why z-Transform?
• 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
Definition
• The z-transform of sequence x(n) is defined by
X ( z) x ( n) z
n
n
Fourier
Transform
Let z = ej.
X (e ) j
x ( n )e
n
j n
z-Plane
x ( n) z
Im
n
X ( z)
z = ej
n
Re
j
X (e ) x ( n )e
n
j n
Im
Re
Periodic Property of FT
X(ej)
X(z)
Im
| X ( z ) | x (
n
n ) z n
| x
n
( n ) || z | n
Im
ROC is an annual ring centered
on the origin.
r
Re Rx | z | Rx
x ( n) a n u ( n)
x(n)
... n
-8 -7 -6 -5 -4 -3 -2 -1 1 2 3 4 5 6 7 8 9 10
Example: A right sided Sequence
|
1
| az 1 | 1
X ( z) a u(n)z
n
n n | az
n 0
| z || a |
a n z n
1 z
n 0 X ( z ) (az )
1 n
1
n 0 1 az za
(az 1 ) n
| z || a |
n 0
Example: A right sided Sequence ROC
for x(n)=anu(n)
z
X ( z) , | z || a | Which one is stable?
za
Im Im
1 1
a a a a
Re Re
Example: A left sided Sequence
x(n) a nu (n 1)
-8 -7 -6 -5 -4 -3 -2 -1 1 2 3 4 5 6 7 8 9 10
... n
x(n)
Example: A left sided Sequence
n
| a
1
n 0
a n z n
n
| z || a |
a n z n
1 z
n 1 X ( z ) 1 (a z ) 1
1 n
1
n 0 1 a z z a
1 a n z n
n 0 | z || a |
Example: A left sided Sequence ROC
for x(n)=anu( n1)
z
X ( z) , | z || a | Which one is stable?
za
Im Im
1 1
a a a a
Re Re
Represent z-transform as a Rational
Function
P( z )
X ( z)
where P(z) and Q(z) are
polynomials in z.
Q( z )
z
x ( n) a n u ( n) X ( z) , | z || a |
za
Im
z
x(n) a nu (n 1) X ( z) , | z || a |
za
Im
x ( n) a n , 0 n N 1
N 1 N 1
1 (az 1 ) N 1 zN aN
X ( z) a z n n
( az )
1 n
N 1
n 0 n 0 1 az 1 z za
Im
N-1 zeros
ROC: 0 < z <
N-1 poles ROC does not include any pole.
Re
Always Stable
Properties of ROC
• 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.
More on Rational z-Transform
a b c
Re
More on Rational z-Transform
a b c
Re
More on Rational z-Transform
a b c
Re
More on Rational z-Transform
a b c
Re
Z-Transform Pairs
1
n | z || a |
a u (n) 1 az 1
1
a nu (n 1) | z || a |
1 az 1
Z-Transform Pairs
[sin 0 ]z 1
[sin 0 n]u (n) | z | 1
1 [2 cos 0 ]z 1 z 2
1 [r cos 0 ]z 1
[r n cos 0 n]u(n) | z | r
1 [2r cos 0 ]z 1 r 2 z 2
[r sin 0 ]z 1
[r n sin 0 n]u(n) | z | r
1 [2r cos 0 ]z 1 r 2 z 2
a n 0 n N 1 1 a N zN
| z | 0
0 otherwise 1 az 1
Properties of z-Transform
Linearity
Z[ x(n)] X ( z ), z Rx
Z[ y(n)] Y ( z), z Ry
Z[ x(n)] X ( z ), z Rx
Z[ x(n n0 )] z X ( z)
n0
z Rx
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
Differentiation of X(z)
Z[ x(n)] X ( z ), z Rx
dX ( z )
Z [nx(n)] z z Rx
dz
Time Reversal
Z[ x(n)] X ( z ), z Rx
1
Z[ x(n)] X ( z ) z 1 / Rx
Initial Value Theorem
x(n) 0, for n 0
x(0) lim X ( z )
z
Convolution of Sequences
Z[ x(n)] X ( z ), z Rx
Z[ y(n)] Y ( z), z Ry
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 )
Inverse z-Transform: Examples
Solution We get,
Using table,
Solution
We get,
Using table,
Inverse z-Transform: Examples
Example Find the inverse z-transform of
Solution Since,
By coefficient matching,
Therefore,
Solution
Using Table
Inverse z-Transform: Using Partial
Fraction
Problem: Find the inverse z-transform of
Finding the
constants:
Solution:
Dividing Y(z) by z,
Next find A:
Using the polar form,
Now we have:
Solution:
Dividing both sides by z:
Where,
Using the formulas for mth-order,
m=2, p=0.5
Then,
From Table,
Finally we get,
Partial Fraction Expansion Using MATLAB
Problem: Find the partial expansion of
Solution:
The denominator polynomial
can be found using MATLAB:
Therefore,
and
Solution:
Problem:
Solution:
Then
Transform domain Analysis
Shift-Invariant System
x(n) y(n)=x(n)*h(n)
h(n)
X(z) Y(z)
H(z)
Y ( z)
H ( z)
X ( z)
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
Representation in Factored Form
M
A (1 cr z 1 )
H ( z) N
r 1
r )
(1
k 1
d z 1
1 1
H ( z)
1 az 1 a Re
h( n) a n u ( n)