Scribd
Upload
2 views2 pages

Inverse Z-Transforms and Recursion Methods

The document discusses the use of inverse Z-transforms through recursion, emphasizing the practicality of solving difference equations on a computer rather than manually. It provides examples of Z-transform models represented as difference equations and illustrates how to compute future values of the output signal using recursion. The author notes that while tedious, this process can be automated with computer code for efficiency.

Uploaded by

Osman Al-Agha
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views2 pages

Inverse Z-Transforms and Recursion Methods

The document discusses the use of inverse Z-transforms through recursion, emphasizing the practicality of solving difference equations on a computer rather than manually. It provides examples of Z-transform models represented as difference equations and illustrates how to compute future values of the output signal using recursion. The author notes that while tedious, this process can be automated with computer code for efficiency.

Uploaded by

Osman Al-Agha
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

A First Course on Modelling and Control

by John Anthony Rossiter


Inverse Z-transforms by recursion
It is rarely convenient, or indeed useful, to do an explicit inverse Z-
transform using partial fraction expansion and the like. In practice, a Z-
transform model is likely to be represented by a difference equation and
we use an equivalence:

Inverse Z-transform EQUIV Solving the difference equation for different k

The latter is also not a pen and paper exercise in general, except to
understand the principles. However, it is straightforward to automate on A
COMPUTER.

DIFFERENCE EQUATION EQUIVALENT FOR A SIGNAL

Consider the Z-transform of the signal:


2𝑧 −1
𝑌(𝑧) = ( )
1 − 1.2𝑧 −1 + 0.32𝑧 −2
This can be represented as (with 𝛿 an impulse function):

𝑦(𝑘) − 1.2𝑦(𝑘 − 1) + 0.32𝑦(𝑘 − 2) = 2𝛿(𝑘 − 1)


Solve this equation at several different values of k noting that:
{𝛿 (𝑘) = 1, 𝑘 = 0}, {𝛿 (𝑘) = 0, 𝑘 ≠ 0}.

Hence:

𝑦(0) − 1.2𝑦(−1) + 0.32𝑦(−2) = 2𝛿(−1)


𝑦(1) − 1.2𝑦(0) + 0.32𝑦(−1) = 2𝛿(0)
𝑦(2) − 1.2𝑦(1) + 0.32𝑦(0) = 2𝛿(1)
𝑦(3) − 1.2𝑦(2) + 0.32𝑦(1) = 2𝛿(2)
DIFFERENCE EQUATION EQUIVALENT FOR SYSTEM RESPONSE

Consider the Z-transform of system output Y with input U:


2𝑧 −1 − 𝑧 −2
𝑌(𝑧) = ( ) 𝑈(𝑧)
1 − 0.8𝑧 −1 + 0.4𝑧 −2 − 0.1𝑧 −3
This can be represented with the difference equation:
𝑦(𝑘) − 0.8𝑦(𝑘 − 1) + 0.4𝑦(𝑘 − 2) − 0.1𝑦(𝑘 − 3) = 2𝑢(𝑘 − 1) − 𝑢(𝑘 − 2)

Hence, the following recursion can deduce the future values of y(k):

𝑦(0) − 0.8𝑦(−1) + 0.4𝑦(−2) − 0.1𝑦(−3) = 2𝑢(−1) − 𝑢(−2)

𝑦(1) − 0.8𝑦(0) + 0.4𝑦(−1) − 0.1𝑦(−2) = 2𝑢(0) − 𝑢(−1)

𝑦(2) − 0.8𝑦(1) + 0.4𝑦(0) − 0.1𝑦(−1) = 2𝑢(1) − 𝑢(0)

𝑦(3) − 0.8𝑦(2) + 0.4𝑦(1) − 0.1𝑦(0) = 2𝑢(2) − 𝑢(1)

Readers will note that the values of the input signal u(k) are required.

SUMMARY: It is clear that a recursion can be used to iteratively solve for


y(k), assuming the previous values are known. However, this is rather
tedious whereas setting up a loop in computer code to do this is
relatively simple. See example code here.

𝑧 −1
𝑌 (𝑧) = ( ) 𝑈(𝑧); Impulse in u(k) at 4th sample.
1−1.2𝑧 −1 +0.32𝑧 −2

Published with Creative Commons License by J.A. Rossiter, University of Sheffield

You might also like