Z-Transform Definition

The Z-transform is the backbone of discrete-time signal processing. It converts difference equations into algebraic equations in the complex z-domain, making analysis of digital filters and systems tractable. For GATE aspirants and engineering students, mastering the Z-transform is essential for tackling digital signal processing, control systems, and filter design problems.

Core Concept Explanation

The Z-transform of a discrete-time sequence x[n] is defined as the power series X(z) = Σ x[n] z⁻ⁿ, where the summation runs from n = -∞ to +∞, and z is a complex variable. This is called the bilateral or two-sided Z-transform. In most engineering applications, sequences are causal (defined for n ≥ 0), giving the unilateral form where summation starts from n = 0.

The variable z can be written in polar form as z = r·e^(jω), where r is the magnitude and ω is the angular frequency. When r = 1, the Z-transform reduces to the Discrete-Time Fourier Transform (DTFT). This geometric connection shows that evaluating X(z) on the unit circle gives frequency-domain information about the signal.

The Region of Convergence (ROC) is the set of all z values for which the summation Σ |x[n] z⁻ⁿ| converges. The ROC is always an annular region centered at the origin in the z-plane, bounded by circles passing through poles of X(z). Without specifying the ROC, a Z-transform expression is incomplete, because different sequences can have the same algebraic form but different ROCs.

Standard Z-transform pairs form the foundation of quick computation. The unit impulse δ[n] transforms to 1 with ROC being all z. The unit step u[n] transforms to z/(z-1) with ROC |z| > 1. The causal exponential a^n u[n] transforms to z/(z-a) with ROC |z| > |a|. These pairs, combined with Z-transform properties, allow computation of almost any practical sequence without resorting to direct summation.

Mathematical Expression

The formal bilateral Z-transform is given by X(z) = Σ x[n] z⁻ⁿ for n from -∞ to +∞. For a causal sequence starting at n = 0, the unilateral form is X(z) = Σ x[n] z⁻ⁿ for n from 0 to ∞. The variable z⁻¹ acts as a unit delay operator in the z-domain, analogous to the role of e^(-sT) in the Laplace transform.

Key properties used in GATE problems include linearity (aX(z) + bY(z) for ax[n] + by[n]), time shifting (z⁻ᵏ X(z) for x[n-k] in the unilateral case), convolution (X(z)·Y(z) for x[n]*y[n]), and differentiation in z-domain (-z dX/dz for n·x[n]). The initial value theorem states x[0] = lim X(z) as z→∞, and the final value theorem gives lim x[n] as n→∞ = lim (z-1)X(z) as z→1, valid only when all poles of (z-1)X(z) lie strictly inside the unit circle.

Practical Understanding

In digital filter design, the Z-transform allows engineers to describe a filter completely by its transfer function H(z) = Y(z)/X(z). The poles and zeros of H(z) plotted on the z-plane reveal stability, frequency selectivity, and phase characteristics at a glance. If all poles lie strictly inside the unit circle |z| = 1, the system is BIBO stable.

Difference equations that describe digital systems are solved algebraically using the Z-transform. The same approach used in continuous time with Laplace transforms applies here, making the Z-transform an indispensable bridge between the mathematical description of a system and its real-world behavior.

Given:
x[n] = (0.5)^n · u[n]
This is a causal right-sided exponential sequence with a = 0.5.

Why this formula applies:
For a causal exponential a^n u[n], the standard pair gives X(z) = z/(z-a), ROC: |z| > |a|.

Formula:
X(z) = Σ x[n] z⁻ⁿ = Σ (0.5)^n z⁻ⁿ  (n = 0 to ∞)
      = Σ (0.5/z)^n = 1 / (1 - 0.5z⁻¹)  for |z| > 0.5

Substitution:
Multiply numerator and denominator by z:
X(z) = z / (z - 0.5)

Calculation:
Pole at z = 0.5, Zero at z = 0.
ROC: |z| > 0.5 (annular region outside a circle of radius 0.5).

Final Answer:
X(z) = z / (z - 0.5),  ROC: |z| > 0.5
The pole lies inside the unit circle, so the DTFT also exists.

Exam Tip: In GATE, if you are given X(z) without an ROC and asked to find x[n], the answer is ambiguous. Always check whether the sequence is causal, anti-causal, or two-sided — this determines which ROC applies and which inverse Z-transform to use.

Quick Revision

• Z-transform: X(z) = Σ x[n] z⁻ⁿ; bilateral sum from -∞ to +∞.
• ROC is mandatory to uniquely define the inverse Z-transform.
• Standard pair: a^n u[n] ↔ z/(z-a), ROC |z| > |a|.
• Unit circle |z| = 1 in the ROC implies DTFT exists.
• z⁻¹ operator represents a unit delay in discrete-time systems.
• Convolution in time domain = multiplication of Z-transforms.
• Trap: Do not apply final value theorem if poles of (z-1)X(z) are on or outside the unit circle.