Z-Transform

The Z-transform is the Laplace transform for discrete-time systems. Learn the definition and ROC, common pairs, the delay property z⁻¹, difference equations and transfer functions H(z), poles and zeros in the z-plane, stability (|p| < 1), frequency response on the unit circle, and mapping s to z (bilinear transform).

Digital filters and controllers are difference equations running on processors. The Z-transform turns them into polynomial ratios, revealing stability, frequency response and how to design them from analog prototypes.

An analogy

z⁻¹ is a one-sample memory cell: every z⁻¹ in a formula means 'use the value from one tick ago'.

From difference equations

Replace each delay by z⁻¹ and solve for Y(z)/X(z). The transfer function is a ratio of polynomials — FIR filters have only zeros; IIR filters have poles (feedback).

Stability

A causal system is stable if all poles lie inside the unit circle |z| < 1. Poles near the circle give sharp resonances and slow decay; poles outside grow without bound.

Frequency response

Evaluate H(z) on the unit circle z = e^(jω). Zeros near the circle create notches; poles near it create peaks. ω = π corresponds to f_s/2 (Nyquist).

Design mappings

Bilinear transform maps the entire analog frequency axis onto the unit circle (with pre-warping); impulse invariance matches impulse responses. Fixed-point implementations must manage coefficient quantisation and limit cycles.

Formulas

Worked example: Transfer function

Given: y[n] = 0.9y[n − 1] + 0.1x[n]

Find: H(z), pole, DC gain.

Answer: Stable low-pass with unity DC gain

Worked example: Cut-off frequency

Given: Same filter, f_s = 1 kHz

Find: −3 dB frequency.

Answer: ≈ 16.8 Hz

Common mistakes

Applications

Key takeaways

Going further