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

Hybrid Beamforming | Page 1

Beamforming Techniques Hybrid Beamforming... Page 1 | Page 2 | Hybrid Beamforming: Hybrid beam formation was developed to address some of the limitations of digital pre-coding approaches. Every antenna element is connected to an RF chain in digital pre-coding (beam forming) method. We also know that each RF chain is in charge of providing a separate data stream between the transmitter and the receiver. We know that a larger number of independent data streams leads to higher data rates. It has a spatial multiplexing feature for MIMO. As a result, we may assume that switching from MIMO to massive MIMO will benefit us more in terms of spatial multiplexing in massive MIMO, where each antenna is coupled to a single RF chain. We'll proceed with a definition of hybrid beam forming. Overview of hybrid beam forming with example: Unlike digital beam forming, more than one antenna element is connected to a single RF chain in hybr...

MATLAB Code for 8-PSK, 16-PSK, ...

📘 Overview & Theory 🧮 MATLAB Code for BPSK, QPSK, 8-PSK, 16-PSK, 32-PSK 🧮 Simulator for m-ary PSK 📚 Further Reading   MATLAB Code for BPSK, QPSK, 8-PSK, 16-PSK, 32-PSK clc; clear all; close all; rng(10) M = 8; % M = 2, 4, 8, 16, 32, etc. N_Bits = 2520; Phase = 0; data_info_bit = randi([0,1],N_Bits,1); data_temp = bi2de(reshape(data_info_bit,N_Bits/log2(M),log2(M))); modData = pskmod(data_temp,M,Phase); figure(1); scatterplot(modData); channelAWGN = 15; rxData2 = awgn(modData, channelAWGN); figure(2); scatterplot(rxData2); demodData = pskdemod(rxData2,M,Phase);   for BPSK, Constellation Size, M = 2 for QPSK, M = 4 for 8-PSK, M = 8, and so on    Output Figure: 8-PSK Modulation Figure: 8-PSK Demodulation after adding AWGN Noise Using the above MATLAB code you'll able be to modulate and demodulate 2-PSK, 4-PSK, 8-PSK, 16-PSK, 32-PSK and so on.  16-PSK   Fig: 16-PSK In this above code ' M ' is the number of the conste...

UGC NET Electronic Science Previous Year Question Papers with Solutions

Home / Engineering & Other Exams / UGC NET 2026 PYQ ⬇️ Download Papers and Solutions 📋 Exam Pattern 💡 Preparation Tips ❓ FAQs 📊 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 2025 - Question Paper Download PDF June 2025 - Solved Paper + Explanation ...

How Windowing Affects Your Periodogram

The windowed periodogram is a widely used technique for estimating the Power Spectral Density (PSD) of a signal. It enhances the classical periodogram by mitigating spectral leakage through the application of a windowing function. This technique is essential in signal processing for accurate frequency-domain analysis.   Power Spectral Density (PSD) The PSD characterizes how the power of a signal is distributed across different frequency components. For a discrete-time signal, the PSD is defined as the Fourier Transform of the signal’s autocorrelation function: S x (f) = FT{R x (Ï„)} Here, R x (Ï„)}is the autocorrelation function. FT : Fourier Transform   Classical Periodogram The periodogram is a non-parametric PSD estimation method based on the Discrete Fourier Transform (DFT): P x (f) = \(\frac{1}{N}\) X(f) 2 Here: X(f): DFT of the signal x(n) N: Signal length However, the classical periodogram suffers from spectral leakage due to abrupt truncation of the ...

OFDM Symbols and Subcarriers Explained

This article explains how OFDM (Orthogonal Frequency Division Multiplexing) symbols and subcarriers work. It covers modulation, mapping symbols to subcarriers, subcarrier frequency spacing, IFFT synthesis, cyclic prefix, and transmission. Step 1: Modulation First, modulate the input bitstream. For example, with 16-QAM , each group of 4 bits maps to one QAM symbol. Suppose we generate a sequence of QAM symbols: s0, s1, s2, s3, s4, s5, …, s63 Step 2: Mapping Symbols to Subcarriers Assume N sub = 8 subcarriers. Each OFDM symbol in the frequency domain contains 8 QAM symbols (one per subcarrier): Mapping (example) OFDM symbol 1 → s0, s1, s2, s3, s4, s5, s6, s7 OFDM symbol 2 → s8, s9, s10, s11, s12, s13, s14, s15 … OFDM sym...

Galois Fields: GF(2) and GF(2m) and Primitive Polynomial

Galois Fields: GF(2) and GF(2 m ) 1. What is a Galois Field (GF)? A Galois Field (GF) is a finite set of elements in which the four basic arithmetic operations—addition, subtraction, multiplication, and division (except by zero)— are all well defined and closed. GF(q) ⇒ a field with exactly q elements 2. The Simplest Field: GF(2) GF(2) is the smallest possible finite field and forms the foundation of all digital systems. GF(2) = {0, 1} Addition in GF(2) Addition is performed modulo 2 (XOR operation): + 0 1 0 0 1 1 1 0 Multiplication in GF(2) × 0 1 0 0 0 1 0 1 GF(2) is used in binary logic, XOR operations, and simple error-control codes. 3. Meaning of GF(2 m ) GF(2 m ) is a finite field containing exactly 2 m elements . Each element represents an m-bit symbol . Field Number of Elements GF(2) 2 GF(2²) 4 GF(2³) 8 GF(2⁸) 256 Important: GF(2 m ) is not integer arithmetic modulo 2 m . It is polynomial-based arithmetic. 4....

Pulse Amplitude Modulation and Demodulation

📘 Overview & Theory of Pulse Amplitude Moduation (PAM) 🧮 Pulse Amplitude Demoduation 🧮 MATLAB Code for PAM 📚 Further Reading 📂 Other Topics on Pulse Amplitude Modulation ... 🧮 Simulation results for comparison of PAM, PWM, PPM, DM, and PCM 🧮 Other Pulse Modulation Techniques (e.g., PWM, PPM, DM, and PCM) 🧮 MATLAB Code for Pulse Amplitude Modulation and Demodulation of an Analog Signal (2) 🧮 MATLAB Code for Pulse Amplitude Modulation and Demodulation of Digital data  Pulse Amplitude Modulation (PAM) Sampling allow us to represent real world continuous signal, such as audio or video, in a format suitable for digital processing and storage. This sampled discrete-time signal is inherently digital. A digital signal is a discrete-time signal that is further quantized in amplitude. Pulse Amplitude modulation (PAM) is the modulation technique in which amplitude of carrier pulses is...