Skip to content

Chapter 4: Z-Transform ​

Introduction ​

The Z-transform is the discrete-time counterpart of the Laplace transform, providing a powerful tool for analyzing discrete-time systems.

Definition ​

Definition: Bilateral Z-Transform

The bilateral Z-transform of x[n] is:

X(z)=Z{x[n]}=∑n=−∞+∞x[n]z−n

where z is a complex variable.

Definition: Unilateral Z-Transform

For causal signals:

X(z)=∑n=0+∞x[n]z−n

Region of Convergence (ROC) ​

Definition: ROC

The ROC is the set of values of z for which the Z-transform sum converges. The ROC is always an annular region in the z-plane.

Proposition: ROC Properties

  1. The ROC does not contain any poles
  2. The ROC is a connected annular region
  3. For right-sided sequences: ROC extends outward from the outermost pole
  4. For left-sided sequences: ROC extends inward from the innermost pole
  5. For two-sided sequences: ROC is an annular ring
  6. For causal and stable systems: ROC includes the unit circle |z|=1

Relationship with DTFT ​

Theorem: DTFT as Z-Transform on Unit Circle

If the ROC includes the unit circle, then:

X(ejω)=X(z)|z=ejω

The DTFT is the Z-transform evaluated on the unit circle.

Common Z-Transform Pairs ​

Signal x[n]Z-Transform X(z)ROC
δ[n]1All z
u[n]11−z−1=zz−1|z|>1
anu[n]11−az−1=zz−a|z|>|a|
−anu[−n−1]11−az−1|z|<|a|
nanu[n]az−1(1−az−1)2|z|>|a|
cos⁡(ω0n)u[n]1−z−1cos⁡ω01−2z−1cos⁡ω0+z−2|z|>1
ancos⁡(ω0n)u[n]1−az−1cos⁡ω01−2az−1cos⁡ω0+a2z−2|z|>|a|

Properties ​

Theorem: Z-Transform Properties

Let x[n]↔X(z) with ROC Rx.

Linearity:

ax[n]+by[n]↔aX(z)+bY(z)

Time Shift:

x[n−n0]↔z−n0X(z)

Scaling in z-Domain:

anx[n]↔X(z/a)

with ROC |a|Rx

Time Reversal:

x[−n]↔X(1/z)

with ROC 1/Rx

Differentiation in z-Domain:

nx[n]↔−zdX(z)dz

Convolution:

x[n]∗h[n]↔X(z)H(z)

Initial Value Theorem (causal):

x[0]=limz→∞X(z)

Final Value Theorem: If (z−1)X(z) has poles inside unit circle:

limn→∞x[n]=limz→1(z−1)X(z)

Transfer Function ​

Definition: System Function

The transfer function of a discrete LTI system is the Z-transform of its impulse response:

H(z)=Z{h[n]}=Y(z)X(z)

For a system described by:

∑k=0Naky[n−k]=∑k=0Mbkx[n−k]

The transfer function is:

H(z)=∑k=0Mbkz−k∑k=0Nakz−k

Poles and Zeros ​

Definition: Poles and Zeros

For H(z)=N(z)D(z):

  • Zeros: values of z where H(z)=0
  • Poles: values of z where H(z)=∞

Theorem: Stability Criterion

A causal discrete LTI system is BIBO stable if and only if all poles of H(z) are inside the unit circle:

|pi|<1for all poles pi

Inverse Z-Transform ​

Definition: Partial Fraction Expansion

For a rational X(z):

X(z)=∑iAizz−pi

Then for a causal signal (ROC: |z|>|pi| for all i):

x[n]=∑iAipinu[n]

Example: Second-Order System

Consider:

H(z)=11−1.5z−1+0.5z−2=z2z2−1.5z+0.5

Poles at z=1 and z=0.5. Since there's a pole at z=1 (on the unit circle), the system is marginally stable.