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

RMS Delay Spread, Excess Delay Spread and Multi-path ...(with MATLAB + Simulator)

📘 Overview of Delay Spread and Multi-path 🧮 Excess Delay spread 🧮 Power delay Profile 🧮 RMS Delay Spread 📚 Further Reading 📂 Other Topics on RMS Delay Spread, Excess Delay ... 🧮 Multipath Components or MPCs 🧮 Online Simulator for Calculating RMS Delay Spread 🧮 Why is there significant multipath in the case of very high frequencies? 🧮 Why RMS Delay Spread is essential for wireless communication? 🧮 Why the Power Delay Profile is essential? 🧮 MATLAB Codes for Calculating Different Types of delay Spreads Delay Spread, Excess Delay Spread, and Multipath (MPCs) The fundamental distinction between wireless and wired connections is that in wireless connections signal reaches at receiver thru multipath signal propagation rather than directed transmission like co-axial cable. Wireless Communication has no set communication path between the transmitter and the receiver. The line...

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 More Topics 1. ASK (Amplitude Shift Keying) Simulat...

Amplitude Shift Keying (ASK) Modulation & Demodulation (with Simulation)

Amplitude Shift Keying (ASK): Signal Analysis and Characterization Theoretical Overview: Amplitude Shift Keying (ASK) represents a primary digital modulation technique wherein information is encoded through discrete variations in the carrier signal's instantaneous amplitude. In a Binary ASK (BASK) framework, the modulation process maps binary data onto two distinct amplitude levels. Specifically, the binary '1' (mark) is conveyed by a sinusoidal carrier with amplitude A c and frequency f c over a bit interval T b , while the binary '0' (space) is represented by a null signal state. This particular signaling method is widely recognized as On-Off Keying (OOK) . It is technically realized by gating a carrier oscillator with a unipolar baseband sequence, effectively performing a product modulation that shifts the baseband spectrum to the carrier frequency. ASK Transmitter Architecture: ...

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

Frequency Shift Keying (FSK) Modulation & Demodulation (with Simulation)

Frequency Shift Keying (FSK) Theoretical Foundations: Frequency Shift Keying (FSK) is a discrete frequency modulation scheme wherein the digital information is encoded via instantaneous shifts in the carrier signal's frequency. The fundamental implementation is Binary FSK (BFSK), which maps binary data onto two distinct, discrete spectral states. A binary '1' (the "mark" state) is represented by a carrier frequency \( f_1 \), while a binary '0' (the "space" state) corresponds to frequency \( f_2 \). Each symbol is sustained for a bit interval denoted by \( T_b \). FSK Transmitter Characterization: The mathematical model for the modulated BFSK output \( s(t) \) is defined as: \[ s(t) = \begin{cases} A_c \cos(2\pi f_1 t), & \text{for } m = 1 \\ A_c \cos(2\pi f_2 t), & \text{for } m = 0 \end{cases} \] ...

Constellation Diagrams of ASK, PSK, and FSK (with MATLAB Code + Simulator)

Constellation Diagrams: ASK, FSK, and PSK Comprehensive guide to signal space representation, including interactive simulators and MATLAB implementations. 📘 Overview 🧮 Simulator ⚖️ Theory 📈 Q-function 📚 Resources BASK Modulation Transmits one of two signals: 0 or $\sqrt{E_b}$, representing binary 0 and 1. Simple but sensitive to noise. BFSK Modulation Transmits one of two signals: $\sqrt{E_b}$ on the Y-axis or $\sqrt{E_b}$ on the X-axis. These are orthogonal signals. BPSK Modulation Transmits $+\sqrt{E_b}$ or $-\sqrt{E_b}$ (antipodal signaling). Most efficient binary scheme. ...

Coherence Bandwidth and Coherence Time (with MATLAB + Simulator)

🧮 Coherence Bandwidth 🧮 Coherence Time 🧮 MATLAB Code s 📚 Further Reading For Doppler Delay or Multi-path Delay Coherence time T coh ∝ 1 / v max (For slow fading, coherence time T coh is greater than the signaling interval.) Coherence bandwidth W coh ∝ 1 / Ï„ max (For frequency-flat fading, coherence bandwidth W coh is greater than the signaling bandwidth.) Where: T coh = coherence time W coh = coherence bandwidth v max = maximum Doppler frequency (or maximum Doppler shift) Ï„ max = maximum excess delay (maximum time delay spread) Notes: The notation v max −1 and Ï„ max −1 indicate inverse proportionality. Doppler spread refers to the range of frequency shifts caused by relative motion, determining T coh . Delay spread (or multipath delay spread) determines W coh . Frequency-flat fading occurs when W coh is greater than the signaling bandwidth. Coherence Bandwidth Coherence bandwidth is...