Digital Signal Processing/Z Transform

The Z Transform has a strong relationship to the DTFT, and is incredibly useful in transforming, analyzing, and manipulating discrete calculus equations. The Z transform is named such because the letter 'z' (a lower-case Z) is used as the transformation variable.

z Transform Definition

For a given sequence x[n], we can define the z-transform X(z) as such:

$𝒵(x[n])=X(z)=\sum _{n=-\mathrm{\infty }}^{\mathrm{\infty }}x[n]z^{-n}$it is important to note that z is a continuous complex variable defined as such:

$z=Re(z)+jIm(z)$ where $j=\sqrt{-1}$ is the imaginary unit.

There can be several sequences $x[n]$ which will generate the same z-transform $X(z)$ with the different functions being differentiated by the convergence region of $z$ for which the summation in the z-transform will converge. These convergence regions are annuli centered at the orgin. In a given convergence region, only one $x[n]$ will converge to a given $X(z)$.

Example 1

$x[n]=\{\begin{array}{cc}0& n<0\\ a^n& n\ge 0\end{array}$

$X(z)=\sum _{n=-\mathrm{\infty }}^{\mathrm{\infty }}x[n]z^{-n}=\sum _{n=0}^{\mathrm{\infty }}{a}^n{z}^{-n}=\frac{1}{1-a{z}^{-1}}$ for $\left|z\right|>\left|a\right|$

Example 2

$x[n]=\{\begin{array}{cc}-a^n& n<0\\ 0& n\ge 0\end{array}$

$X(z)=\sum _{n=-\mathrm{\infty }}^{\mathrm{\infty }}x[n]z^{-n}=\sum _{n=-\mathrm{\infty }}^{-1}-a^n{z}^{-n}=-\sum _{n=1}^{\mathrm{\infty }}{a}^{-n}{z}^n=-(\frac{1}{1-z{a}^{-1}}-1)=\frac{1}{1-a{z}^{-1}}$ for $\left|z\right|<\left|a\right|$

Note that both examples have the same function $X(z)$ as their z-transforms but with different convergence regions needed for the respective infinite summations in their z-transforms to converge. Many textbooks on z-transforms are only concerned with so-called right-handed functions which is to say functions $x[n]$ for which $x[n]=0$ for all $n$ less than some initial start point $N_i$ ; that is, $x[n]=0$ for all $n<N-i$. So long as the function grows at most exponentially after the start point, the z-transform of these so-called right-handed functions will converge in an open annulus going to infinity, $\left|z\right|>R$ for some positive real $R$.

It is important to note that the z-transform rarely needs to be computed manually, because many common results have already been tabulated extensively in tables, and control system software includes it (MatLab,Octave,SciLab).

The z-transform is actually a special case of the so-called Laurent series, which is a special case of the commonly used Taylor series.

The Inverse Z-Transform

The inverse z-transform can be defined as such:

$x[n]=\frac{1}{2\pi j}{\oint }_{C}X(z)z^{n-1}dz$

Where C is a closed-contour that lies inside the unit circle on the z-plane, and encircles the point z = {0, 0}.

The inverse z-transform is mathematically very complicated, but luckily—like the z-transform itself—the results are extensively tabulated in tables.

Equivalence to DTFT

If we substitute $z=e^{j\omega }$, where $\omega$ is the frequency in radians per second, into the Z-transform, we get

$Z(e^{j\omega })=\sum _{n=-\mathrm{\infty }}^{\mathrm{\infty }}x[n]e^{-j\omega n}$

which is equivalent to the definition of the Discrete-Time Fourier Transform. In other words, to convert from the Z-transform to the DTFT, we need to evaluate the Z-transform around the unit circle.

Properties

Since the z-transform is equivalent to the DTFT, the z-transform has many of the same properties. Specifically, the z-transform has the property of duality, and it also has a version of the convolution theorem (discussed later).

The z-transform is a linear operator.

Convolution Theorem

Since the Z-transform is equivalent to the DTFT, it also has a convolution theorem that is worth stating explicitly:

Template:TextBox Y(s)=X(s).H(s)

Z-Plane

Since the variable z is a continuous, complex variable, we can map the z variable to a complex plane as such:

Transfer Function

Let's say we have a system with an input/output relationship defined as such:

Y(z) = H(z)X(z)

We can define the transfer function of the system as being the term H(z). If we have a basic transfer function, we can break it down into parts:

$H(z)=\frac{N(z)}{D(z)}$

Where H(z) is the transfer function, N(z) is the numerator of H(z) and D(z) is the denominator of H(z). If we set N(z)=0, the solutions to that equation are called the zeros of the transfer function. If we set D(z)=0, the solutions to that equation are called the poles of the transfer function.

The poles of the transfer function amplify the frequency response while the zero's attenuate it. This is important because when you design a filter you can place poles and zero's on the unit circle and quickly evaluate your filters frequency response.

Stability

It can be shown that for any causal system with a transfer function H(z), all the poles of H(z) must lie within the unit-circle on the z-plane for the system to be stable. Zeros of the transfer function may lie inside or outside the circle. See Control Systems/Jurys Test.

Gain

Gain is the factor by which the output magnitude is different from the input magnitude. If the input magnitude is the same as the output magnitude at a given frequency, the filter is said to have "unity gain".

Properties

Here is a listing of the most common properties of the Z transform.

	Time domain	Z-domain	ROC
Notation	$x[n]={𝒵}^{-1}\{X(z)\}$	$X(z)=𝒵\{x[n]\}$	ROC: $r_2<|z|<r_1$
Linearity	$a_1{x}_1[n]+a_2{x}_2[n]$	$a_1{X}_1(z)+a_2{X}_2(z)$	At least the intersection of ROC1 and ROC2
Time shifting	$x[n-k]$	$z^{-k}X(z)$	ROC, except $z=0$ if $k>0$ and $z=\mathrm{\infty }$ if $k<0$
Scaling in the z-domain	$a^{n}x[n]$	$X(a^{-1}z)$	$|a|r_2<|z|<|a|r_1$
Time reversal	$x[-n]$	$X(z^{-1})$	$\frac{1}{r_2}<|z|<\frac{1}{r_1}$
Conjugation	$x^{*}[n]$	$X^{*}(z^{*})$	ROC
Real part	$\mathrm{Re}\{x[n]\}$	$\frac{1}{2}[X(z)+X^{*}(z^{*})]$	ROC
Imaginary part	$\mathrm{Im}\{x[n]\}$	$\frac{1}{2j}[X(z)-X^{*}(z^{*})]$	ROC
Differentiation	$nx[n]$	$-z\frac{\mathrm{d}X(z)}{\mathrm{d}z}$	ROC
Convolution	$x_1[n]*x_2[n]$	$X_1(z)X_2(z)$	At least the intersection of ROC1 and ROC2
Correlation	$r_{x_1,x_2}(l)=x_1[l]*x_2[-l]$	$R_{x_1,x_2}(z)=X_1(z)X_2(z^{-1})$	At least the intersection of ROC of X1(z) and X2($z^{-1}$)
Multiplication	$x_1[n]x_2[n]$	$\frac{1}{j2\pi }{\oint }_C{X}_1(v)X_2(\frac{z}{v})v^{-1}\mathrm{d}v$	At least $r_{1l}{r}_{2l}<|z|<r_{1u}{r}_{2u}$
Parseval's relation	${\sum }^{\mathrm{\infty }}{x}_1[n]x_2^{*}[n]$	$\frac{1}{j2\pi }{\oint }_C{X}_1(v)X_2^{*}(\frac{1}{v^{*}})v^{-1}\mathrm{d}v$

• Initial value theorem

$x[0]=\underset{z\to \mathrm{\infty }}{\lim }X(z)$, If $x[n]$ causal

• Final value theorem

$x[\mathrm{\infty }]=\underset{z\to 1}{\lim }(z-1)X(z)$, Only if poles of $(z-1)X(z)$ are inside unit circle

Further reading

• Digital Signal Processing/Bilinear Transform
• Control Systems/Z-transform