Skip to main content

Z Transform


Fundamentals of Z-Transform

1. What is the Z-Transform?

The Z-transform is a tool in digital signal processing to analyze discrete-time signals in the complex frequency domain. It is the discrete-time equivalent of the Laplace Transform.

Definition:

X(z) = Σ x[n] z^(-n),  n = -∞ to ∞
  • x[n]: discrete-time signal
  • z = re^(jω): complex variable
  • X(z): representation of the signal in z-domain

2. Region of Convergence (ROC)

Not all values of z make the series converge. The set of z values where the series converges is called the Region of Convergence (ROC).

The ROC is crucial for determining the stability and causality of the system.

3. Relationship with Other Transforms

Transform Relation
Z-transform Discrete-time signals, general complex frequency domain
DTFT X(e^(jω)) = X(z) |z=e^(jω)
Laplace Transform Continuous-time analog, s-domain equivalent

Note: The Z-transform is a generalized form of the DTFT, allowing both amplitude and phase analysis.

4. Key Properties of Z-Transform

  • Linearity: a x[n] + b y[n] ↔ a X(z) + b Y(z)
  • Time Shifting: x[n - k] ↔ z^(-k) X(z)
  • Scaling in z-domain: a^n x[n] ↔ X(z / a)
  • Convolution in time: x[n] * h[n] ↔ X(z) H(z)
  • Difference Equation to Transfer Function:
    y[n] + a₁ y[n-1] + ... + a_N y[n-N] = b₀ x[n] + ... + b_M x[n-M]
    Transfer function: H(z) = Y(z) / X(z) = (b₀ + b₁ z⁻¹ + ... + b_M z⁻M) / (1 + a₁ z⁻¹ + ... + a_N z⁻N)

5. Poles and Zeros Connection

Transfer functions are expressed as a ratio of polynomials in z⁻¹:

H(z) = B(z) / A(z)
  • Zeros: roots of B(z) = 0, frequencies suppressed
  • Poles: roots of A(z) = 0, frequencies amplified

Poles and zeros are directly related to filter design and frequency response analysis.

  • Z-transform converts discrete-time signals into the z-domain for analysis.
  • Useful for stability, frequency response, and filter design.
  • Poles and zeros determine resonance and attenuation.
  • Related to DTFT: X(e^(jω)) = X(z) |z=e^(jω)

Z-Transform Analysis of Time Series Models

The z-transform is a mathematical tool that converts a discrete-time signal (like a time series) into a complex frequency-domain representation. It is the discrete-time equivalent of the Laplace transform and is instrumental in analyzing the properties of time series models.

Z-Transform Representation

Using the backshift operator B, where BXt = Xt-1, the ARMA(p,q) model can be written in polynomial form:

(1 - φ1B - ... - φpBp)Xt = c + (1 + θ1B + ... + θqBq)εt

Let Φ(B) and Θ(B) be the polynomials in the backshift operator. Replacing B with z-1 gives the z-transform representation:

Φ(z-1)X(z) = c' + Θ(z-1)E(z)

where X(z) and E(z) are the z-transforms of the time series and the error term, respectively.

Transfer Function

The transfer function, H(z), of an ARMA model describes the relationship between the input (error term) and the output (time series) in the z-domain. It is defined as the ratio of the MA polynomial to the AR polynomial:

H(z) = X(z) / E(z) = Θ(z-1) / Φ(z-1)

  • For a pure AR(p) model, the transfer function is H(z) = 1 / Φ(z-1), which is an all-pole function.
  • For a pure MA(q) model, the transfer function is H(z) = Θ(z-1), which is an all-zero function.
  • An ARMA(p,q) model has a pole-zero transfer function.

Stability and Invertibility Conditions

The stability of an ARMA model is determined by the roots of the autoregressive polynomial, Φ(z). For a model to be stable (and thus stationary), all the roots of Φ(z) must lie outside the unit circle in the z-plane. This is equivalent to the poles of the transfer function H(z) lying inside the unit circle when expressed in terms of z.

The invertibility of an ARMA model is determined by the roots of the moving average polynomial, Θ(z). For the model to be invertible, all the roots of Θ(z) must lie outside the unit circle. Invertibility ensures that the model can be represented as a pure autoregressive process of infinite order.

 The discrete-time (DT) signal, which is a series of real or complex numbers, is transformed into a complex frequency-domain (z-domain or z-plane) representation using the Z-transform in signal processing.


Z Transform of a delta or unit impulse function


Example of Z Transform

For a real world example, when we send a unit impulse signal for testing input we receive multiple impulse responses at receiver due to different multipath. 

Let's assume, data signal x[n] = [2   -5    1    3]
and channel impulse responses h[n] = [-1  4   2]

Now simply multiply the data signal and channel co-efficients learned in elementary school

3  1  -5   2
    2   4  -1
-----------------------
6  14  -9   -17   13    -2

It can be represented as
x[n]*h[n] = 6z^(-5) + 14z^(-4)  - 9z^(-3)  - 17z^(-2)  +  13z^(-1)  -  2z

After computing discrete time z transform it is defined as simple multiplication of X(z) and H(z).


Contact Us

Name

Email *

Message *

Popular Posts

MATLAB Code for Constellation Diagram of QAM configurations such as 4, 8, 16, 32, 64, 128, and 256-QAM

📘 Overview of QAM 🧮 4-QAM MATLAB 🧮 16-QAM MATLAB 🚀 Online Simulator 📂 Other Topics on Constellation Diagrams... ▼ 🧮 MATLAB Code for 4-QAM 🧮 MATLAB Code for 16-QAM 🧮 MATLAB Code for m-ary QAM 🧮 Simulator for m-ary PSK 🧮 Simulator for m-ary QAM 🧮 Overview of Energy per Bit (Eb / N0) 🧮 Simulator for ASK, FSK, and PSK Overview of QAM One of the best-performing modulation techniques is QAM [↗] . Here, we modulate the symbols by varying the carrier signal's amplitude and phase in response to the variation in the message signal (or voltage variation). So, we may say that QAM is a combination of phase and amplitude modulation. Additionally, it performs better than ASK or PSK [↗] . In fact, any constellation for any type of modulatio...

UGC NET Electronic Science Previous Year Question Papers with Solutions

Download Papers and Solutions Exam Pattern Preparation Tips FAQs More Home / Engineering & Other Exams / UGC NET 2026 PYQ 📊 Exam Highlights: Electronic Science (88) Feature Details Junior Research Fellowship (JRF) ₹37,000 + HRA per month Eligibility M.Sc/M.Tech in Electronics (55%) Validity of Certificate JRF (3 Years) | Lectureship (Lifetime) 📥 Download UGC NET Electronics PDFs Complete collection of previous year question papers, answer keys and explanations for Subject Code 88. Start Downloading 📂 View All Question Papers June 2026 - Question Paper Download PDF June 202...

Flat vs Frequency Selective Online Simulator

Flat vs Frequency Selective Online Simulator Channel Type Without Fading Flat Fading Multipaths Nakagami m SNR(dB) Run Simulation Input Signal Signal After Fading Constellation Diagram BER vs SNR Explore Advanced Flat vs Frequency-Selective Fading Simulator Want to see these equations in action? Visualize it. Launch Simulator Tool Flat Fading and Frequency-Selective Fading Effects of Multipath Components and the Nakagami-m Parameter 1. Flat Fading Flat fading occurs when the signal bandwidth is smaller than the channel's coherence bandwidth, meaning that all frequency components of the transmitted signal experience approximately the same fading. It is typically associated with narrowband signals, where the multipath delay spread is small relative to the symbol duration. ...

GMSK BER vs SNR (with Simulation)

  GMSK Performance: Why the BER vs. SNR Curve Matters If you’ve ever wondered why GMSK (Gaussian Minimum Shift Keying) became the backbone of the global GSM revolution, the answer lies in its unique balance of spectral efficiency and power performance. But there is no free lunch in engineering. To get that sleek, narrow spectrum, you have to pay a price in Bit Error Rate (BER) . In this guide, we break down the theoretical BER vs. SNR performance of GMSK, the "magic" of the BT product, and how to optimize your link budget for real-world conditions. What is GMSK and Why Should You Care? GMSK is a derivative of MSK (Minimum Shift Keying) that uses a Gaussian pre-modulation filter. This filter "smooths" the phase transitions, significantly reducing sideband power. The result? A constant envelope signal that allows you to use high-efficiency Class-C amplifiers without distorting the signal. This is the secr...

Orthogonal Time Frequency Space (OTFS) (with MATLAB)

In OTFS (Orthogonal Time Frequency Space) modulation — a scheme designed for high-Doppler and time-varying wireless channels — the terms ISFFT and SFFT are key mathematical transformations used to move between different representation domains. Figure: OTFS block diagram 1. ISFFT — Inverse Symplectic Finite Fourier Transform Purpose: Transforms data symbols from the delay-Doppler domain to the time-frequency domain . \[ X[n, m] = \frac{1}{\sqrt{NM}} \sum_{k=0}^{N-1} \sum_{l=0}^{M-1} x[k, l] \, e^{j2\pi \left( \frac{nk}{N} - \frac{ml}{M} \right)} \] Here, \( N \) is the number of Doppler bins (time slots), and \( M \) is the number of delay bins (subcarriers). The ISFFT maps each data symbol from the delay-Doppler grid (where the channel is sparse and easier to equalize) to the time-frequency grid (where standard multicarrier modulation like OFDM can be applied). 2. SFFT — Symplectic Finite Fourier Transform Purpose: Performs the reverse operation ...

Online Simulator for ASK, FSK, and PSK Signal Generation

Interactive Digital Signal Processing (DSP) Tutorial and Simulator for ASK, FSK, and BPSK modulation techniques. Try our new Digital Signal Processing Simulator!   •   Interactive ASK, FSK, and BPSK tools updated for 2025. Start Now Digital Modulation Visualizer: ASK, FSK, & BPSK Simulator Learn and visualize binary modulation techniques (ASK, FSK, BPSK) in real-time with adjustable carrier and sampling parameters. Perfect for DSP students and engineers. 📡 ASK Simulator 📶 FSK Simulator 🎚️ BPSK Simulator 📚 More Topics ASK Modulator FSK Modulator BPSK Modulator Demodulation More Topics 1. ASK (Ampli...

Design of CMOS XOR/XNOR Gates

Design of CMOS XOR/XNOR Gates The semiconductor industry has experienced rapid integration of multimedia applications into mobile electronics, leading to very high integration density in CMOS VLSI. As operating frequencies increase, power consumption, speed, silicon area, and reliability become critical considerations. The XOR-XNOR circuits are fundamental building blocks in arithmetic circuits (Full Adders, Multipliers), compressors, comparators, parity checkers, code converters, error-detecting/correcting codes, and phase detectors. Their performance directly impacts the complex circuits they are used in. Design goals include full output voltage swing, low power consumption, reduced transistor count, minimal delay, and simultaneous non-skewed outputs. Static Logic (Static CMOS) Stat...