Why Convergence Matters
In Lesson 4.1 we wrote down the Z-transform definition X(z) = Σ x[n] z−n without asking a critical question: for which values of z does this infinite sum actually converge? The answer is the Region of Convergence (ROC) — the set of complex numbers z for which the sum is finite.
The ROC is not a technicality to be glossed over. Two completely different sequences can share the same algebraic expression for X(z) but differ in their ROC, producing different inverse transforms. The ROC encodes whether a signal is causal, anti-causal, or two-sided, and it determines whether a given H(z) corresponds to a stable system. Understanding the ROC is therefore essential for correctly inverting Z-transforms and for stability analysis.
Because the convergence condition depends only on r = |z|, the ROC always takes the form of an annulus (possibly degenerate): a set of circles centered at the origin. This geometric simplicity makes the ROC easy to draw on the z-plane and gives rise to three archetypal shapes, one for each type of sequence.
Right-Sided Sequences: ROC Outside a Circle
A right-sided sequence is zero for n < N for some finite N (it may start before n = 0 but eventually becomes zero to the left). The most common case is a causal sequence where x[n] = 0 for n < 0.
For such sequences the Z-transform sum is dominated by large-n behavior. The sum converges when z is large enough that the decay in |z−n| outpaces the growth in |x[n]|. Specifically, if x[n] grows no faster than r0n, then X(z) converges for |z| > r0 — the exterior of a circle of radius r0.
Notice that the pole at z = a lies on the boundary of the ROC but is never inside it. This is a universal rule: the ROC never contains poles. Poles are the values of z where X(z) blows up — they mark the edge of where the sum can converge.
Left-Sided Sequences: ROC Inside a Circle
A left-sided sequence is zero for n > N for some finite N. The extreme case is an anti-causal sequence where x[n] = 0 for n > 0. For left-sided sequences the sum is dominated by large-negative-n behavior, and convergence requires z to be small enough — specifically |z| < r0 for some r0.
This side-by-side comparison is the most important illustration of why the ROC matters. Both sequences produce exactly the same rational expression z/(z−a), yet they represent completely different time-domain signals — one causal and decaying (if |a| < 1), the other anti-causal and growing. Without specifying the ROC, the inverse Z-transform is ambiguous.
Two-Sided Sequences: Annular ROC
A two-sided sequence is nonzero for both n > 0 and n < 0. Its Z-transform must converge for both "directions" simultaneously, requiring that |z| be neither too large nor too small. The ROC is an annulus r1 < |z| < r2.
An annular ROC is only possible if the inner radius is strictly less than the outer radius. When we decompose X(z) by partial fractions, each term contributes either an exterior or an interior ROC, and the ROC of the total is the intersection of all individual ROCs. If the intersection is empty, the sequence has no Z-transform.
The Five ROC Rules
Several universal rules govern the ROC regardless of the specific sequence. Mastering them lets you determine the ROC quickly from the pole-zero plot alone.
ROC and System Stability
The connection between the ROC and system stability is one of the deepest results in Z-transform theory. Recall that an LTI system is BIBO stable if and only if its impulse response h[n] is absolutely summable: Σ|h[n]| < ∞. This is precisely the convergence condition for H(z) evaluated on the unit circle.
An LTI system with transfer function H(z) is BIBO stable if and only if the unit circle |z| = 1 is contained in the ROC of H(z).
For a causal system (right-sided h[n]), this means all poles of H(z) must lie strictly inside the unit circle.
Causal + Stable ⟺ All poles inside |z| = 1, ROC includes |z| = 1This result unifies the frequency-domain and time-domain stability conditions. It also explains the geometric picture introduced in Lesson 4.1: the mapping z = esT carries the imaginary axis of the s-plane onto the unit circle of the z-plane, so “left half-plane = inside unit circle” directly corresponds to stable poles in both domains.
A practical consequence: when designing digital filters, we must ensure all poles of H(z) have magnitude less than 1. The ROC framework makes this requirement precise and testable — simply locate the poles on the z-plane and check whether they lie inside the unit circle.
Choosing the Right Inverse
The inverse Z-transform recovers x[n] from X(z) via a contour integral around a closed path inside the ROC. When X(z) is rational, partial-fraction decomposition is the practical method, and the ROC determines which inverse pair to use for each term.
The rule is simple: for a pole at z = a, if the ROC is |z| > |a|, the corresponding time-domain term is causal (anu[n]); if the ROC is |z| < |a|, the term is anti-causal (−anu[−n−1]). Specifying the ROC therefore pins down the unique inverse transform.
- The ROC is the set of z values for which the Z-transform sum converges absolutely; it always forms an annulus centered at the origin.
- The ROC never contains any poles of X(z).
- Right-sided (causal) sequences have ROC = exterior of a circle (|z| > r); left-sided have ROC = interior (|z| < r); two-sided have an annular ROC.
- The same rational expression X(z) can correspond to different sequences depending on which ROC is specified — the ROC is essential for a unique inverse transform.
- A causal LTI system is BIBO stable if and only if all poles lie strictly inside the unit circle (ROC includes the unit circle).
- For partial-fraction inversion: pole with ROC |z| > |a| gives aⁿu[n]; ROC |z| < |a| gives −aⁿu[−n−1].