Skip to content
Hub Nexus

No author yetClaim it

Version 1Updated 3 min read

Support

Z Transform Mappings

There are a number of different mappings that can be used to convert a system from the complex Laplace domain into the Z-Domain. None of these mappings are perfect, and every mapping requires a specific starting condition, and focuses on a specific aspect to reproduce faithfully. One such mapping that has already been discussed is the bilinear transform, which, along with prewarping, can faithfully map the various regions in the s-plane into the corresponding regions in the z-plane. We will discuss some other potential mappings in this chapter, and we will discuss the pros and cons of each.

Bilinear Transform

The Bilinear transform converts from the Z-domain to the complex W domain. The W domain is not the same as the Laplace domain, although there are some similarities. Here are some of the similarities between the Laplace domain and the W domain:

  • Stable poles are in the Left-Half Plane
  • Unstable poles are in the right-half plane
  • Marginally stable poles are on the vertical, imaginary axis

With that said, the bilinear transform can be defined as follows:

[Bilinear Transform]

w = \frac{2}{T} \frac{z − 1}{z + 1}

[Inverse Bilinear Transform]

z = \frac{1 + ( T w / 2 )}{1 − ( T w / 2 )}

Graphically, we can show that the bilinear transform operates as follows:

Bilinear Transform Unwarped2

(Image: The original uploader was Whiteknight at English Wikibooks ., CC BY-SA 3.0)

Prewarping

The W domain is not the same as the Laplace domain, but if we employ the process of prewarping before we take the bilinear transform, we can make our results match more closely to the desired Laplace Domain representation.

Using prewarping, we can show the effect of the bilinear transform graphically:

Bilinear Transform Mapping

(Image: The original uploader was Whiteknight at English Wikibooks ., CC BY-SA 3.0)

The shape of the graph before and after prewarping is the same as it is without prewarping. However, the destination domain is the S-domain, not the W-domain.

Matched Z-Transform

If we have a function in the laplace domain that has been decomposed using partial fraction expansion, we generally have an equation in the form:

Y ( s ) = \frac{A}{s + {α}_{1}} + \frac{B}{s + {α}_{2}} + \frac{C}{s + {α}_{3}} + ...

And once we are in this form, we can make a direct conversion between the s and z planes using the following mapping:

[Matched Z Transform]

s + α = 1 − {z}^{− 1} {e}^{− α T}

Pro
A good direct mapping in terms of s and a single coefficient
Con
requires the Laplace-domain function be decomposed using partial fraction expansion.

Simpson's Rule

[Simpson's Rule]

s = \frac{3}{T} \frac{{z}^{2} − 1}{{z}^{2} + 4 {z}^{1} + 1}

CON
Essentially multiplies the order of the transfer function by a factor of 2. This makes things difficult when you are trying to physically implement the system. It has been shown that this transform produces unstable roots (outside of unit unit circle).

(w, v) Transform

Given the following system:

Y ( s ) = G ( s , z , {z}^{α} ) X ( s )

Then:

w = \frac{2}{T} \frac{z − 1}{z + 1}

v ( α ) = 1 − α ( 1 − {z}^{− 1} ) + \frac{α ( α − 1 )}{z} ( 1 − {z}^{− 1} {)}^{2}

And:

[(w, v) Transform]

Y ( z ) = G ( w , z , v ( α ) ) [ X ( z ) − \frac{x ( 0 )}{1 + {z}^{− 1}} ]

Pro
Directly maps a function in terms of z and s, into a function in terms of only z.
Con
Requires a function that is already in terms of s, z and α.

Where this page came from

This page was imported from Wikibooks. From “Control Systems” on Wikibooks, by its contributors, under CC BY-SA 4.0. Changed here: set as a page; navigation and edit links left out; each image under its own licence, credited in its caption.

Nobody has written it yet — it is the source material at a new address, which is why search engines are asked to skip it and why no one earns from it. It is up for grabs: take it on, and it is yours to rewrite and to earn from.

Comments

Spinner Logo

Next in Control Systems

CC BY-SA 4.0
| Time Domain $x ( t ) = {ℒ}^{− 1} \{ X ( s ) \}$ | Laplace Domain $X ( s ) = ℒ \{ x ( t ) \}$ | | --- | --- | --- | | 1 | $\frac{1}{2 π j} {∫}_{σ − j ∞}^{σ + j ∞} X ( s ) {e}^{s t} d s < m a t h > \| < m a t h > {∫}_{− ∞}^{∞} x ( t ) {e}^{− s t} d t$ | | | 2 | $δ ( t ) \$ | ${}1 \$ | | 3 | $δ ( t −
CC BY-SA 4.0
y is the system output, x is the internal system state, and u is the system input. The matrices A, B, C, and D are coefficient matrices. [Analog State Equations] | State-Space Equations | | | --- | --- | | Time-Invariant | ${x}^{′} ( t ) = A x ( t ) + B u ( t )$ $y ( t ) = C x ( t ) + D u ( t )$ | |
CC BY-SA 4.0
For more about this subject, see: **[Linear Algebra]( and **[Engineering Analysis]( ## Laws of Matrix Algebra Matrices must be compatible sizes in order for an operation to be valid: Addition Matrices must have the same dimensions (same number of rows, same number of columns). Matrix addition is com
CC BY-SA 4.0
Control Systems, MATLAB
CC BY-SA 4.0
Throughout this course it is assumed that the source code is typed in the Julia REPL to print the results instantaneously. Otherwise, results can be printed with print() ## Classical Control ### Transfer Function Consider the transfer function $G ( s ) = \frac{s + 2}{3 {s}^{2} + 4 s + 5}$ The transf
CC BY-SA 4.0
**Scilab** is an open source, cross-platform numerical computational package and a high-level, numerically oriented programming language. It is similar in its capabilities to **MATLAB**. Scilab has a good implementation of many of the required control systems functions and has a dynamic model simula