The Z-transform rewrites a discrete-time sequence such as x[0],x[1],x[2],x[0], x[1], x[2], \dots as a function of a complex variable zz. For a two-sided sequence x[n]x[n], the bilateral Z-transform is

X(z)=n=x[n]znX(z) = \sum_{n=-\infty}^{\infty} x[n] z^{-n}

when that series converges. If the sequence starts at n=0n=0 and is causal, many courses use the unilateral form:

X(z)=n=0x[n]znX(z) = \sum_{n=0}^{\infty} x[n] z^{-n}

In each, x[n]x[n] is the sequence value at index nn, zz is a complex variable, and the symbol z1z^{-1} corresponds to a one-step delay. The key point is not which version looks nicer; it is that you use the one matching the problem setup.

Why The Transform Works The Way It Does

Because a delay by one step corresponds to a factor of z1z^{-1}, operations on sequences become algebra on X(z)X(z). That is the whole reason the Z-transform is useful for linear difference equations, digital filters, and recurrence relations: step-by-step recurrences turn into algebraic expressions that are easier to analyze.

It is the discrete-time analogue of the Laplace transform. Both convert a time-domain problem into a transform-domain problem, but the Z-transform is built for sequences indexed by integers rather than functions of continuous time.

Worked Example: x[n]=anu[n]x[n] = a^n u[n]

Let u[n]u[n] be the unit step, so u[n]=1u[n] = 1 for n0n \ge 0 and u[n]=0u[n] = 0 for n<0n < 0. Then

x[n]=anu[n]x[n] = a^n u[n]

is the right-sided sequence 1,a,a2,a3,1, a, a^2, a^3, \dots. Using the unilateral definition,

X(z)=n=0anzn=n=0(az1)nX(z) = \sum_{n=0}^{\infty} a^n z^{-n} = \sum_{n=0}^{\infty} (a z^{-1})^n

This is a geometric series, summing to

X(z)=11az1=zzaX(z) = \frac{1}{1 - a z^{-1}} = \frac{z}{z-a}

provided

az{1}<1|a z^\{-1\}| < 1

which is equivalent to

z>a|z| > |a|

So the full answer is not just X(z)=zzaX(z) = \frac{z}{z-a}. It is

X(z)=zza,ROC: z>aX(z) = \frac{z}{z-a}, \qquad \text{ROC: } |z| > |a|

That last condition is part of the transform, not a side note.

Try It Yourself

Run the same process for x[n]=(12)nu[n]x[n] = \left(\frac{1}{2}\right)^n u[n]. Write the series, collapse it into a geometric series, and find the ROC. Check your work two ways: the algebraic form should come out as zz12\frac{z}{z - \frac{1}{2}}, and the convergence region should be z>12|z| > \frac{1}{2}. If you only wrote the formula, the answer is incomplete.

Why The Region Of Convergence Matters

The region of convergence, or ROC, is the set of zz values for which the defining series actually converges. Without it, the algebraic expression can be ambiguous: different sequences can produce the same rational expression but with different ROCs. That is why a complete answer reports both the formula and the convergence region. Read every Z-transform result as a pair:

formula in z+where that formula is valid\text{formula in } z \quad + \quad \text{where that formula is valid}

Common Z-Transform Traps

  • Dropping the ROC. Without it you may lose information about whether the sequence is right-sided, left-sided, or two-sided.
  • Switching between unilateral and bilateral definitions without noticing. They match in some standard causal examples but are not interchangeable in every derivation.
  • Treating zz like an ordinary real variable. In general zz is complex, so magnitude and location in the complex plane matter.
  • Memorizing transform pairs too mechanically. A small sign error, a missing shift, or the wrong starting index changes the answer.

A reading checklist that prevents most of these, in order:

  1. What sequence is being transformed?
  2. Is the definition bilateral or unilateral?
  3. What algebraic form do you get for X(z)X(z)?
  4. What is the ROC?

Where The Z-Transform Is Used

You will meet it in discrete-time signal processing, digital control, and linear recurrence problems, any system that evolves one step at a time instead of continuously. It is especially useful for solving a difference equation, describing a digital filter, or connecting a sequence to poles and convergence behavior. Compared with the Laplace transform, both methods attach a convergence condition to the formula rather than treating the formula alone as the full answer.

Frequently Asked Questions

What is the Z-transform used for?
The Z-transform rewrites a discrete-time sequence as a function of a complex variable z, turning shifts and recurrences into algebra. Because a one-step delay corresponds to a factor of z to the negative one, it is especially useful for linear difference equations, digital filters, and recurrence relations.
Why does the region of convergence matter in a Z-transform?
The region of convergence is the set of z values where the defining series actually converges. Different sequences can produce the same rational expression with different regions of convergence, so the formula alone is ambiguous. A complete answer always reports both the expression and where it is valid.
What is the difference between the unilateral and bilateral Z-transform?
The bilateral form sums over all integers and handles two-sided sequences, while the unilateral form starts at n equals zero and suits causal problems. They agree in some standard causal examples, but they are not interchangeable in every derivation, so use the version that matches the problem setup.
How is the Z-transform related to the Laplace transform?
The Z-transform is the discrete-time analogue of the Laplace transform. Both convert a time-domain problem into a transform-domain problem where operations become algebraic, but the Z-transform is built for sequences indexed by integers, while the Laplace transform handles functions of continuous time.
What is the Z-transform of a to the power n times the unit step?
Summing the geometric series gives z divided by the quantity z minus a, valid when the magnitude of z is greater than the magnitude of a. That convergence condition is part of the answer, not a side note, because the same expression with a different region describes a different sequence.

Need help with a problem?

Upload your question and get a verified, step-by-step solution in seconds.

Open GPAI Solver →