What is z-transform?
A method that converts a discrete-time signal x[n] into a function of the complex number z, X(z) = Σx[n]z^(−n). A delay of one sample corresponds to multiplying by z⁻¹, so a difference equation can be handled as a ratio of polynomials in z (the transfer function H(z)). Values of z that make the denominator of H(z) zero are called poles and those that make the numerator zero are called zeros; a causal system is stable when all its poles lie inside the unit circle. Evaluating on the unit circle with z = e^(jω) gives the frequency response. It is the discrete-time counterpart of the Laplace transform.
Japanese name: z変換
z-transform appears in 1 practice question across 1 topic, including Digital Signal Processing Basics.
Field: Digital Signal Processing Basics
FAQ
How is the z-transform related to the Fourier transform?
Setting z = e^(jω) (on the unit circle) in the z-transform gives the discrete-time Fourier transform (DTFT). By considering z more broadly, inside and outside the unit circle as well, the z-transform makes it possible to discuss stability and frequency response from the positions of poles and zeros. The DFT of a finite-length signal corresponds to the DTFT evaluated at N equally spaced points on the unit circle.
Why does z⁻¹ mean "a delay of one sample"?
The z-transform of x[n − 1] is Σx[n − 1]z^(−n), and substituting m = n − 1 turns it into z⁻¹Σx[m]z^(−m) = z⁻¹X(z). For this reason a delay element is written "z⁻¹" in block diagrams, and a digital filter is expressed as a combination of multiplications, additions and z⁻¹.