Lecturer: Dr.

Norhashimah Mohd Saad

[email protected]
Hp: 019-2737234
 Chapter Outcome
 At the end of this chapter, the students should able to;
 Understand the concept of z-transform
 Derive the z-transform from the Fourier Transform
 Z-Plane and Polar Form
 Region of Convergence (ROC)
 Type of ROC
 Characteristic of ROC
 Z-transfrom table
 Solution of D.E and Transfer Function
 Z-Transform
 Is define as counterpart of the Laplace transform. This
transform is been used for solving variety problems of
resistor, inductor and capacitor in analogue system
analysis by using frequency domain.
 Also can be derived from the Fourier transform, same
as Laplace transform did.
 Convert the difference equation (system) to a simple
algebraic equation to find the solution in one step.
Z-transform is used in digital system,
Laplace transform in analogue system.
 Derivation of Laplace-
transform
 Derived from Fourier Transform;

X (s)  

x ( t ) e  st dt

y (t )  x (t ) e  t


 Recalling F.T.: X(f) 


x ( t ) e  j 2  ft dt

 
y( f )  

y ( t ) e  j 2  ft dt  

x ( t ) e   t e  j 2  ft dt


X (  j 2  f )  

x ( t ) e  (   j 2  f ) t dt where

s    j 2 f
 S-plane
j

X (s)  

x ( t ) e  st dt

where
s    j 2 f

0

Laplace Transform Relationship with Fourier

Transform (Continuous-Time System)
Z-Transform
 Originated from Laplace Transform
 For Discrete Time System Imz
 Definition of z-transform:

X [ z ]   x[n] z  n
n 0

z  re j Rez
where :
0
r | z | (Magnitude)
  z (Phase)
 Derivation of Z-transform
 The discrete time signal defined earlier as x[n] is the
previous chapter as below;
   ....  x[2] [t  2Ts ]  x[1] [t  1Ts ]  x[0] [t ]
 x[1] [t  1Ts ]  x[2] [t  2Ts ]  ...  

  x[n] [t  nT ]
n  
s

 This signal will be used in order to find it’s Laplace

transform.
  
X ( s)   x (t ) e  st
dt X ( s)    x[ n ] [t  nTs ]e  st
dt
  n  
 Derivation of Z-transform
 Continue…
 
X ( s)   
x[ n
n  
]  [t  nTs ]e  st
dt


X ( s)   x[ n
n  
]  e  snTs

 In the discrete form, we define or assume a new

variable (will become z-domain later) as

z  e sTs
 Derivation of Z-transform
 Instead of using ‘s’ as a domain in analogue system ,
now we will use ‘z’ as the domain for discrete time
signal’s transformation.
 The transform now as, 
X [ z ]  Z x[n]   x[n] z
n

n  

 The result is known as the bilateral(two-sided) z-

transform.
 However, considering a causal system through LTI
system, the z-transform will represent as

X [ z ]   x[n] z  n
n 0
 Derivation of inverse Z-transform
 As the z-transform (analysis function) for causal
system is

X [ z ]  Z x[n]   x[n] z n
n 0

 The inverse z-transform (generation function) can be

described as
1
x[n]  Z x[n] 
1
 X [ z ] z n 1
dz
2j
C
 Z in Polar Form
 In Z-Transform, time domain signal is transformed to
in z domain; time domain signal is mapped in Z-plane.

 Z-plane is complex plane that consists of real and

imaginary part. Now z can be expressed in polar form:
z  re j

X [ z]   x[ n
n  
] r n  j n
e

thus if r  z  1 then z  e j .
 Z-plane

which conclude that X[ejw] = X[z]

(z-Transform = Discrete time Fourier Transform)
Region of Convergence (ROC)
 Important Rules of ROC
 If the ROC includes the unit circle, Fourier transform
sequence also converges and the Z-Transform is
stable.

 If ROC does not include the unit circle, Fourier

transform diverge and the Z-Transform is non stable.
 ROC
Example 1: A discrete time signal is given as x[n]  a nu[n] ,
determine the X[z] and ROC.

az   1

Z-Transform as X [ z ]   x[ n
n  
] z n 1

a

1
X [ z]   a n

n  
u[ n ] z n
z
a  z@ z  a
X [ z ]   a z   az 
 
n n 1 n
And u[n]=1
n 0 n 0

To ensure X[z] exists the summation need to be converge.

 ROC
 Using Geometry Series, we can find the X[z] equation.
N2
 N
1
  N 21

az   az 
1 0 1  1   k

X [ z ]   az  1

1 n k N 1

n0 1  az 1

X [ z] 
az   az 
1 0 1 

1  az 1
1 0 1
X [ z]  
1  az 1
1  az 1
1
X [ z]  ,z a
1  az 1
 ROC
n
3
Example 2: A discrete time signal is given as x[n]    u[n]
, determine the X[z] and ROC. 4
 3 1 
  z  1
Z-Transform as X [ z ]   x[n] z n 4 
n  
3/ 4
n 1

3 z
X [ z ]     u[n] z  n
n    4  3/ 4  z @ z  3/ 4
n n

 3  n   3  1 

X [ z]     z     z 
n 0  4  n 0   4  
To ensure X[z] exists the summation need to be converge.
 ROC
 Using Geometry Series, we can find the X[z]
equation. 0
 3 1   3 1 
 1
N2
 N
 
1 N 21


X [ z]    z  
n  z   z 
 3 1   4   4    k

1
n 0  4  3 k N
1  z 1 1

4
0 
 3 1   3 1 
 z   z 
X [ z]  
4  4 
3
1  z 1
4
1 0 1
X [ z]  
3 3
1  z 1 1  z 1
4 4
1 3
X [ z]  ,z   As shaded area is included unit circle r=1, this signal has
3 4
1  z 1 its Fourier Transform therefore this signal is stable.
4
 ROC
Example 3: A discrete time signal is given as x[n]  1.65 u[n]
n

, determine the X[z] and ROC.

1.65z   1
1


Z-Transform as
X [ z]   x[n] z
n  
n
1.65
1

z
X [ z]   1.65 u[n] z 1.65  z @ z  1.65
n n

n  

X [ z ]   1.65 z   1.65z 
 
n n 1 n

n 0 n 0

To ensure X[z] exists the summation need to be converge.

 ROC
 Using Geometry Series, we can find the X[z] equation.

1.65 z   1.65 z 
N2
 N
 
1 N 21


1 0 1  1

X [ z ]   1.65 z


1 n  k

n 0 1  1.65 z 1 k N 1 1

X [ z] 
1.65 z   1.65 z 
1 0 1 

1  1.65 z 1
1 0 1
X [ z]  
1  1.65 z 1
1  1.65 z 1
1
X [ z]  , z  1.65
1  1.65 z 1

 As shaded area is excluded unit circle r=1, this signal does not
has Fourier Transform therefore this signal is not stable.
 ROC
Example 4: A discrete time signal is given as x[n]  a u[n  1]
n

determine the X[z] and ROC.


X [ z]   a z   1
n
x[ n ] z 1
n  
Z-Transform as  z
X [ z]    a u[n  1] z
n n
1
n   a
za
X [ z ]    az 
1
1 n

n  

X [ z ]    az    a z 
1 
1  n 1 n

n  n 1
To ensure X[z] exists the summation need to be converge.
 ROC
 Using Geometry Series, we can find the X[z] equation.
 a z   a z 1 1 1  1 N2
 N
1
  N 21

X [ z ]   a z    

1 n
 k

n 1 1 a z 1
k N 1 1
X [ z]  
a z   a z 
1 1 1 

1  a 1 z
a 1 z a 1 z az 1
X [ z]     1
1 a z 1
1  a z az
1

1
X [ z]  ,z a
1  az 1
 ROCn
3
Example 5: A discrete time signal is given as x[n]    u[n  1]
determine the X[z] and ROC. 4

  3  1 
X [ z]   x[n] z
n  
n
  z   1
 4  
 
Z-Transform as 
3
n
z
X [ z ]      u[n  1] z n 1
4  
3
n  
 
n  4
  3  1 
1
X [ z]       z  z 
3
n     4   4
n n
  3  1 
1  3  

1

X [ z ]       z       z 
n    4   n 1  4 
 
To ensure X[z] exists the summation need to be converge.
 ROC
 Using Geometry Series, we can find the X[z] equation.
   
 
1  1
  3  1    3  1  N 2N 2 N N
1 1 N N21 21

 
  z     z 
 
 3 
1

n

X [ z ]      z    
 4    4  
    
k

n 1  4 
  3
1

1   z
k kN N
1 1 1 1

4
1 
  3  1    3  1 
  z     z 
 4    4  
X [ z]     
1

3
1   z
4
1 1
3 3  3  1
  z   z  z
X [ z ]     1     1   
4 4 4
3 3  3  1
1   z 1    z  z
4 4  4
1 3
X [ z]  , z   As shaded area is excluded unit circle r=1, this signal does not
 3 4 has Fourier Transform therefore this signal is not stable.
1    z 1
 4
 ROC
Example 6: A discrete time signal is given as x[n]  1.65 u[ n  1]
n

determine the X[z] and ROC.

X [ z] 


 x[n] z n 1.65 z   1
1

Z-Transform as n  
z
X [ z]  

 1 .65  u[ 
n
n  1] z n 1
n  
1.65
X [ z ]    1.65z
1

1 n z  1.65
n  

X [ z ]    1.65z   
1 
  1.65 z
1  n 1 n

n  n 1

To ensure X[z] exists the summation need to be converge.

 ROC
 Using Geometry Series, we can find the X[z] equation.

1.65 z   1.65 z 
1 1 1  1 N2
 N
1
  N 21

 z     
 k
X [ z ]   1.65
1 n

1  1.65 z 1
1
n 1 k N 1

X [ z]  
1.65 z   1.65 z 
1 1 1 

1  1.65 z
1

X [ z]  
1.65 z   1.65 z  1.65z
1 1 1

1  1.65 z 1  1.65 z 1.65z

1 1 1

1
X [ z]  , z  1.65
1  1.65z 1

 As shaded area is excluded unit circle r=1, this signal has

Fourier Transform therefore this signal is stable.
 n
ROC
1
Example 7: A discrete time signal is given as x[n]    u[n]  2 u[n]
n

2
determine the X[z] and ROC.

 1 1 
X [ z]   x[n] z n
n  
 z  1
2 
Z-Transform as    1 n  n
1

X [ z ]      u[n]  2 u[n]  z

n 2 1
z
n    2 
  1
 z@ z 
1
2 2
   1 n n  n
X [ z ]       2 z

n 0  2 
  2 z   1
1

n

 1  n  2
X [ z ]     z   2  z  n 1
n

n 0  2  n 0
z
2  z@ z  2
 ROC
 Using Geometry Series, we can find the X[z] equation.
1 1
X [ z]  
1 1 1  2 z 1
1 z
2
3
 z 1
X [ z]  2
 1 1 
1  z 1  2 z 
1

 2 
3 1
 z
X [ z]  2
 5 1 2  1/2
 1  z  z 
 2 
 Two ROC were found in this case. Region that is overlaped with
the two will consider as the true ROC. Therefore z>2 is the ROC.
 ROC
n
 3
Example 8: A discrete time signal is given as x[n]     u[n]  1.5 u[ n  1]
 4
n

determine the X[z] and ROC.

 3 1 
 z  1
 4 
Z-Transform as 

3
4 1
X [ z]   x[ n
n  
] z n
z
3 3
  z@ z  
   3 n  n 4 4
X [ z ]       u[n]  1.5 u[ n  1]  z
 n

n   
 4  1.5 z   1
1

n
  3  1   

X [ z ]       z      1.5 z  z
 n
1
1
n 0   4    n 1  1.5
z  1.5
 ROC
 Using Geometry Series, we can find the X[z] equation.

1 1
X [ z]  
3 1 1  1.5 z 1
1 z
4
 2.25 z 1
X [ z] 
 3 1 9 2 
1  z  z 
 4 8 
1/2

 Two ROC were found in this case. Region that is overlaped with the
two will consider as the true ROC. Therefore 3/4<z<1.5 is the ROC.
 Type of ROC

Outward Inward ROC Ring / Plane ROC

ROC • Signal with “Donut- • Signal with
• Signal with range 0 to Shape” ROC range 0<n<N
range 0 to minus infinity • Both right and
• Signal with
infinity • Left side range infinity left side signal
• Right side signal to minus
signal infinity
• Both right and
left side signal
 Characteristic of ROC
 Z-transfrom is a combination of numerator P[z] and
denominator Q[z] of one polinomial equation of z.

P[ z ] b[0]  b[1]z 1  ..  b[ M ]z  M (1  c1z 1 )...(1  cM z 1 )

X [ z]   
Q[ z ] a[0]  a[1]z  ..  a[ M ]z
1 N
(1  d 1z 1 )...(1  d N z 1 )

 The values of z for which X(z) = 0 or equivalently P(z)=0 is

called the zeros of X(z).
 The values of z for which X(z) = ∞ or equivalently Q(z) = 0
is called the poles of X(z).
 Characteristic of ROC
ROC Type Existance of Fourier Pole and Zero
• Seperated with a cricle Transform • Roc is determined by only
• Centered by origin of z-plane • Only exist when ROC is poles
• Outward,inward, ring and included with unit circle • A pole can not be in ROC
plane • Also indicate the stability region

Left Side Signal Right Side Signal Both Side Signal

• Inward ROC type • Outward ROC type • Signal with infinty to minus
• Determined by the nearest • Determined by the farthermost infinity range
poles to the origin poles from the origin • Ring ROC type

Limited Signal Connected Region

• A sigal with limited length and • Region of ROC need to be
not infinity connected
• ROC covered all Z-plane except
z=0 and z=+/- infinity
 Time Domain Signal Z-Transform ROC

1 𝑑[𝑛] 1 𝐴𝑙𝑙 𝑧 𝑣𝑎𝑙𝑢𝑒

2 𝑢[𝑛] 1 𝑧 >1
1−𝑧

Z-Tranform Pair (ROC)

3 −𝑢[−𝑛 − 1] 1 𝑧 <1
1−𝑧
4 𝑑[𝑛 − 𝑚] 𝑧 𝐴𝑙𝑙 𝑧 𝑣𝑎𝑙𝑢𝑒𝑠 𝑒𝑥𝑐𝑒𝑝𝑡 0(𝑚 >
0)𝑜𝑟 ∞ (m<0)
5 𝑎 𝑢[𝑛] 1 𝑧 > |𝑎|
1 − 𝑎𝑧
6 −𝑎 𝑢[−𝑛 − 1] 1 𝑧 < |𝑎|
1 − 𝑎𝑧
7 𝑛𝑎 𝑢[𝑛] 𝑎𝑧 𝑧 > |𝑎|
1−𝑧
8 −𝑛𝑎 𝑢[−𝑛 − 1] 𝑎𝑧 𝑧 < |𝑎|
1−𝑧
9 𝑐𝑜𝑠 𝜔 𝑛 𝑢[𝑛] 1 − [𝑐𝑜𝑠 𝜔 ]𝑧 𝑧 >1
1 − 2𝑐𝑜𝑠 𝜔 𝑧 + 𝑧
10 𝑠𝑖𝑛 𝜔 𝑛 𝑢[𝑛] 1 − [𝑠𝑖𝑛 𝜔 ]𝑧 𝑧 >1
1 − 2𝑐𝑜𝑠 𝜔 𝑧 + 𝑧
11 𝑟 𝑐𝑜𝑠𝜔 𝑛 𝑢[𝑛] 1 − [𝑟𝑐𝑜𝑠 𝜔 ]𝑧 𝑧 > |𝑟|
1 − 2𝑟 𝑐𝑜𝑠 𝜔 𝑧 + 𝑟 𝑧
12 𝑟 𝑠𝑖𝑛 𝜔 𝑛 𝑢[𝑛] 1 − [𝑟𝑠𝑖𝑛 𝜔 ]𝑧 𝑧 > |𝑟|
1 − 2𝑟 𝑐𝑜𝑠 𝜔 𝑧 + 𝑟 𝑧
13 𝑎 ,0 ≤ 𝑛 ≤ 𝑁 − 1 1−𝑎 𝑧 𝑧 >0
0, 𝑒𝑙𝑠𝑒𝑤ℎ𝑒𝑟𝑒 1 − 𝑎𝑧
 Z-transform properties
Properties x(n) X(z)
Linearity a1 x1 ( n)  a 2 x 2 ( n) a1 X 1 ( z )  a 2 X 2 ( z )
Shift in time x(n  n0 ) z  n0 [ X ( z ]
Exponential Multiplication
n z
(by rn) r x(n) X( )
r
Differential Multiplication
nx (n) dX ( z )
(by n) z
dz
Convolution 


k 0
x1 ( k ) x 2 ( n  k ) X 1 ( z) X 2 ( z)
Initial Value Theorem x[n]=0 lim X ( z )
z 
Final Value Theorem lim x ( n ) lim[( z  1) X ( z )]
n z 1
 Solution of D.E and Transfer
Function
 Z-transform is used to determine the solution of a
difference equation (D.E)

 It transforms/ changes the time domain of D.E to the

other domain which in z-domain.

 I/O relationship of LTI system is defined as follows;

y[n]  a[1] y[n  1]  a[2] y[n  2]  x[n]

 Solution of D.E and Transfer
Function
 Applying the z-transform, the equation will be

Y [ z ]  a[1]Y [ z ]z 1  a[2]Y [ z ]z 2  X [ z ]

 By arranging the equation,

 
Y [ z ] 1  a[1]z 1  a[2]z 2  X [ z ]
 1 
Y [ z]    X [ z]
 
1  a[1] z 1
 a[ 2] z 2


 Solution of D.E and Transfer
Function
 The transfer function is represented as

Y [ z ] P[ z ] 1
H [ z]   
X [ z ] Q[ z ] 1  a[1]z 1  a[2]z  2 

 Thus, the general case of a transfer function is in the

form

 1  c[n]z 
M M

 b[n]z n n

H [ z]  n0 H [ z]  n 0

 1  d [n]z 
N N

 a[n]z n n

n 0
n 0
 Solution of D.E and Transfer
 Example 9: Function
x(n)  2  1 n
2
u[n]  3  2 n
3
 1
5 (3)
n
u[ n  1]
 Solution (use Table Z-T Pairs)


X ( z)  Z 2 2 u[n] Z 3  u[n] Z 
1 n 2 n
3
1
5 (3) n
u[n  1]
1 1 1
2 3  5
1

1 2 z
1 1
1 3 z
2 1
1  3z 1
2z 3z 1
5z
  
z  12 z  2 3 z  3
| z | 12 | z | 2 3 | z | 3
 ROC is 2/3 < |z| < 3
 ROC is the overlap from overall ROCs
 Inverse Z-Transform
 An operation to recover back time domain signal from
the transform domain (z).
 Circular integral normally is been used to find the
generation function x[n].
1
x[n]  Z x[n] 
1
 X [ z ] z n 1
dz
2j
C

 Despite of circular integral, there are other option to

gain baik the time domain signal
 Direct Mapping Method
 Partial Fraction Expansion Method
 Direct Mapping Method
 This method utilize the transform table as to map the
 transform domain(z) and
 ROC
in order to find their time domain signal.

 ROC is a unic component for the same transfrom

domain and it’s used to find the time domain signal.

 Refer the transformation table in page 33.

 Direct Mapping Method
3
 Example 10: A z-transform is given as X [z]  and
3 3
1  z 1
ROC is z . 4
4

3 1 1 A3
X [ z]   3.  A.
3 1
1 z
3 1
1 z 1  ( a ) z 1
a  3 / 4
4 4
n
 3 3
x[ n]  A  a u[ n]  3     u[n]
n
Is a right
 4 z side signal
4
 Partial Fraction Expansion
Method
P[ z ] b[0]  b[1]z 1  ..  b[ M ]z  M (1  c1z 1 )...(1  cM z 1 )
X [ z]   
Q[ z ] a[0]  a[1]z  ..  a[ M ]z
1 N
(1  d 1z 1 )...(1  d N z 1 )

1. N  M with different poles

2. M  N with different poles
3. N  M with multiple poles
 Partial Fraction Expansion
Method
1
 Example 11: A z-transform is given as X [ z] 
5 3
1  z 1  z 2
and ROC is 3
 z  2.
4 2
4
1 1 A B
X [ z]    
5 3  3 1   3 1  1  2 z 1 
1  z 1  z 2 1  z 1  2 z  1  z 
1

4 2  4   4 
 3 1 
1  z 
 3   3 
A1  z 1  B1  z 1  X [ z] 
1  2 z  1


A1  2 z  B 1  2 z 

1 1

 4   4   4   3   3  1  2 z  1
X [ z]   1  z 1  2 z  1  z 
1 1 1

 3 1 
1  z 1  2 z 
1  3 1 
1  z 
1  2 z 1   4   4 
 4   4 
 3  1
A
1  2 z 1 
B
B1  z 1 
1  3 1   3 1 
 A 
4  1  z  1  z 
1  2 z 1  z  3
4
1  2 z 1   4  z 2  4  z 2
3
z  1 1 3
4
A  
1  2 z  z  34 
1


11
1 1 8
1  2 1  B  
 3 1   3 1  11
N M
  3 1  z  1  
    4  z  2  4 2  
  4
  x[n]is
3 / 11 8 / 11 3 1 8 1
X [ z]      
 3 1  1  2 z 1  11  3 1  11 1  2 z 1 
1  z  1  z 
 4   4 
x[n]  3 / 11 3 / 4 u[n]  8 / 112  u[ n  1]
n n

3
 z 2
4
N M
 Partial Fraction Expansion
Method
1  2 z 1
 Example 12: A z-transform is given as X [ z] 
5 1
1  z 1  z 2
and ROC is z
1
. 6 6
2 1
1  2z 1  2 z 1 A B
X [ z]    
5 1
1  z 1  z 2 1  z 1 1  z 1  1  z 1  1  z 1 
1 1 1 1
6 6  2  3   2   3 
 1   1   1   1   1   1 
1  2 z 1 1  z 1  A1  z 1  B1  z 1  1  2 z 1 1  z 1  A1  z 1  B1  z 1 
 2    2   2  X [ z]   3    3   3 
X [ z] 
 1 1  1 1   1 1   1 1   1 1  1 1   1 1   1 1 
1  z 1  z  1  z  1  z  1  z 1  z  1  z  1  z 
 2  3   2   3   2  3   2   3 
 1 
 1  A1  z 1 
B1  z 1  1  2z 1

 
1  2z 1 3 
 A 
2  B
 1 1   1 1   1 1   1 1 
1  z  1  z  1  z  1  z 
 3  z 1  3  z1  2  z1  2  z1
3 3
2 2

1  2 z 1 1  2( 2)
A   9 1  2 z 1 1  2(3)
 1 1   1  B   10
1  z  1  ( 2)   1 1   1 
N M  3  z 1  3 
2
1  z  1  (3) 
 2  z 1  2 
3
  x[n]is
9 10 1 1
X [ z]    9   10 
 1 1   1 1 
 1  z  1  z 
 3 1 
1  z 
1  2 z 1 
 2   3   4 
x[n]  91 / 2  u[n]  101 / 3 u[n]
n n

1 1
z z
2 3
N M
 Partial Fraction Expansion
Method
1  2 z 1  4 z 2
 Example 13: A z-transform is given as X [ z] 
1
1  z 1
and ROC is z
1
. 2
2
1  2 z 1  4 z 2 13
X [ z]   8 z 1  12 
1 1
1  z 1 1  z 1
2 2

x[ n]  8 [n  1]  12 [n]  13(1 / 2) n u[n]

1
z
2
M N
diff . poles
 Partial Fraction Expansion
Method
1  2 z 1
X [ z] 
 Example 14: A z-transform is given as  1 1  3 1  1 1 
2

3 1  z 1  z 1  z 
and ROC is z
4
.  2  4  4 

1  2 z 1 A B C D
X [ z]  2    
     
2
 1 1  3 1  1 1 
1 3 1  1 1 
1  z 1  z 1  z  1  2 z  1  4 z  1  4 z  1  z 
1 1 1

 2  4  4         4 

1  2 z 1 12 1  2 z 1 33 1  2 z 1 3
A 2
 B  D 
 3 1  1 1  19 2
19  1 1  3 1  2
1  z 1  z   1 1  1 1 
 4  4  1  z 1  z  1  z 1  z 
 2  4  z  1
1
z
2  2  4  z
3
4 4

C ?
N M
multi. poles
 Partial Fraction Expansion
Method
 
1  d 1  2 z 1 
C 2 1   1 
dz  1 1  3 1 
2  1!  1  

1  z 1  z  
 4  2  4   z  1
4

C   4.
1  1/ 4 z 1
 3 / 8 z 2 (2)  (1  2 z 1 )(1 / 4  3 / 4 z 1 )
(1  1 / 4 z 1  3 / 8 z 2 ) z
1
4

C  1/ 8
 12 / 19 39  19 1/ 8  3/ 2
X [ z]    
 1 1   3 1   1 1   1 1 
2

1  z  1  z  1  z  1  z 
N M  2   4   4   4 
multi. poles
 Partial Fraction Expansion
 3/ 2
2 
1 / 4 z 1 Method
2 .  6z
 1 1   1 1  1 / 4 z 1
1  z   1  z  G[ z ] 
 4   4  1  1/ 4 z 1 2
az 1 n
X [ z]  .  6 z  G[ z ].  6.z 1
1  az 1 2
g[n]  n  u[n]
 4
x[n]  6 g[n  1]
x[n]  6 g[n  1]
n 1
1
x[n]  6[n  1]  u[ n  1]
 4

n n n n 1
 1 3 1 1
x[n]  12 / 19   u[ n]  39 / 19  u[n]  1 / 8  u[ n]  6[n  1]  u[ n  1]
 2 4  4  4
N M
multi. poles
Examples of Z-transform
Example 2
 Calculate the z-tranform, draw the pole-zero plot and
determine the stability for the following discrete-time
signals
x[n]  1 4n8
0 elsewhere
 and
n
x[n]  sin n0
4
0 elsewhere
Example of Inverse Z-transform
 A system is defined by a transfer function as
1
H [ z] 
1  z 1
 If the input given as
n
1
x[n]    n0
2
0 elsewhere

 Find the output y[n].

 1 1 1  2
1 z  z
X ( z)  2 4
1 1
1 z
4
1
z
X ( z) 
3 1 1  2
1 z  z
4 8
Thank you