Z-transform and ROC
Definition and Calculation
The Z-transform converts a discrete-time signal into a function of a complex variable , letting you work in the frequency domain instead of the time domain. Think of it as the discrete-time counterpart to the Laplace transform you may have seen for continuous-time systems.
The definition is:
Here, is your discrete-time signal and is a complex variable. You're essentially weighting each sample by and summing them all up. The result, , is a function of that encodes the same information as the original signal but in a form that's much easier to manipulate algebraically.
Region of Convergence (ROC) is the set of values of in the complex plane for which that infinite sum actually converges to a finite value. The ROC matters just as much as the expression for itself, because:
- For a causal system (output depends only on present and past inputs), the ROC is the exterior of a circle centered at the origin: for some radius .
- For an anti-causal system, the ROC is the interior of a circle: .
- A system is stable if and only if the ROC includes the unit circle . This connects directly to whether the system's impulse response is absolutely summable.
The ROC is always bounded by poles of , so identifying the poles is your first step when sketching the ROC.
Inverse Z-transform
The inverse Z-transform recovers the original time-domain signal from . Two common methods:
- Partial fraction expansion — Decompose into a sum of simpler rational terms, each associated with a single pole. Then use known Z-transform pairs to read off the corresponding time-domain sequences.
- Contour integration — Evaluate a complex integral along a closed contour within the ROC. This is more general but usually reserved for cases where partial fractions get messy.
One critical point: the inverse Z-transform is not unique unless you specify the ROC. The same algebraic expression paired with different ROCs will give you different time-domain signals. Always state the ROC alongside .

Properties of Z-transform
Linearity and Time-Shifting
Linearity means the Z-transform respects addition and scalar multiplication. If and , then:
where and are constants. The ROC of the result contains at least the intersection of the two individual ROCs.
Time-shifting is one of the most frequently used properties. If , then:
Delaying a signal by samples just multiplies its Z-transform by . This is exactly why the Z-transform is so useful for solving difference equations: every delay becomes a simple multiplication by .

Scaling and Convolution
Scaling (sometimes called the "z-domain scaling" or "exponential weighting" property): multiplying your signal by an exponential sequence rescales the variable. If , then:
where is a non-zero constant. The ROC scales accordingly: if the original ROC was , the new ROC is .
Convolution is the property that makes the Z-transform so powerful for system analysis. Convolution in the time domain becomes multiplication in the Z-domain:
The ROC of the product contains at least the intersection of the individual ROCs. This property is why you can characterize an entire LTI system by its transfer function : the output Z-transform is simply .
Z-transform Theorems
Initial Value Theorem
The initial value theorem gives you directly from without computing the full inverse transform:
This works provided the limit exists, which is typically the case for causal signals (where the ROC includes ). It's a quick sanity check when you've derived a Z-transform and want to verify the starting value of your sequence.
Final Value Theorem
The final value theorem tells you the steady-state behavior of a signal as :
This holds only if the limit on the left actually exists and all poles of lie strictly inside the unit circle. If those conditions aren't met, the theorem doesn't apply and will give you a wrong answer.
This is particularly useful for finding the steady-state response of a stable system to a step input, since you can skip solving for the entire time-domain response and jump straight to the final value.
Both the initial and final value theorems are shortcuts. They won't give you the full signal, but they let you extract specific values quickly, which is especially handy for checking your work or answering exam questions about system behavior at or .