UNIT-I

REVIEW OF DISCRETE SIGNALS AND SYSTEMS

Signal: A Signal is defined as any physical quantity that varies with time, space or any other
independent variables.

Eg: 𝑿𝟏 (t)=2t linear with independent of t.

ECG(Electro Cardiogram) signal can carry information.

A signal can be function of one or more independent variables. If the signal function depends
only one variable, then it is called ”one dimensional Signal”.

AC power supply signal and speed signal are functions of one independent variable namely
time.

If the signal depends on two independent variables, then the signal is known as “Two
dimensional Signal”.

A Picture is a function of two independent variables.

Classification of Signals:

There are three types of signals, namely

1.) Analog Signals

2.) Discrete Signals

3.) Digital Signals

Analog (or) Continuous time signal:

A Signal that varies continuously with time is known as “Continuous time signal”.

Eg: Speed Signal and temperature of room.

Discrete time Signal:

The signal that are defined at discrete instants of time are known as “Discrete time signal”.

Eg: Train traffic signal.

Digital Signal:

Digital signals are signals whose both dependent variable and independent variable are discrete in
nature. Digital signals comprise of pulses occurring at discrete intervals of time.
Eg : Telegraph and Teleprinter signals.

Signal Processing:

Processing: To obtain the signal in the more desirable form.

By changing the basic nature of signal to obtain the desired shaping of the input signal is
called “Signal processing”.

Signal processing is of two types depending on the type of signal to be processed.

1.) Analog signal processing

2.) Digital signal processing

1.) Analog Signal Processing:

In Analog signal processing, Continuous amplitude and Continuous time signals are processed.

Various types of analog signals are processed through low pass filters, high pass filters, band
pass and band reject filters. To obtain the desired shaping of input signal.

System:

A System is defined as a physical device that generates are -----or an output signal for a given
input signal.

Signal Processing Systems:

Signal processing systems are of two types depending upon the type of signal to be processed.

*Continous time system:

Continous time systems are the system for which both input and output are continous time signals.

* Discrete time system:

Discrete time system are the system for which both input and output are discrete time signals.

Representation of discrete time signals:

There are different types of representations for discrete time signals. they are,

1.Graphical representation

2.Functional representation

3. Tabular representation

4. sequence representation
 1. Graphical representation:

Let us consider a signal x(n) with values x(-1)=1,x(0)=2,x(1)=1,x(2)=0.5,x(3)=1.5. The discrete

time signal can be represented graphically as shown ,

2. Functional Representation:

The digital signal can be represented functionally as,

3. Tabular Representation:

The digital signal can be represented in tabular for as shown below,

4. Sequence Representation:

A finite duration sequence with tie origin(n=0) indicated by symbol ↑ can be represented as,

X(n)={1,2,2,0.5,1.5}

Elementary Discrete Time Signals:

1. Unit Step Response:

The unit step response is defined as, u (n) = {1 n≥0
0 n<0

The graphical representation for the unit step response is,

2. Unit Ramp Response:

The unit ramp response is defined as, r (n) = {n n≥0
0 n<0

The graphical response for the unit ramp response is shown below,

3. Unit Impulse Response:

The unit impulse response is defined as, s (n) = {1 n=0
0 n≠0

The graphical response for the unit impulse response is as shown,

4. Exponential sequence:
The exponential signal is the sequence of the form, x (n) =𝒂𝒏 for all n.

The below figure shows different types of discrete time exponential signals.

When the value is 0<a<1, the sequence decays exponentially and for a<-1 and -1<a<0
the discrete time exponential signals as shown below.
Operation on Signals:

The basic set of operations depends on,

 Shifting
 Time reversal
 Time scaling
 Scalar multiplication
 Signal multiplier
 Signal addition
1. Shifting:
The shifting operation takes the input sequence and shifts the value by an integer
increment of independent variable.
Mathematically this can be represented as,
Y (n) = x (n-k).
Where x (n) is input and y (n) is the output. If k is +ve the shifting delays the sequence
and if k is –ve the shifting advances the sequences.
A signal x (n) is shown in below fig, the signal x (n-3) is obtained by shifting
x (n) right by 3 units of time. The result is as shown in fig (a). On the other hand, the
signal x(n+2) is obtain by shifting x(n) left by 2 units of time. The result is as shown in
below fig.
2. Time reversal:
Let us consider x (n) is an input sequence. The output sequence y (n) for time reversal
is, y (n) = x (n-1).
For the signal x (n), is shown in fig (2), the signal x (+n) is given in fig 2 (a).
3. Time scaling:
This is accomplished by replacing ‘n’ by ‘xn’ in sequence x (n). Let x (n) is a sequence as
shown in fig 3. If λ=2 we get a new sequence y (n) = x (2n).
We can plot the sequence y (n) by substituting different values for “n”.

Y (n) = x (2n).
n=0, y (0) = x (0) =3
n=1, y (1) = x (2) =3
n=2, y (2) = x (4) =1
n=-1, y (-1) = x (-2) =3
n=-2, y (-2) = x (-4) =1.
The o/p sequence, y (n) = x (2n) is as shown in fig 3a.
Skip the odd numbers in the o/p sequence compared to i/p sequence.
4. Scalar multiplication:
A scalar multiplication is shown in fig 4. Hence the signal x (n) multiplied by a scale
factor “a”.
Eg: if x (n)={1,2,3,4} and a=3 then the signal y (n) = a X(n) = 3 X(n) ={3,6,9,12}.
 5. Signal multiplier:
Fig 5 illustrates the multiplication of two signals to form another sequence.
Eg: if x1(n)={1,2,3,4}, x2(n)={1,-1,1,-1} then the signal y(n) = x1(n)*x2(n) = {1,-2,3,-4}.
6. Signal addition:
Two signals can be added by using an adder as shown in fig 6.
Eg: if x1(n) = {1,2,3,4} , x2(n)= {1,-1,1,-1} then the signal y(n) = x1(n) + x2(n) = {2,1,4,3}.

Classification of Discrete Time Systems:

According to properties and characteristics , the discrete time systems can be

classified into 6 systems.

 Static and dynamic systems

 Casual and non-casual systems
 Linear and non-linear systems
 Time varient and invarient systems
 FIR and IIR systems
 Stable and unstable systems

Casual and non casual system:

A system is said to be casual if the o/p of the system at any time ‘n’ depends only at present and past
inputs but doesn’t depends on future inputs. These can be represented mathematically as, y(n) = {
x(n1), x(n-1),x(n-2),--------}

If the o/p of the system depends on the future i/p the system is said to be “non casual
systems”.

Eg: y (n) = x (n) + x (n-1) casual system

Y (n) = x (2n)non casual system.

Pb. Determine if the system described by the following equations are casual/non casual

1.Y (n) = x (n) + 1/x (n-1)

𝟏
Sol: Given y (n) =x (n) + 𝒙(𝒏−𝟏)

𝟏
Let n=0, y (0)= x(0)+ 𝒙(−𝟏)

𝟏
n=1, y (1)= x(1)+ 𝒙(𝟎)

𝟏
n=2 , y(-1)= x(-1)+ 𝒙(−𝟐)
for different values of ‘n’ the o/p system only depends on present and past input systems, then the
given system is “casual system”.

2.Y(n) = x(𝒏𝟐 )

Sol: Given y(n) = x(𝒏𝟐 )

Let n=0, y(0) = 0

n=1, y(1) = x(1)
n=2, y(2) = x(4)
n=-1, y(-1) = x(1)
n=-2, y(-2) = x(4)

for different values of ‘n’ the output of n only depends on future inputs. So it is non casual system.

Linear and Non-Linear Systems:

If the System satisfies the superposition principle , then the system is called Linear
system .

A System is linear if and only if T[a1x1(n)]+T[a2X2(n)]=T[a1X1(n)+a2X2(n)]

Where a1 and a2 are arbitrary constants

A System doesn’t satisfy the superposition principle is called “non-linear system”.

1.determine if the system described by following i/p –o/p equations is linear or non-linear,
𝟏
y(n) = x(n)+𝒙(𝒏−𝟏)

Let 𝒙𝟏 (𝒏) 𝒂𝒏𝒅 𝒙𝟐(n) are two input sequences then,

𝟏
𝒚𝟏 (n) = 𝒙𝟏 (𝒏) + 𝒙 (𝒏−𝟏)
①
𝟏
𝟏
𝒚𝟐 (n) = 𝒙𝟐 (𝒏) + 𝒙𝟐 (𝒏−𝟏)
②
𝒂𝟏
𝑻[𝒚𝟏 (n)] =𝒂𝟏 𝒚𝟏 (𝒏) = 𝒂𝟏 𝒙𝟏 (𝒏) + 𝒙 (𝒏−𝟏)
③
𝟏
𝒂𝟐
𝑻[𝒚𝟐 (n)] =𝒂𝟐 𝒚𝟐 (𝒏) = 𝒂𝟐 𝒙𝟐 (𝒏) + 𝒙𝟐 (𝒏−𝟏)
④

𝑻[𝒚𝟑 (n)] = T [𝒂𝟏 𝒙𝟏 (𝒏) + 𝒂𝟐 𝒙𝟐 (𝒏)]

𝟏
= 𝒂𝟏 𝒙𝟏 (𝒏) + 𝒂𝟐 𝒙𝟐 (𝒏) + 𝒂 ⑤
𝟏 𝒙𝟏 (𝒏−𝟏)+ 𝒂𝟐 𝒙𝟐 (𝒏−𝟏)

𝒂𝟏 𝒂𝟐
③+④ => 𝒂𝟏 𝒙𝟏 (𝒏) + + 𝒙 + 𝒂𝟐 𝒙𝟐 (𝒏) + 𝒙 ⑥
𝟏 (𝒏−𝟏) 𝟐 (𝒏−𝟏)

Eq ⑤ and ⑥are not equal then above eqn is not satisfy the super position principle then system is
non linear.
 Time-variant and Time invariant Systems:

A System is said to be time invariant or shift invariant, if the characteristics of the

system doesn’t change with time.

For the time invariant system, if y(n) is the response of the system to the input x(n)
then the response of the system to the input x(n-k) is y(n-k).

Representation of an arbitrary system:

Any arbitrary sequence x(n) can be represented as shown in fiq1. The sample x(0) can
be obtained by multiplying x(0) with unit impulse 𝛅(𝒏) as shown in fiq2

The sample x(1) with δ(n-1) as shown in fiq3

The sample x(2) can be obtained by multiplying x(2) with δ(n-2) as shown in fiq4

The sample x(-1) can be obtained by multiplying x(2-1) with δ(n+1) as shown in fiq5

The sample x(-2) can be obtained by multiplying x(-2) with δ(n+2) as shown in fiq6

The sum of five sequences , we get x(n) as shown in fiq1

Similarly, for getting ‘k’ sequence the value of x(n) is

X(n) = ∑∞
𝒌=−∞ 𝒙(𝒌)𝜹(𝒏 − 𝒌)

Z-Transform:

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

Z[x(n)]=X(Z)=Ʃx(n).𝒁−𝒏 →→①

Where “Z” is a complex variable.

In polar form, the Z can be represented as Z=r.𝒆𝒋𝒘 →②

Where r=radius of the circle

W=angle of the circle

Sub , eq② in eq①, we get

X(Z)=∑∞ −𝒏 −𝒋𝒘𝒏
𝒏=−∞ 𝒙(𝒏). 𝒓 . 𝒆

Region of Convergence (ROC):

The portion of the Z-plane for which the series in equ.1 converges is called “Region of Convergence”.
The ROC depends on the magnitude of Z. The ROC can be a circle , interior of a circle, exterior of a
circle, an annulus and the entire Z-Plane.

Possible configurations of ROC for Z-Transform:

These configurations are

Interior of Circle

Exterior of Circle

Annulus of Circle

Entire Z-plane

Z-Transform and ROC of Finite duration Sequence:

Right hand sequence:

A signal that has finite duration on right hand sides is known as right hand sequence.
For such type of sequence, the ROC is entire Z-plane except Z=0.

1. Find Z-transform and Roc of casual sequence x(n) = {1,0,3,-1,2}

Given, x(n) = {1,0,3,-1,2}
x(Z)= ∑∞𝒏=𝟎 𝒙(𝒏). 𝒁
−𝒏

= 𝒙(𝟎). 𝒁−𝒏 + 𝒙(𝟏). 𝒁−𝟏 + 𝒙(𝟐). 𝒁−𝟐 + 𝒙(𝟑). 𝒁−𝟑 + 𝒙(𝟒). 𝒁−𝟒
= 1 + 0 +𝟑𝒁−𝟐 − 𝒁−𝟑 + 𝟐𝒁−𝟒
= 1 + 𝟑𝒁−𝟐 − 𝒁−𝟑 + 𝟐𝒁−𝟒
The x(Z) converges for all values of Z except at Z=0.

Left hand sequence:

A signal that has finite duration on left hand sides is known as right hand sequence.
For such type of sequence, the ROC is entire Z-plane except Z=∞.

1. Find the Z-transform and ROC of the anti-casual sequence x(n)= {-3,-2,-1,0,1}
Given x(n)= {-3,-2-1,0,1}

X(Z)= ∑∞
𝒏=−∞ 𝒙(𝒏). 𝒁
−𝒏

= 𝒙(−𝟒). 𝒁𝟒 + 𝒙(−𝟑). 𝒁𝟑 + 𝒙(−𝟐). 𝒁𝟐 + 𝒙(−𝟏). 𝒁𝟏 + 𝒙(𝟎). 𝒁𝟎

=−𝟑𝒁𝟒 − 𝟐𝒁𝟑 − 𝒁𝟐 + 𝟏
The X(Z) converges for all values of Z except at Z=∞.

Two sided sequence:

A signal that has finite duration on both left and right hand sides is known as “Two
sided sequence”. For such type of sequence, the ROC is entire Z-plane except Z=0 and Z=∞.
 1. Find the Z-transform and ROC of sequence x(n)= {2,-1,3,2,1,0,2,3,-1}

Given x(n) = {2,-1,3,2,1,0,2,3,-1}

x(Z)= ∑∞
𝒏=−∞ 𝒙(𝒏). 𝒁
−𝒏

= 𝒙(−𝟒). 𝒁𝟒 + 𝒙(−𝟑). 𝒁𝟑 + 𝒙(−𝟐). 𝒁𝟐 + 𝒙(−𝟏). 𝒁𝟏 + 𝒙(𝟎). 𝒁𝟎 + 𝒙(𝟏). 𝒁−𝟏 +

𝒙(𝟐). 𝒁−𝟐 + 𝒙(𝟑). 𝒁−𝟑 + 𝒙(𝟒). 𝒁−𝟒

= 𝟐𝒁𝟒 − 𝒁𝟑 + 𝟑𝒁𝟐 + 𝟐𝒁𝟏 + 𝟏 + 𝟏 + 𝟐𝒁−𝟐 + 𝟑𝒁−𝟑 − 𝒁𝟒

The ROC of above sequence is entire Z-plane except Z=0 and ∞.

Z-Transform and ROC of Infinite Duration Sequence:

1. Determine the Z-transform and ROC of the signal x(n)=𝒂𝒏 U(n)

The given signal is casual and infinite duration signal.
The Z-transform of x(n) is given by,
X(Z) = ∑∞ 𝒏=−∞ 𝒙(𝒏). 𝒁
−𝒏

= ∑∞ 𝒏
𝒏=−∞ 𝒂 𝑼(𝒏). 𝒁
−𝒏

= ∑𝟎𝒏=−∞ 𝒂𝒏 . 𝟎. 𝒁−𝒏 + ∑∞ 𝒏
𝒏=𝟎 𝒂 . 𝟏. 𝒁
−𝒏

= ∑∞ 𝒏 −𝒏
𝒏=𝟎 𝒂 . 𝒁
X(Z) = ∑∞ −𝟏 𝒏
𝒏=𝟎(𝒂. 𝒁 )
This is a geometric series for infinite no. of points
∞
𝟏
∑ 𝒙𝒏 = 𝟏 + 𝒙 + 𝒙𝟐 + ⋯ … . . =
𝟏−𝒙
𝒏=𝟎
𝟏 𝒁
𝑿(𝒁) = =
𝟏−(𝒂𝒁−𝟏 ) 𝒁−𝒂
𝑿(𝒁) Converges for |a𝒁−𝟏 |<1
|𝒁|>a
𝒕𝒉𝒆 𝑹𝒐𝒄 of sequence x(n)is the exterior of the circle having radius ‘a’ as shown in fig.

Two Sided Sequence:

From the above equation we can find that the ROC of a casual signal is exterior of a circle of radius ‘a’
and ROC of anti casual signal is interior of circle of radius ‘b’.

Now let us consider a two sided sequence is,

X(n)= 𝒂𝒏 𝑼(𝒏) − 𝒃𝒏 U(-n-1)

The Z-transform of x(n) is,

X(Z) = ∑∞
𝒏=−∞ 𝒙(𝒏). 𝒁
−𝒏

= X(Z) = ∑∞ 𝒏 𝒏
𝒏=−∞[𝒂 𝑼(𝒏) − 𝒃 𝐔(−𝐧 − 𝟏)]. 𝒁
−𝒏
 = ∑∞ 𝒏
𝒏=−∞ 𝒂 𝑼(𝒏). 𝒁
−𝒏
− ∑∞ 𝒏
𝒏=−∞ 𝒃 𝐔(−𝐧 − 𝟏). 𝒁
−𝒏

𝒁 𝒁
=𝒁−𝒂 − 𝒃−𝒁

1. The first power series converges is |a𝒁−𝟏 |<1

|Z|>a

2. The second power series converges is |𝒃−𝟏 Z|<1

|Z|<b

If b is <a then |b|<|a| the two ROC’s don’t overlap as shown in fig1. x(Z) doesn’t exist
. if |b|>|a| the two ROC’s don’t overlap as shown in fig2. x(Z) exist . so ROC of X(Z) is |a|<|Z|<|b|
i.e., for an infinite duration two sided signal the ROC is a ring in Z-plane.
𝒁 𝒁
X(Z) = 𝒁−𝒂 − 𝒃−𝒁

ROC is |a|<|Z|<|b|.

Properties of Z-Transform:

1.Linearity Property:

If X1(Z)=Z[x1(n)] and X2(Z)=Z[x2(n)] then Z[ax1(n)+bx2(n)]=aX1(Z)+bX2(Z).

Proof: Z[a𝒙𝟏 (𝒏) + 𝒃𝒙𝟐 (n)] = ∑∞

𝒏=−∞[𝐚𝒙𝟏 (𝒏) + 𝒃𝒙𝟐 (𝐧)] 𝐙
−𝐧

= ∑∞
𝒏=−∞ 𝐚𝒙𝟏 (𝒏). 𝐙
−𝐧
+ ∑∞
𝒏=−∞ 𝒃𝒙𝟐 (𝐧). 𝐙
−𝐧

𝒂. ∑∞
𝒏=−∞ 𝒙𝟏 (𝒏). 𝐙
−𝐧
+ 𝒃. ∑∞
𝒏=−∞ 𝒙𝟐 (𝐧). 𝐙
−𝐧

: Z[a𝒙𝟏 (𝒏) + 𝒃𝒙𝟐 (n)] = aX1(Z)+bX2(Z).

2.Time shifting property:

If X(Z)=Z[x(n)] then Z[x(n-m)]=Z-mX(Z).

Proof: Z[x(n)] = ∑∞
𝒏=−∞ 𝒙(𝒏). 𝒁
−𝒏

Z[x(n-m)] = ∑∞
𝒏=−∞ 𝒙(𝒏 − 𝒎). 𝒁
−𝒏

= 𝒁−𝒎 ∑∞
𝒏=−∞ 𝒙(𝒏 − 𝒎). 𝒁
−𝒏
. 𝒁𝒎

= 𝒁−𝒎 ∑∞
𝒏−𝒎=−∞ 𝒙(𝒏 − 𝒎). 𝒁
−(𝒏−𝒎)

Let 𝒏 − 𝒎 = 𝒍

= 𝒁−𝒎 ∑∞
𝒍=−∞ 𝒙(𝒍). 𝒁
−(𝒍)
 = 𝒁−𝒎 . 𝑿(𝒁)

3.Multiplication Property:

If X(Z)=Z[x(n)] then Z[anx(n)]=X(a-1Z).

Proof: Z[x(n)] = ∑∞
𝒏=−∞ 𝒙(𝒏). 𝒁
−𝒏

Z[𝒂𝒏 .x(n)] = ∑∞ 𝒏
𝒏=−∞ 𝒂 . 𝒙(𝒏). 𝒁
−𝒏

=∑∞ −𝟏 −𝒏
𝒏=−∞ 𝒙(𝒏). (𝒂 𝒁)

= X((𝒂−𝟏 𝒁)

Z[𝒂𝒏 .x(n)] = X((𝒂−𝟏 𝒁)

4.Time reversal property:

If X(Z)=Z[x(n)] then Z[x(-n)]=X(Z-1).

Proof: Z[x(n)] = ∑∞
𝒏=−∞ 𝒙(𝒏). 𝒁
−𝒏

Z[x(-n)] = ∑∞
𝒏=−∞ 𝒙(−𝒏). 𝒁
−𝒏

Let –n=l

Z[x(-l)] = ∑∞
𝒏=−∞ 𝒙(𝒍). 𝒁
𝒍

= ∑∞ −𝟏 𝒍
𝒍=−∞ 𝒙(𝒍). (𝒁 )

Z[x(-n)] = x(𝒁−𝟏 )

5.Differentiation property:

If X(Z)=Z[x(n)] then Z[n.x(n)]=-Z 𝒅𝒛𝒅𝑿(𝒛).

Proof: Z[x(n)] = ∑∞
𝒏=−∞ 𝒙(𝒏). 𝒁
−𝒏

Taking differentiation on b.s., w.r.t Z,

𝒅
𝒅𝒁
X(Z) = ∑∞
𝒏=−∞ 𝒙(𝒏) − 𝒏𝒁
−𝒏−𝟏

= -∑∞ −𝒏 −𝟏
𝒏=−∞ 𝒏. 𝒁 . 𝒁 . 𝒙(𝒏)

Multiplying ‘-Z’ on b.s, we get

𝒅
-Z 𝒅𝒁 X(Z) = ∑∞
𝒏=−∞[𝒏. 𝒙(𝒏)]. 𝒁
−𝒏

𝒅
-Z 𝒅𝒁 X(Z) = Z[nX(n)]
Properties of ROC:

*the ROC cannot contain any poles.

* If x(n) is a casual sequence then the ROC is the entire Z-plane except at Z=0.

* if x(n) is non-casual sequence then the ROC is the entire Z-plane except at Z=∞.

* if x(n) is finite duration, two sided sequence the ROC is entire Z-plane except at Z=0 and Z=∞

* if x(n) is an finite duration, two sided sequence the ROC will consists of a ring in the Z-plane,
bounded on the interior and exterior by a pole.

* the ROC of a linear time invariant stable system contains the unit circle.

* the ROC must be connected region.

System Function:

In general the system is, described by a linear constant coefficient differential

equation of the form,

Y(n)=-∑𝑵 𝑴
𝒌=𝟏 𝒂𝒌 y(n-1) + ∑𝒌=𝟎 𝒃𝒌 x(n-1) →①

Taking Z-transform on B.S and applying time shifting property, we obtain

Y(Z)=- ∑𝑵
𝒌=𝟏 𝒂𝒌 y(Z).𝒁
−𝟏 ∑𝑴
+ 𝒌=𝟎 𝒃𝒌 x(Z).𝒁−𝟏

Y(Z)+ ∑𝑵
𝒌=𝟏 𝒂𝒌 y(Z).𝒁
−𝟏
= ∑𝑴
𝒌=𝟎 𝒃𝒌 x(Z).𝒁
−𝟏

Y(Z) [1+∑𝑵
𝒌=𝟏 𝒂𝒌 𝒁
−𝟏
= ∑𝑴
𝒌=𝟎 𝒃𝒌 x(Z).𝒁
−𝟏

𝒚(𝒁) ∑𝑴
𝒌=𝟎 𝒃𝒌 .𝒁
−𝟏
H(Z) = = 𝑵
∑𝒌=𝟏 𝒂𝒌 𝒁 −𝟏 →②
𝒙(𝒁)

1. Find the system function and impulse response of the system described by the differential
𝟏
equation y(n )= 𝟓 y(n-1) + x(n)

𝟏
Sol: given y(n )= 𝟓 y(n-1) + x(n).

Taking Z-transform and apply time shifting property

𝟏
Y(Z)= 𝟓 y(Z) .𝒁−𝟏 + x(Z)

𝟏
Y(Z) - 𝟓
y(Z) .𝒁−𝟏 = x(Z)

𝟏
Y(Z)[1 - 𝟓 .𝒁−𝟏 ] =x(Z)
 𝒚(𝒁) 𝟏
H(Z) = 𝒙(𝒁) = 𝟏
𝟏− .𝒁−𝟏
𝟓

Applying inverse Z-transforms,

𝒁
h(Z)= 𝟏
𝒁−
𝟓

𝟏
h(n)=(𝟓)𝒏 u(n)

2. y(n)= x(n) + 2x(n-1) – 4x(n-2) + x(n-3)

Given y(n)= x(n) + 2x(n-1) – 4x(n-2) + x(n-3)

Taking Z-transform and apply time shifting property

y(Z)= x(Z) + 2x(Z) . 𝒁−𝟏 – 4x(Z). 𝒁−𝟐 + x(Z). 𝒁−𝟑

= X(Z) [1+2 𝒁−𝟏 -4 𝒁−𝟐 +𝒁−𝟑 ]

𝒚(𝒁)
H(Z)= = 1+2 𝒁−𝟏 -4 𝒁−𝟐 +𝒁−𝟑 ==== {1,2,-4,1}
𝒙(𝒁)

=h(0) + h(1) . 𝒁−𝟏 + h(2). 𝒁−𝟐 + h(3). 𝒁−𝟑

Where h(0)=1, h(1)=2, h(2)=-4, h(3)=1

3. y(n)= y(n-1) +2y(n-2) + x(n)

Given, y(n)= y(n-1) +2y(n-2) + x(n)

Taking Z-transform and apply time shifting property

y(Z)= y(Z). 𝒁−𝟏 +2y(Z). 𝒁−𝟐 + x(Z)

y(Z) [1- 𝒁−𝟏-2 𝒁−𝟏 ] = x(Z)

𝟏
h(Z) = 𝟏− 𝒁−𝟏−𝟐 𝒁−𝟏

Applying Z-inverse transform,

𝒁𝟐
=𝒁𝟐−𝒁−𝟐

𝒁𝟐
=(𝒁+𝟏)(𝒁−𝟐)

𝒁 𝒁
=(𝒁+𝟏) .(𝒁−𝟐)

4. Y(n)= 2x(n-1) +1/2 x(n-2) + x(n-3) + 1/3 x (n-4)

 Given, Y(n)= 2x(n-1) +1/2 x(n-2) + x(n-3) + 1/3 x (n-4)

Taking Z-transform and apply time shifting property

Y(Z)= 2x(Z). 𝒁−𝟏 +1/2 x(Z) . 𝒁−𝟐 + x(Z) . 𝒁−𝟑 + 1/3 x (Z). 𝒁−𝟒

H(Z)= 2 𝒁−𝟏 + 1/2 𝒁−𝟐 + 𝒁−𝟑 + 1/3 𝒁−𝟒

Convolution Property:

If X(Z)= Z[x(n)] and H(Z)= Z[h(n)] then Z[x(n).h(n)]=X(Z).H(Z)

Where x(n).h(n) denotes the linear convolution of sequences.

Proof:

y(n)= ∑∞
𝒌=−∞ 𝒙(𝒌). 𝒉(𝒏 − 𝒌)

Apply Z-transform from above equation, we get

∞
Z[y(Z)] = ∑∞
𝒏=−∞ ∑𝒌=−∞ 𝒙(𝒌). 𝒉(𝒏 − 𝒌) 𝒁
−𝒏

=∑∞
𝒌=−∞ 𝒙(𝒌). 𝒁
−𝒌 ∑∞
𝒏=−∞ 𝒉(𝒏 − 𝒌). 𝒁
−(𝒏−𝒌)

Let n-k=l

=∑∞
𝒌=−∞ 𝒙(𝒌). 𝒁
−𝒌 ∑∞
𝒏=−∞ 𝒉(𝒍). 𝒁
−(𝒍)

=x(Z).H(Z)

Initial Value Theorem:

If x+(Z)= Z[x(n)] then X(0)= 𝐥𝐢𝐦 𝒙 + (𝒁)

𝒁→∞

Proof:

Z[x(n)] = ∑∞
𝒏=𝟎 𝒙(𝒏). 𝒁
−𝒏

X+(Z)= ∑∞
𝒏=𝟎 𝒙(𝒏). 𝒁
−𝒏

As Z→∞ all the terms vanished except x(0) which proves the theorem

Apply limits on B.S, then

𝐥𝐢𝐦 𝒙 + (𝒁) = 𝐥𝐢𝐦 ∑∞

𝒏=∞ 𝒙(𝒏). 𝒁
−𝒏
𝒁→∞ 𝒁→∞

𝐥𝐢𝐦 𝒙 + (𝒁) = 𝐥𝐢𝐦 [ 𝒙(𝟎). 𝒁−𝟏 + 𝒙(𝟏). 𝒁−𝟐 − − − − + 𝒙(∞) . 𝒁−∞

𝒁→∞ 𝒁→∞
 = 𝐥𝐢𝐦 [𝒙(𝟎) + 𝒙(𝟏). 𝒁−𝟏 + 𝒙(𝟐). 𝒁−𝟐 − − − − + 𝒙(∞) . 𝒁−∞
𝒁→∞

=x(0)

X(0)= 𝐥𝐢𝐦 𝒙 + (𝒁)

𝒁→∞

Final Value Theorem:

If 𝒙 + (𝒁) =Z[x(n)], where the ROC for x(Z) includes, then x(∞)= 𝐥𝐢𝐦 (𝒁 + 𝟏)𝒙 + (𝒁).
𝒁→∞

Proof:

Z[x(n+1)]-Z[x(n)] = ∑∞
𝒏=𝟎[𝒙(𝒏 + 𝟏) − 𝒙(𝒁)]. 𝒁
−𝒏

Z x+(Z)-Zx(0)-x+(Z) = ∑∞
𝒏=𝟎[𝒙(𝒏 + 𝟏) − 𝒙(𝒁)]. 𝒁
−𝒏

(Z-1) x+(Z)-Zx(0) = ∑∞
𝒏=𝟎[𝒙(𝒏 + 𝟏) − 𝒙(𝒁)]. 𝒁
−𝒏

𝐥𝐢𝐦 (𝐙 − 𝟏) 𝐱 + (𝐙) − 𝐙𝐱(𝟎) = ∑∞

𝒏=𝟎[𝒙(𝒏 + 𝟏) − 𝒙(𝒁)]. 𝒁
−𝒏
𝒏→∞

(Z-1) x+(Z)-Zx(0) = x(1)-x(0)+x(2)-x(1)+x(3)-x(2)+.......+x(∞+1)-x(∞)

(Z-1) x+(Z)-Zx(0) = -x(0)+x(∞)

Let Z→1, we get

𝐥𝐢𝐦[ (𝐙 − 𝟏) 𝐱 + (𝐙) − 𝐙𝐱(𝟎)] = -x(0)+x(∞)

𝒁→𝟏

𝐥𝐢𝐦(𝒁 − 𝟏) 𝒙 + (𝒁) − 𝒙(𝟎) = x(0)+x(∞)

𝒁→𝟏

X(∞)= 𝐥𝐢𝐦(𝒁 − 𝟏)𝒙 + (𝒁)

𝒁→𝟏

Problems:

1.Find Z-transform of a signal x(n) = [3(𝟑)𝒏 -4(𝟐)𝒏 ]u(n)

Given x(n) = [3(𝟑)𝒏 -4(𝟐)𝒏 ]u(n)

Z[x(n)] = ∑∞
𝒏=−∞ 𝒙(𝒏). 𝒁
−𝒏

Z [3(𝟑)𝒏 -4(𝟐)𝒏 ]u(n) = ∑∞ 𝒏 𝒏

𝒏=−∞[𝟑(𝟑) − 𝟒(𝟐) ]𝐮(𝐧). 𝒁
−𝒏

= ∑∞ 𝒏 𝒏
𝒏=−∞[𝟑(𝟑) − 𝟒(𝟐) ]. 𝒁
−𝒏

=3.∑∞ 𝒏 −𝒏
𝒏=𝟎 𝟑 𝒁 -4∑∞ 𝒏 −𝒏
𝒏=𝟎 𝟐 𝒁

𝒏 𝒏
=3.∑∞
𝒏=𝟎 𝟑𝒁
−𝟏
-4∑∞
𝒏=𝟎 𝟐𝒁
−𝟏
 𝟏 𝟏
=3[𝟏−𝟑𝒁−𝟏]-4[𝟏−𝟐𝒁−𝟏]

𝟑𝒁 𝟒𝒁
= −
𝒁−𝟑 𝒁−𝟐

2. Find the Z-transform of the signal x(n)=𝐜𝐨𝐬 𝒏𝜽 u(n)

Given x(n)=𝐜𝐨𝐬 𝒏𝜽 u(n)

Z[(n)] = x(Z) = ∑∞
𝒏=−∞ 𝐱(𝐧).𝒁
−𝒏

Z[𝐜𝐨𝐬 𝒏𝜽 u(n)] = ∑∞
𝒏=−∞ 𝐜𝐨𝐬 𝒏𝜽 𝐮(𝐧).𝒁
−𝒏

=∑∞
𝒏=−∞ [𝐜𝐨𝐬 𝒏𝜽 ].𝒁
−𝒏

𝒆𝒋𝒏𝜽 +𝒆−𝒋𝒏𝜽
=∑∞
𝒏=𝟎[ 𝟐
] . 𝒁−𝒏

=1/2 [∑∞
𝒏=𝟎 𝒆
𝒋𝒏𝜽
. 𝒁−𝒏 + ∑∞
𝒏=𝟎 𝒆
−𝒋𝒏𝜽
. 𝒁−𝒏 ]

=1/2 [∑∞ 𝒋𝜽 −𝟏 𝒏 ∞
𝒏=𝟎(𝒆 𝒁 ) + ∑𝒏=𝟎(𝒆
−𝒋𝜽 −𝟏 𝒏
𝒁 ) ]
𝟏 𝟏
=1/2 [𝟏−𝒆𝒋𝜽 𝒁−𝟏 + 𝟏−𝒆−𝒋𝜽 𝒁−𝟏]

𝒁 𝒁
=1/2[ + ]
𝒁−𝒆𝒋𝜽 𝒁−𝒆−𝒋𝜽

𝟏 𝟏−𝒁−𝟏 𝐜𝐨𝐬 𝜽
∑∞ 𝒏
𝒏=𝟎 𝒂 = = 𝟏−𝟐𝒁−𝟏 𝐜𝐨𝐬 𝜽 +𝒁−𝟐
𝟏−𝒂

𝐬𝐢𝐧(𝒏+𝟏)𝒘
3. find Z-transform of the signal x(n) = 𝒓𝒏 . 𝐬𝐢𝐧 𝒘
u(n)

𝐬𝐢𝐧(𝒏+𝟏)𝒘
Given x(n) = 𝒓𝒏 . 𝐬𝐢𝐧 𝒘
u(n); 0<|𝒓|<1

X(Z) = Z[x(n)] = ∑∞
𝒏=−∞ 𝒓(𝒏). 𝒁
−𝒏

𝐬𝐢𝐧(𝒏+𝟏)𝒘
=∑∞ 𝒏
𝒏=−∞[𝒓 . 𝐬𝐢𝐧 𝒘
𝐮(𝐧)]𝒁−𝒏

𝐬𝐢𝐧(𝒏+𝟏)𝒘
=∑∞ 𝒏
𝒏=𝟎[𝒓 . ]𝒁−𝒏
𝐬𝐢𝐧 𝒘

𝟏 𝒆𝒋(𝒏+𝟏)𝒘 −𝒆−𝒋(𝒏+𝟏)𝒘
= 𝐬𝐢𝐧 𝒘 [∑∞
𝒏=𝟎 𝟐𝒋
] (𝒓𝒁−𝟏 )𝒏

𝟏
= 𝟐𝒋 𝐬𝐢𝐧 𝒘 [∑∞
𝒏=𝟎 𝒆
𝒋(𝒏+𝟏)𝒘
(𝒓𝒁−𝟏 )𝒏 - ∑∞
𝒏=𝟎 𝒆
−𝒋(𝒏+𝟏)𝒘
(𝒓𝒁−𝟏 )𝒏]

𝟏
= 𝟐𝒋 𝐬𝐢𝐧 𝒘 [∑∞
𝒏=𝟎 𝒆 . 𝒆 (𝒓𝒁−𝟏 )𝒏 - ∑∞
𝒋𝒏𝒘 𝒋𝒘
𝒏=𝟎 𝒆 −
𝒋𝒏𝒘 −𝒋𝒘
. 𝒆 (𝒓𝒁−𝟏 )𝒏]

𝟏
= 𝟐𝒋 𝐬𝐢𝐧 𝒘 [∑∞
𝒏=𝟎( 𝒓𝒁
−𝟏 𝒋𝒘 𝒏 𝒋𝒘 ∑∞
𝒆 ) .𝒆 - 𝒏=𝟎( 𝒓𝒁−𝟏 𝒆−𝒋𝒘 )𝒏.𝒆−𝒋𝒘]
 𝟏 𝟏 𝟏
= 𝟐𝒋 𝐬𝐢𝐧 𝒘 [𝟏−(𝒓.𝒆𝒋𝒘 𝒁−𝟏).𝒆𝒋𝒘 - 𝟏−(𝒓.𝒆−𝒋𝒘 𝒁−𝟏).𝒆−𝒋𝒘]

𝟏 𝒁.𝒆𝒋𝒘 𝒁.𝒆−𝒋𝒘
= 𝟐𝒋 𝐬𝐢𝐧 𝒘 [𝒁−𝒓.𝒆𝒋𝒘 - 𝒁−𝒓.𝒆−𝒋𝒘]

𝟏 𝟐𝒋 𝐬𝐢𝐧 𝒘
= 𝟐𝒋 𝐬𝐢𝐧 𝒘[𝟏−𝒓 𝒁−𝟏[𝒆𝒋𝒘 +𝒆−𝒋𝒘 ]+𝒓𝟐.𝒁−𝟐]

𝟏 𝟐𝒋 𝐬𝐢𝐧 𝒘
=𝟐𝒋 𝐬𝐢𝐧 𝒘 [𝟏−𝒓𝒁−𝟏𝟐 𝐜𝐨𝐬 𝒘𝟐+𝒓𝟐𝒁−𝟐]

𝟏
X(Z) =
𝟏−𝒓𝒁−𝟏 𝟐 𝐜𝐨𝐬 𝒘𝟐+𝒓𝟐 𝒁−𝟐

𝟏
4. x(n) = (𝟑)𝒏−𝟏 u(n-1)

𝟏
Given x(n) = ( )𝒏−𝟏 u(n)
𝟑

X(Z) = ∑∞
𝒏=−∞ 𝒙(𝒏). 𝒁
−𝒏

𝟏
=∑∞ 𝒏 −𝒏
𝒏=𝟎(𝟑) 𝒁

𝟏
= ∑∞ −𝟏 𝒏
𝒏=𝟎( 𝟑 . 𝒁 )

𝟏
= 𝟏
𝟏− .𝒁−𝟏
𝟑

𝟏 𝒁
Z[(𝟑)𝒏 u(n-1)] = 𝒁−𝟏 . 𝟏
𝒁−
𝟑

𝟏
= 𝟏
𝒁−
𝟑

5. x(n) = 𝒓𝒏 𝐜𝐨𝐬 𝒏𝜽 U(n)

𝟏−𝒁−𝟏 𝐜𝐨𝐬 𝜽
Z [𝐜𝐨𝐬 𝒏𝜽 U(n)] = 𝟏−𝟐𝒁−𝟏 𝐜𝐨𝐬 𝜽+𝒁−𝟐

By using multiplication of exp.sequence property, then

𝟏−(𝒓−𝟏 𝒁)−𝟏 𝐜𝐨𝐬 𝜽

Z [𝒓𝒏 𝐜𝐨𝐬 𝒏𝜽 U(n)] = 𝟏−𝟐(𝒓−𝟏𝒁)−𝟏 𝐜𝐨𝐬 𝜽+(𝒓−𝟏𝒁)−𝟐

𝟏−𝒓𝒁−𝟏 𝐜𝐨𝐬 𝜽
= 𝟏−𝟐𝒓𝒁−𝟏 𝐜𝐨𝐬 𝜽+𝒓𝟐𝒁−𝟐

6. x(n) = n.𝒂𝒏 U(n)

Z [𝒂𝒏 U(n)] = ∑∞ 𝒏 −𝒏
𝒏=𝟎 𝒂 . 𝒁

𝟏
=∑∞ −𝟏 𝒏
𝒏=𝟎(𝒂𝒁 ) = 𝟏−𝒂𝒁−𝟏
 𝒁
= 𝒁−𝒂

By using differentiation property,

𝒅
Z[n.x(n)] = -Z.𝒅𝒁 x(Z)

𝒅 𝟏
Z[n.𝒂𝒏 U(n)] = -Z.𝒅𝒁 [𝟏−𝒂𝒁−𝟏 ]

𝟏
= -Z-(𝟏−𝒂𝒁−𝟏)𝟐 a𝒁−𝟏

𝒁.𝒂𝒁−𝟐 𝒂𝒁−𝟏
= (𝟏−𝒂𝒁−𝟏)𝟐 => (𝟏−𝒂𝒁−𝟏)𝟐

Z-Transforms and ROC [Problems]:-

(a).Find the Z-transform of the following discrete time signals and find ROC for each.
−𝟏 𝟏
(A) X(n)= ( 𝟓 )𝒏U(n)+5(𝟐)−𝒏U(-n-1)
−𝟏 𝟏
Z[x(n)] = ∑∞ 𝒏 −𝒏
𝒏=−∞[( 𝟓 ) 𝐔(𝐧) + 𝟓(𝟐) 𝐔(−𝐧 − 𝟏)]
−𝟏 𝟏
=∑∞ 𝒏 −𝒏 ∑−𝟏
𝒏=𝟎( 𝟓 ) . 𝒁 + 𝒏=−∞ 𝟓(𝟐)−𝒏 . 𝒁−𝒏
−𝟏 −𝟏 𝒏
=∑∞
𝒏=𝟎( 𝒁 ) + 5∑∞ −𝟏 𝒏
𝒏=𝟏(𝟐𝒁 )
𝟓
𝟏 𝟐𝒁−𝟏
= −𝟏 −𝟏 +5( )
𝟏−( 𝒁 ) 𝟏−𝟐𝒁−𝟏
𝟓

𝟓𝒁 𝟏𝟎
= 𝟓𝒁+𝟏 + 𝒁−𝟐

𝟏
ROC :: |𝟓 𝒁−𝟏 |<1 and |2𝒁−𝟏 |<1

𝟏
|Z|> 𝟓 and |Z|< 2

𝟏
𝟓
<|Z|<2

𝟏 𝟏
(b). x(n) = 𝟐 𝜹(𝒏) + 𝜹(𝒏 − 𝟏) − 𝟑 𝜹(𝒏 − 𝟐)

𝟏 𝟏
Z[x(n)] = 𝟐 + 𝒁−𝟏 -𝟑 𝒁−𝟐

The ROC for above sequence x(n) is entire Z-plane except at Z=0.

(c). x(n) = U(n-2)

𝒁
Z[U(n)] = 𝒁−𝟏

𝒁
Z[U(n-2)]= 𝒁−𝟐 . 𝒁−𝟏
 𝒁−𝟏
= 𝒁−𝟏

𝟏
=
𝒁𝟐 −𝒁

ROC of the above sequence is |Z|>1

𝟏
(d). x(n) = (n+0.5)(𝟑)𝒏 U(n)

𝟏
Z[(n)] = ∑∞ 𝒏
𝒏=−∞[(𝐧 + 𝟎. 𝟓)(𝟑) 𝐔(𝐧)]𝒁
−𝒏

𝟏 𝒏 𝟏 𝒏
=∑∞
𝒏=−∞ 𝒏 (𝟑) 𝑼(𝒏)𝒁
−𝒏 ∑∞
+ 𝒏=−∞ 𝟎. 𝟓 (𝟑) 𝑼(𝒏)𝒁−𝒏

𝟏
= 𝟏
𝟏− 𝒁−𝟏
𝟑

𝟑𝒁
=
𝟑𝒁−𝟏

By using differentiation property,

𝟏 𝒅 𝟏
∑∞ 𝒏
𝒏=𝟎 𝒏(𝟑) U(n) = -Z 𝒅𝒁 ( 𝟏 )
𝟏− 𝒁−𝟏
𝟑

−𝟏 𝟏
=-Z. 𝟏 * 𝒁−𝟐
𝟏−( 𝒁−𝟏 )𝟐 𝟑
𝟑

𝟏 −𝟏
.𝒁
𝟑
= 𝟏. −𝟏 𝟐
(𝟏− .𝒁 )
𝟑

𝟏 𝒏 𝟏
=∑∞
𝒏=−∞ 𝟎. 𝟓 (𝟑) 𝑼(𝒏)𝒁
−𝒏
= 0.5 𝟏
𝟏− 𝒁−𝟏
𝟑

𝟏 −𝟏
𝒁 𝟏
𝟑
= 𝟏 +0.5. 𝟏
(𝟏− 𝒁−𝟏 )𝟐 𝟏− 𝒁−𝟏
𝟑 𝟑

𝟏 𝟏
| 𝒁−𝟏 | < 1 and |Z|>
𝟑 𝟑

(e).X(n) = 𝐬𝐢𝐧 𝒘𝒏 U(n)

Z[x(n)] = ∑∞
𝒏=−∞[𝐬𝐢𝐧 𝒘𝒏 𝑼(𝒏)]𝒛
−𝒏

𝒆𝒋𝒘𝒏 −𝒆−𝒋𝒘𝒏 −𝒏
=∑∞
𝒏=𝟎[ 𝟐𝒋
]𝒁

𝟏
= 𝟐𝒋 [∑∞
𝒏=𝟎 𝒆 . 𝒁 -∑∞
𝒋𝒘𝒏 −𝒏
𝒏=𝟎 𝒆
−𝒋𝒘𝒏 −𝒏
.𝒁 ]

𝟏 𝟏 𝟏
= 𝟐𝒋 [𝟏−𝒆𝒋𝒘.𝒁−𝟏 − 𝟏−𝒆−𝒋𝒘 .𝒁−𝟏
]
 𝟏 𝒁 𝒁
= 𝟐𝒋 [𝒁−𝒆𝒋𝒘 − 𝒁−𝒆−𝒋𝒘 .
]

𝟏 𝒁𝟐 −𝒁𝒆−𝒋𝒘 −𝒁𝟐 +𝒁𝒆𝒋𝒘

= 𝟐𝒋 [𝒁𝟐−𝟐𝒆−𝒋𝒘 −𝒁𝒆𝒋𝒘 +𝒆𝒋𝒘.𝒆−𝒋𝒘 ]

𝟏 𝒁−𝟏 𝟐𝒋 𝐬𝐢𝐧 𝒋𝒘 𝒁−𝟏 𝐬𝐢𝐧 𝒘

[ 𝟐
𝟐𝒋 𝒁 −𝟐𝒁 𝐜𝐨𝐬 𝒋𝒘+𝟏
] = [𝟏−𝟐𝒁−𝟏 𝐜𝐨𝐬 𝒘+𝒁−𝟏
]

The ROC is 𝒆𝒋𝒘 >1 and 𝒆−𝒋𝒘<1

(f). x(n) = 𝒏𝟐 𝒂𝒏 𝑼(𝒏)

Z[𝒂𝒏 U(n)] = ∑∞ 𝒏 −𝒏
𝒏=𝟎 𝒂 𝒁

=∑∞ −𝟏 𝒏
𝒏=𝟎(𝒂𝒁 )

𝟏 𝒁
X(z)=𝟏−𝒂𝒁−𝟏 => 𝒁−𝒂

𝒅 𝟏
=[n.𝒂𝒏 𝑼(𝒏)] = -Z [ ]
𝒅𝒁 𝟏−𝒂𝒁−𝟏

−𝟏
=-Z 𝟏−𝒂𝒁−𝟏 .a.𝒁−𝟐

𝒁.𝒂.𝒁−𝟐
= 𝟏−𝒂𝒁−𝟏

𝒂𝒁−𝟏
=𝟏−𝒂𝒁−𝟏

𝒅
Z[𝒏𝟐 𝒂𝒏𝑼(𝒏)] = -Z x(Z)
𝒅𝒁

𝒅 𝒂𝒁−𝟏
= -Z
𝒅𝒁 𝟏−𝒂𝒁−𝟏

Inverse Z-Transform:

There are four methods that are used for the evaluation of inverse Z-transform.

1. Long division method

2. Partial fraction method
3. Residue method
4. Convolution method

1.Long division method:-

For a rational Z-transform, a power series expansion can be obtained by long division method. For this
method we have a Z-transform x(z) with its corresponding ROC.

Now, we can expand x(z) into a power series of the form,

X(Z)= ∑∞
𝒏=𝟎 𝑪𝒏 𝒁
−𝒏

Which converges the given ROC

Inverse Z-transform of X(Z) is given by

X(n)= ∑∞
𝒏=𝟎 𝑪𝒏 𝒁
−𝒏
=𝑪𝒏

𝒁+𝟎.𝟐
1.Find the Inverse Z-transform of X(Z)=
(𝒁+𝟎.𝟓)(𝒁−𝟏)
; IZI>1 by using long division method ?

Sol:

𝒁+𝟎.𝟐
Given X(Z)=
(𝒁+𝟎.𝟓)(𝒁−𝟏)
; IZI>1

From the ROC, we get that x(n) is casual sequence

𝒁−𝟏 + 𝟎. 𝟕𝒁−𝟐 + 𝟎. 𝟖𝟓𝒁−𝟑 + 𝟎. 𝟕𝟕𝟓𝒁−𝟒

𝒁𝟐 − 𝟎. 𝟓𝒁 − 𝟎. 𝟓 Z+0.2

Z-0.5-0.5𝒁−𝟏

0.7+0.5𝒁−𝟏

0.7-0.35𝒁−𝟏 -𝒁−𝟐

0.85𝒁−𝟏 +0.35𝒁−𝟐

0.85𝒁−𝟏 − 𝟎. 𝟒𝟐𝟓𝒁−𝟐 − 𝟎. 𝟒𝟐𝟓𝒁−𝟑

0.775𝒁−𝟐 + 𝟎. 𝟒𝟐𝟓𝒁−𝟑

0.775𝒁−𝟐 − 𝟎. 𝟑𝟖𝟕𝒁−𝟑 − 𝟎. 𝟑𝟖𝟕𝒁−𝟒

0.812𝒁−𝟑 + 𝟎. 𝟑𝟖𝟕𝒁−𝟒

X(z)= 𝒁−𝟏 + 𝟎. 𝟕𝒁−𝟐 + 𝟎. 𝟖𝟓𝒁−𝟑 + 𝟎. 𝟕𝟕𝟓𝒁−𝟒 +……………………….

Apply inverse Z-transform , then

x(n)={x(0),x(1),x(2),x(3),…………………………..}

x(n)={ 0 , 1 , 0.7 , 0.85 , 0.775 ,……………..…..}

𝒁
2.Find the inverse Z-transform 0f X(Z)= ; IZI<3 by using long division method ?
(𝒁−𝟑)(𝒁−𝟒)

Sol:

𝒁
Given X(Z)= ; IZI<3
(𝒁−𝟑)(𝒁−𝟒)

From the ROC, we get that x(n) is anti-casual sequence

𝒁 𝟕 𝒁𝟐 𝟑𝟕 𝒁𝟑
+ +
𝟏𝟐 𝟏𝟒𝟒 𝟏𝟕𝟐𝟖

12-7Z+𝒁𝟐 Z

𝟕𝒁𝟐 𝒁𝟑
Z- +
𝟏𝟐 𝟏𝟐

𝟕𝒁𝟐 𝒁𝟑
+
𝟏𝟐 𝟏𝟐

𝟕𝒁𝟐 𝟒𝟗𝒁𝟑 𝟕𝒁𝟐

− +
𝟏𝟐 𝟏𝟒𝟒 𝟏𝟒𝟒

𝟑𝟕𝒁𝟑 𝟕𝒁𝟐
−
𝟏𝟒𝟒 𝟏𝟒𝟒

𝟑𝟕𝒁𝟑 𝟐𝟓𝟗𝒁𝟒 𝟑𝟕𝒁𝟓

− +
𝟏𝟒𝟒 𝟏𝟕𝟐𝟖 𝟏𝟕𝟐𝟖
 𝟏𝟕𝟓𝒁𝟒 𝟑𝟕𝒁𝟓
−
𝟏𝟕𝟐𝟖 𝟏𝟕𝟐𝟖

𝒁 𝟕 𝒁𝟐 𝟑𝟕 𝒁𝟑
X(Z) = + + +…………………………
𝟏𝟐 𝟏𝟒𝟒 𝟏𝟕𝟐𝟖

Apply inverse Z-transform , then

x(n)={…………………………..,x(-2),x(-1),x(0)}
𝟑𝟕 𝟕 𝟏
x(n)={ ……………..….. , 𝟏𝟕𝟐𝟖
, 𝟏𝟒𝟒 , 𝟏𝟐 , 0 }

2.Partial fraction expansion method:

In this method, the function X(Z) is the linear combination of 𝑿𝟏 (𝒁), 𝑿𝟐 (𝒁),……………..

Where 𝑿𝟏 (𝒁), 𝑿 𝟐 (𝒁),………….are additive parts of function X(Z) recovered by partial function it is as
shown in equ.1

X(Z)= 𝑨𝟏 𝑿𝟏 (𝒁), 𝑨𝟐 𝑿𝟐 (𝒁), 𝑨𝟑 𝑿𝟑 (𝒁),……………………………., 𝑨𝒌 𝑿𝒌 (𝒁) ①

Where 𝑿𝟏 (𝒁), 𝑿 𝟐 (𝒁),…………. are the expressions with inverse Z-Transform.

𝒙𝟏 (𝒏), 𝒙𝟐 (𝒏), … … … … … … … . , 𝒙𝒌 (𝒏) then inverse Z-transform of X(Z) will be

x(n)=𝒁−𝟏 [𝑿(𝒁)]

= 𝒁−𝟏 [𝑨𝟏 𝑿𝟏 (𝒁), 𝑨𝟐 𝑿𝟐 (𝒁), 𝑨𝟑 𝑿𝟑 (𝒁),……………………………., 𝑨𝒌 𝑿𝒌 (𝒁)]

=𝒁−𝟏 [𝑨𝟏 𝑿𝟏 (𝒁)]+ 𝒁−𝟏 [𝑨𝟐 𝑿𝟐 (𝒁)]+…………….+ 𝒁−𝟏 [𝑨𝒌 𝑿𝒌 (𝒁)]

x(n)= 𝑨𝟏 𝒙𝟏 (𝒏), 𝑨𝟐 𝒙𝟐 (𝒏), 𝑨𝟑 𝒙𝟑 (𝒏),……………………………., 𝑨𝒌 𝒙𝒌 (𝒏) ②

This method is particularly useful if X(Z) is a rational transfer function given as follows

𝑵(𝒁) 𝑩𝟎 +𝑩𝟏 𝒁−𝟏 + 𝑩𝟐 𝒁−𝟐 +⋯…………+𝑩𝑴 𝒁−𝑴

X(Z)=𝑫(𝒁) = 𝑨𝟎 +𝑨𝟏 𝒁−𝟏 +𝑨𝟐 𝒁−𝟐 +⋯…….+𝑨𝑵 +𝒁−𝑵
③

Here 𝑨𝟎 should be equal to 1 [𝑨𝟎 = 𝟏]

The partial fraction method is applicable only for proper rational transfer function.
A rational transfer function is called Proper if 𝑨𝑵 ≠ 𝟎 and M<N.

1.Determine the inverse –transform by using partial fraction expansion method.Given

𝒁
𝑿(𝒁) = 𝟏 𝟏 ?
(𝒁− )(𝒁− )
𝟐 𝟒

Sol:

𝒁
Given 𝑿(𝒁) = 𝟏 𝟏 ①
(𝒁− )(𝒁− )
𝟐 𝟒

𝒁 𝑨 𝑩
𝟏 𝟏 = 𝟏 + 𝟏
(𝒁− )(𝒁− ) 𝒁− 𝒁−
𝟐 𝟒 𝟐 𝟒

𝟏
If Z = 𝟐 , then A = 2

𝟏
If Z = 𝟒 , then B = -1

𝒁 𝟐 −𝟏
𝟏 𝟏 = 𝟏 + 𝟏
(𝒁− )(𝒁− ) 𝒁− 𝒁−
𝟐 𝟒 𝟐 𝟒

𝟏 𝟏
𝐱(𝐧) = 4 [( )𝐧 − ( )𝐧 ] 𝐮(𝐧 − 𝟏)
𝟐 𝟒

3.Residue Method:

The Z-Transform of a sequence x(n) is given by

X(Z) = ∑∞
𝒏=−∞ 𝒙(𝒏)𝒁
−𝒏
①

Multiplying 𝒁𝑲−𝟏 on both sides and integrating w.r.t Z about a closed contour C in the ROC of X(Z)
then

∞
𝑲−𝟏
∮ 𝑿(𝒁)𝒁 𝒅𝒁 = ∮ ∑ 𝒙(𝒏)𝒁−𝒏 𝒁𝑲−𝟏 𝒅𝒁
𝒏=−∞

= ∮ ∑∞
𝒏=−∞ 𝒙(𝒏)𝒁
−𝒏+𝒌−𝟏
𝒅𝒁

= ∑∞
𝒏=−∞ 𝒙(𝒏) ∮ 𝒁
−𝒏+𝒌−𝟏
𝒅𝒁

By using Cauchy residue theorem,

∮ 𝒁−𝒏+𝒌−𝟏 𝒅𝒁 = 𝟐𝜫𝒋𝜹𝒌𝒏
Where 𝜹𝒌𝒏 = { 𝟏 𝒏=𝒌

= {0 n ≠k

Then ∮ 𝑿(𝒁) 𝒁𝒌−𝟏 𝒅𝒁 = ∑∞

𝒏=−∞ 𝒙(𝒏)𝟐𝜫𝒋𝜹𝒌𝒏

= ∑∞
𝒌=−∞ 𝒙(𝒌)𝟐𝜫𝒋 for n=k
𝟏
𝟐𝜫𝒋
∮ 𝑿(𝒁)𝒁𝒌−𝟏 𝒅𝒁 = 𝒙(𝒌)

The inverse Z-Transform relation is given by

𝟏
x(n) =𝟐𝜫𝒋 ∮ 𝑿(𝒁)𝒁𝒏−𝟏 𝒅𝒁

where C is a circle in Z-plane in ROC of X(Z).

the equ.6 can be evaluated by finding sum of all residues of poles that are inside a circle C .Now, equ.6
can be written as

𝒙(𝒏) = ∑ 𝑹𝒆𝒔𝒊𝒅𝒖𝒆𝒔 𝒐𝒇 𝑿(𝒁)𝒁𝒏−𝟏 𝒊𝒏𝒔𝒊𝒅𝒆 𝒕𝒉𝒆 𝒄𝒊𝒓𝒄𝒍𝒆 𝑪

= ∑𝒊(𝒛 − 𝒛𝒊 )𝑿(𝒁)

X(Z)𝒁−𝟏 has no poles inside the circle C for one of more values of n then x(n) is 0.

𝒁+𝟏
1.Using residue method, find the inverse Z-Transform of 𝑿(𝒁) = (𝒁+𝟎.𝟐)(𝒁−𝟏) ; IZI>1 ?

Sol:
𝒁+𝟏
Given 𝑿(𝒁) = (𝒁+𝟎.𝟐)(𝒁−𝟏)

𝒙(𝒏) = ∑ 𝑹𝒆𝒔𝒊𝒅𝒖𝒆𝒔 𝒐𝒇 𝑿(𝒁)𝒁𝒏−𝟏 𝒊𝒏𝒔𝒊𝒅𝒆 𝒕𝒉𝒆 𝒄𝒊𝒓𝒄𝒍𝒆 𝑪

𝒁+𝟏
𝒙(𝒏) = ∑ 𝑹𝒆𝒔𝒊𝒅𝒖𝒆𝒔 𝒐𝒇 (𝒁+𝟎.𝟐)(𝒁−𝟏)
𝒁𝒏−𝟏 𝒂𝒕 𝒑𝒐𝒍𝒆𝒔 𝒐𝒇 𝒁 = −𝟎. 𝟐, 𝒁 = 𝟏

(𝒁 + 𝟎. 𝟐)(𝒁 + 𝟏) 𝒏−𝟏 (𝒁 − 𝟏)(𝒁 + 𝟏) 𝒏−𝟏

= 𝒁 𝒂𝒕 𝒁 = −𝟎. 𝟐 + 𝒁 𝒂𝒕 𝒁 = 𝟏
(𝒁 + 𝟎. 𝟐)(𝒁 − 𝟏) (𝒁 + 𝟎. 𝟐)(𝒁 − 𝟏)

(𝟎.𝟖)(−𝟎.𝟐)𝒏−𝟏 𝟐.𝟏𝒏−𝟏
= −𝟏.𝟐
+ 𝟐
For IZI >1 then

𝒙(𝒏) = −𝟎. 𝟔𝟔(−𝟎. 𝟐)𝒏−𝟏 𝒖(𝒏 − 𝟏) + 𝟏. 𝟔𝟔(𝟏)𝒏−𝟏 𝒖(𝒏 − 𝟏)

Convolution Method:

In this method the given X(Z) is split into 𝑿𝟏 (𝒁)𝒂𝒏𝒅 𝑿𝟐 (𝒁) such that X(Z)= 𝑿𝟏 (𝒁) ∗ 𝑿𝟐 (𝒁)

Next we find 𝒙𝟏 (𝒏)𝒂𝒏𝒅 𝒙𝟐 (𝒏) by taking inverse Z-transform of 𝑿𝟏 (𝒁)𝒂𝒏𝒅 𝑿(𝒁) respectively.

From convolution theorem property of Z-transform

Z [𝒙𝟏 (𝒏). 𝒙𝟐 (𝒏)] = 𝑿𝟏 (𝒁) ∗ 𝑿𝟐 (𝒁) = X(Z) →

From eq①, we know that convolution of, 𝒙𝟏 (𝒏)𝒂𝒏𝒅 𝒙𝟐 (𝒏)is the inverse Z-transform of X(Z).
𝟏
2.Find the inverse Z-transform of X(Z) = by using convolution theorem
𝟏−𝟑𝒁−𝟏 +𝟐𝒁−𝟐

𝟏
Sol: Given X(Z) = 𝟏−𝟑𝒁−𝟏+𝟐𝒁−𝟐

𝟏
= (𝟏−𝒁−𝟏)(𝟏−𝟐𝒁−𝟐) = 𝑿𝟏 (𝒁). 𝑿𝟐 (𝒁)

𝟏 𝟏
Here, 𝑿𝟏 (𝒁) =(𝟏−𝒁−𝟏) and 𝑿𝟐 (𝒁) =(𝟏−𝟐𝒁−𝟐)

𝒙𝟏 (𝒏) = 𝟏𝒏 𝑼(𝒏) 𝒂𝒏𝒅 𝒙𝟐 (𝒏) = 𝟐𝒏 𝑼(𝒏)

X(n)= 𝒙𝟏 (𝒏) ∗ 𝒙𝟐 (𝒏) =U(n)* 𝟐𝒏 𝑼(𝒏)

= ∑∞
𝒌=−∞ 𝑼(𝑲). 𝟐
𝒏−𝒌
𝑼(𝒏 − 𝒌)

=∑𝒏𝒌=𝟎 𝟐𝒏−𝒌

=𝟐𝒏 . ∑𝒏𝒌=𝟎 𝟐−𝒌

𝟏
𝟏−( )𝒏+𝟏
= 𝟐𝒏 [ 𝟐
𝟏 ]U(n)
𝟏−
𝟐

𝟏 𝟏
( )𝒏 .
𝒏 𝟐 𝟐
= 𝟐 [-2- 𝟏 ]U(n)
𝟐

𝟏𝒏
= 𝟐𝒏 [2- ]U(n)
𝟐

= [𝟐𝒏+𝟏 − 𝟐𝒏 . 𝟐−𝒏]U(n)

= [𝟐𝒏+𝟏 − 𝟏]U(n)