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

LDPC Encoding and Decoding Techniques

Low Density Parity Check (LDPC) Guide Comprehensive analysis of linear error-correcting block codes, Tanner graphs, and 5G-NR implementations. 📘 Overview 🧮 Encoding 🧩 Decoding 📚 Resources Theory Encoding Tech Tanner Graph 5G Encoding Decoding 'LDPC' is the abbreviation for 'low density parity check'. LDPC code H matrix contains very few amount of 1's and mostly zeroes. LDPC codes are error correcting code. Using LDPC codes, channel capacities that are close to the theoretical Shannon limit can be achieved. Low density parity check (LDPC) codes are linear error-correcting block code suitable for error correction in a large block sizes transmi...

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...

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 Flip-Flops (SR, D, JK)

Design of CMOS Flip-Flops (SR, D, JK) A flip-flop or latch is a circuit with two stable states, used to store state information. It is the basic storage element in sequential logic and a fundamental building block in digital electronics systems, including computers and communication devices. Flip-flops and latches act as data storage elements for states, pulse counting, and synchronization of variably-timed input signals to a reference clock. Flip-flops can be transparent/opaque (latches) or clocked (synchronous, edge-triggered). Latches are level-sensitive, while flip-flops are edge-sensitive. In sequential logic, the output depends on current inputs and previous states. Fig.1 shows a sequential circuit combining a combinational block and a memory element. ...

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 Interactive Rayleigh Fading Simulator Want to see Rayleigh fading in action? Visualize it. Launch Simulator Tool Return to DSP Simulations Main Page →

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...

Q-function in BER vs SNR Calculation (with Simulation)

Q-function in BER vs. SNR Calculation In digital communications and signal processing, the Q-function plays a significant role in predicting system reliability. It allows engineers to quantify the probability that Gaussian noise will exceed a specific threshold, causing a bit error. What is the Q-function? The Q-function is a mathematical function representing the tail probability of the standard normal (Gaussian) distribution. It is the complementary cumulative distribution function (CCDF) of a standard Gaussian distribution. Q(x) = (1 / √(2Ï€)) ∫â‚“∞ e^(-t² / 2) dt The Role of the Q-function in BER vs. SNR The Q-function is the standard tool for calculating BER in systems like BPSK or QPSK over AWGN (Additive White Gaussian Noise) channels. For BPSK: In BPSK, we transmit +√E b (bit 1) and -√E b (bit 0). The decision boundary is set at 0 . If -√E b was sent, an error occurs if noise r > √...