Jatiya Kabi Kazi Nazrul Islam University

Trishal, Mymensingh-2220

Assignment
on
“The Z transform: The Z-transform and its properties; The inverse Z-transform”

Course Name: Digital Signal Processing

Course Code: CSE-409

Submitted to:
Dr. Md. Sujan Ali
Professor,
Dept. of CSE, JKKNIU

Submitted by:
Komal Chandra Banik
Roll No: 17102003
Reg. No: 5680
Session: 2016-17
Dept. of CSE, JKKNIU

Submission date:16-06-2021
 INDEX

Topic no. Topic title Page no.

01 The z-transform 02-05

02 Region of Convergence 05-06

03 Properties of z-transform 06-18

04 Application of z-transform 19

05 Advantages and disadvantages of z-transform 20

06 The inverse z-transform 21-26

Page | 1
What is Z-Transform?
In mathematics and signal processing, the Z-transform converts a discrete-time signal,
which is a sequence of real or complex numbers, into a complex frequency-domain
representation. It has wide range of applications in mathematics and digital signal
processing. It is mainly used to analyze and process digital data.
‘z' is any point in the z-plane. In mathematics, the complex plane or z-plane is a geometric
representation of the complex numbers established by the real axis and the perpendicular
imaginary axis.

Geometric representation of z and its conjugate z̅ in the complex plane. The distance along
the light blue line from the origin to the point z is the modulus or absolute value of z. The
angle φ is the argument of z.
Z-Transform:
 The Fourier transform of a discrete time signal X[n] is defined as:

    xn e

j  j n
Xe
n  

provided is absolutely summable:



 | x n |
n  


Page | 2
• Obviously some signals may not satisfy this condition and their Fourier transform do not
exist.
j
• To overcome this difficulty, we can multiply the given exponential function e
by certain values of the real parameter r so that x[n] may be forced to be summable.
Now the discrete time Fourier transform becomes:

X  r.e    x n r.e

j  jn

n  

The z-transform of a discrete-time signal x(n) is defined by


X  z   x n z
n  
-n

j
Where z  r.e is a complex variable. The values of z for which the sum converges
define a region in the z-plane referred to as the region of convergence (ROC).
There are two types of Z transform:

1. Single sided Z transform

2. Double-sided Z transform 

1. Single sided Z transform:

As we know that a single-sided Z transform of discrete time signal x (n) is defined as,

       ∞
X (Z) = ∑     x (n) Z -n
              n=0

Here "Z" is a complex variable. In this equation limits of summation are from the 0 too ∞.
So while expanding the summation we will put only positive values of n (from the range n
= 0 ton = ∞). So this is single-sided or one-sided Z- transform.

Page | 3
2. Double-sided Z transform 

As we know that a double-sided Z transform of discrete time signal x (n) is defined as,

       ∞
X (Z) = ∑     x (n) Z –n
 n= - ∞

While expanding the summation we will put both positive as well as negative values of "n".
Thus this is called a double-sided Z transform.

How to denote Z transform?

The relationship between x(n) and X(Z) is indicated as given below:

         Z
x (n) ↔ X (Z)

Note that X (Z) is Z transform of x (n), always when Z transform of the sequence is
obtained then it is denoted by capital letter, X (Z) Here arrow is bidirectional. This is
because we can also obtain x (n) from X (Z) using the inverse Z transform.
The Z transform of x (n) is also denoted as in this form,

X (Z) = Z {x(n)}
So here x (n) and X(Z) are called as Z transform pairs.
The z-transform and the DTFT:
• The z-transform is a function of the complex z variable
• If we plot z=ej for =0 to 2 we get the unit circle

Page | 4
Convergence of the z-Transform:
• DTFT does not always converge
∞
X ( e jω ) = ∑ x [ n ] e− jωn
n=−∞
• Complex variable z can be written as r ej so the z-transform
∞ ∞
jω − jω −n −n − jωn
X ( re )= ∑ x [n ] ( ℜ ) = ∑ (x[n] r )e
n=−∞ n=−∞
• DTFT of x[n] multiplied with exponential sequence r -n
• For certain choices of r the sum maybe made finite
∞
∑ |x [ n ] r-n|<∞
n=−∞

Region of Convergence
Definition of ROC: 

The ROC stands for the region of convergence of X(Z) is set for all the values of Z for
which X(Z)  attains a finite value. Every time when we find Z transform we must indicate
its ROC.

The significance of ROC:

 ROC will decide whether a system is stable or unstable

 ROC also determine the type of sequence that means: Causal or no causal, Finite or
infinite
 The set of values of z for which the z-transform converges
 Each value of r represents a circle of radius r
 The region of convergence is made of circles

Example: z-transform converges for values of 0.5<r<2

Page | 5
ROC is shown in this following figure-

In this example the ROC includes the unit circle, so DTFT exists

Example:
∞ ∞
n n n
x [ n ]= a u [ n ] ⇒ X (z )= ∑ a u [ n ] z = ∑ ( az−1 )
−n

n=−∞ n=0

For Convergence we require

 n
 az
n0
1


Inside the ROC series converges to

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

Page | 6
Region outside the circle of radius a is the ROC
Clearly, X(z) has a zero at z = 0 and a pole at z = a.
Properties of ROC for Z transform:

 The ROC is a ring, whose center is at an origin

 ROC cannot contain any pole
 By definition a pole is a where X(z) is infinite. Since X(z) must be finite for all z for
convergence, there cannot be a pole in the ROC.
 If x[n] is a finite-duration sequence, then the ROC is the entire z-plane, except
possibly z=0 or |z|=∞.
 A finite-duration sequence is a sequence that is nonzero in a finite interval n1≤n≤n2.
 As long as each value of x[n] is finite then the sequence will be absolutely summable.
 When n2>0 there will be a z-1 term and thus the ROC will not include z=0. When n1<0
than the sum will be infinite and thus the
 ROC will not include |z|=∞.
 On the other hand, when n2≤0 then the ROC will include z=0, and when n1≥0 the ROC
will include |z|=∞.
 With these constraints, the only signal, then, whose ROC is the entire z-plane is
x[n]=cδ[n].

 If x[n] is a right-sided sequence, then the ROC extends outward from the
outermost pole in X(z).
 A right-sided sequence is a sequence where x[n]=0 for n<n1<∞.

Page | 7
Figure: A right-sided sequence. Figure: The ROC of a right-sided sequence

 If x[n] is a left-sided sequence, then the ROC extends inward from the
innermost pole in X(z).
 A left-sided sequence is a sequence where x[n]=0 for n>n2>−∞.

Figure: A left-sided sequence. Figure: The ROC of a left-sided sequence.

 If x[n] is a two-sided sequence, the ROC will be a ring in the z-plane that is
bounded on the interior and exterior by a pole.
 A two-sided sequence is a sequence with infinite duration in the positive and
negative directions. From the derivation of the above two properties, it follows that
if -r2<|z|<r2 converges, then both the positive-time and negative-time portions
converge and thus X(z) converges as well. Therefore, the ROC of a two-sided sequence
is of the form -r2<|z|<r2.

Figure 6: A two-sided sequence Figure: The ROC of a two-sided sequence.

Page | 8
Summary of ROC:
 For Causal system, ROC is entire Z plane except |Z| = 0 
 For the anti-causal system, ROC is the entire Z plane except |Z| = ∞
 For two-sided sequence ROC is entire Z plane except |Z| = 0 and |Z| = ∞

Example:
A right sided Sequence

Page | 9
ROC is bounded by the pole and is the exterior of a circle.

Example: A left sided Sequence

Page | 10
ROC is bounded by the pole and is the interior of a circle.
Example: Sum of Two Right Sided Sequences

x(n)  ( 12 ) n u (n)  ( 13 ) n u (n)

1
z z 2 z ( z− 12 )
X ( z )= + =
z− 12 z + 31 1 1
( z− 2 )( z + 3 )

Page | 11
ROC is bounded by poles and is the exterior of a circle.
ROC does not include any pole.
Example: A Two Sided Sequence
1 1
x (n)=(− 3 )n u(n )−( 2 ) n u(−n−1 )
1
z z 2 z ( z− 12 )
X ( z )= 1
+ 1 = 1 1
z+ 3 z− 2 ( z + 3 )( z− 2 )

ROC is bounded by poles and is a ring.

ROC does not include any pole.
Example:
Find the z-transform and ROC of the sequence
x(n)= {1,0,3, -1,2}

Page | 12
Solution:
The z-transform of a discrete-time signal x(n) is defined by
∞
X ( z )= ∑ x [ n ] z-n ...(1)
n=0
From (1), we get

X(z)=x(0) + x(1)z-1 + x(2)z-2 + … …(2)

The sequence values are x(0)=1; x(1)=0; x(2)=3; x(3)= -1; x(4)=2

Substituting these values in equation (2) we have

X(z)=1 + 3z-2 - z-3 + 2z-4
The X(z) converges for all values of z except at z=0.
Properties of the z-transform:
Linearity
It states that when two or more individual discrete signals are multiplied by constants, their
respective Z-transforms will also be multiplied by the same constants.
Mathematically,

Proof: We know that,

Page | 13
Time Shifting:
Time shifting property depicts how the change in the time domain in the discrete signal
will affect the Z-domain, which can be written as;

Or,

Proof:

Page | 14
Time Scaling:
Time Scaling property tells us, what will be the Z-domain of the signal when the time is
scaled in its discrete form, which can be written as;

Proof:

Page | 15
Successive Differentiation:
Successive Differentiation property shows that Z-transform will take place when we
differentiate the discrete signal in time domain, with respect to time.
This is shown as below.

Proof:

Page | 16
Convolution:
This depicts the change in Z-domain of the system when a convolution takes place in the
discrete signal form, which can be written as –

Proof:

Page | 17
Multiplication by an Exponential Sequence:
Z [ x(n)]= X ( z), R x- <|z|<R x+
After applying process,
n −1
Z [ a x (n )]= X (a z) z∈|a|⋅R x

Differentiation of X(z)

Page | 18
 Z [ x(n)]= X ( z), z∈ R x
After applying process,
dX ( z )
Z [ nx (n)]=−z z ∈ Rx
dz
Conjugation:
Z [ x(n)]= X ( z), z∈ R x
Applying process,

Z [ x∗( n)]= X∗( z∗) z∈ R x

Reversal:

Z [ x(n)]= X ( z), z∈ R x
Applying process,
−1
Z [ x (−n )]= X ( z ) z∈ 1/ R x

Real and Imaginary Parts:

Z [ x(n)]= X ( z), z∈ R x
Applying process,

Page | 19
Application of z transform:

The field of signal processing is essentially a field of signal analysis in which they are
reduced to their mathematical component and evaluated. One important concept of signal
processing is that of the Z transform method which converts unwieldy sequence into a form
that can be easily dealt with. Z transform is used for much signal processing application.
Here this article gives information about the application of Z transform to know more
details about it.
 Pole-zero description of the discrete-time system
 Analysis of linear discrete signal
 Use to analysis digital filter
 Used to find the frequency response
 Obtain impulse response estimation
 Determine the difference equation
 Analysis of discrete signal
 Calculation of a signal to control system
 Direct computer evolution of frequency response
 Voice transmission
 Enhance the electrical as well as mechanical energy to provide a dynamic nature of the
system
 Geometric evolution of frequency response
 Frequency response estimation via the FFT
 Used to simulate the continuous systems
 It also helps in system design, analysis and also checks the system stability
 For automatic control in telecommunication
 Used in designing digital filters

Advantages of Z transform

Page | 20
The Z transform provides a valuable technique for analysis design of discrete time signals
as well as discrete time LTI systems. This article gives information about the advantages
and disadvantages of Z transform to know more details about it.

Advantages of Z transform:
 Z transform is used for the digital signal
 Both Discrete-time signals and linear time-invariant (LTI) systems can be completely
characterized using Z transform
 The stability of the linear time-invariant (LTI)  system can be determined using the Z
transform
 By calculating Z transform of the given signal, DFT and FT can be determined
 The entire family of digital filters can be obtained from one proto-type design using Z
transform
 The solution of differential equations can be simplified or obtained by using Z
transform theorem
 Mathematical calculations are reduced using the Z transform. For example, consider
the convolution operation is transformed into simple multiplication operation 
Disadvantages of Z transform:
 Z transform cannot apply in the continuous signal

Page | 21
The Inverse Z Transform

• The inverse z transform can be defined as;

where x(n) is the signal in time domain and X(Z) is the signal in frequency domain.

• If we want to represent the above equation in integral format then we can write it as

• Here, the integral is over a closed path C. This path is within the ROC of the x(z) and it
does contain the origin.

Given a Z domain function, there are several ways to perform an inverse Z

Transform:

 Long Division
 Direct Computation
 Partial Fraction Expansion with Table Lookup
 Direct Inversion
 Using Transform Equation

The only two of these that we will regularly use are direct computation and partial fraction
expansion.

Inverse Z Transform by Long Division:

To understand how an inverse Z Transform can be obtained by long division, consider the
function

Page | 22
If we perform long division

we can see that

.
So the sequence f[k] is given by

Upon inspection
 
This technique is laborious to do by hand, but can be reduced to an algorithm that can be
easily solved by computer.

Inverse Z Transform by Direct Computation:

The need for this technique, as well as its implementation, will be made clear when we
consider transfer functions in the Z domain.  We will present this method at that time.

Page | 23
Inverse Z Transform by Partial Fraction Expansion:

This technique uses Partial Fraction Expansion to split up a complicated fraction into
forms that are in the Z Transform table.  If you are unfamiliar with partial fractions, here
is an explanation.
• This technique uses Partial Fraction Expansion to split up a complicated fraction into
forms that are in the Z Transform table as shown. 

As an example consider the function

For reasons that will become obvious soon, we rewrite the fraction before expanding it by
dividing the left side of the equation by "z."

Page | 24
Now we can perform a partial fraction expansion

These fractions are not in our table of Z Transforms.  However if we bring the "z" from
the denominator of the left side of the equation into the numerator of the right side, we get
forms that are in the table of Z Transforms; this is why we performed the first step of
dividing the equation by "z."

So

or

Inverse Z Transform by Direct Inversion:

This method requires the techniques of contour integration over a complex plane.  In
particular

.
The contour, G, must be in the functions region of convergence.  This technique makes
use of Residue Theory and Complex Analysis and is beyond the scope of this document.
Inverse Z-Transform Using Transform Equation:
Find the signal x(n) for which the z-transform is -

Page | 25
Solutions:
We know inverse z-transform equation
1
x(n)=Z−1 [ X ( Z )]= ∫ X (Z )Z n−1 dz
2πj

Page | 26