Ontological Layer: The Discrete Complex Plane

The Z-Domain

Transforming Sequences into Algebraic Geometry

The Algebra of Discrete Time

Just as the Laplace transform conquered continuous-time differential equations, the Z-transform conquers discrete-time difference equations. By wrapping the infinite imaginary axis around the Unit Circle, the Z-transform converts sequences into rational functions of 'z'. The stability of digital filters, the handling of recursive feedback, and the determination of causality are completely defined by the location of Poles and Zeros relative to the mystical boundary of |z| = 1.

DIFFERENCE EQUATION y[n] → Z-TRANSFORM → COMPLEX z-PLANE → POLES & ZEROS → REGION OF CONVERGENCE → UNIT CIRCLE (|z|=1)

The 14 Z-Nodes

Ontological Mapping: Sequences to Complex Geometry

CHAMBER 01

Why Z-Transform?

Need for discrete-time analysis
Solving difference equations algebraically
Handling recursive systems
Discrete counterpart to Laplace

CHAMBER 02

The z-Plane

z = re^{jω} representation
Magnitude r (radius)
Angle ω (frequency)
Mapping s-plane to z-plane

CHAMBER 03

Bilateral Transform

X(z) = Σ x[n]z^{-n}
Summation from -∞ to +∞
Handles non-causal sequences
Necessitates ROC for uniqueness

CHAMBER 04

Unilateral Transform

Summation from n = 0 to +∞
Ideal for initial value problems
Standard for causal system analysis
Handles switching transients

CHAMBER 05

Region of Convergence

Circular geometry in z-plane
Right-sided sequence → Exterior ROC
Left-sided sequence → Interior ROC
Two-sided sequence → Annulus ROC

CHAMBER 06

Transform Properties

Time Shift (Delay) ↔ z^{-k} factor
Convolution ↔ X(z)H(z)
Multiplication by a^n ↔ Scaling in z
Time reversal ↔ Inversion of z

CHAMBER 07

Standard Pairs Vault

SEQ x[n]Z-TRANSFORM

Unit Impulse δ[n] ↔ 1
Unit Step u[n] ↔ z/(z-1)
Exponential a^n u[n] ↔ z/(z-a)
Sinusoidal sequences

CHAMBER 08

Inverse Transform

Partial Fraction Expansion
Power Series (Long Division)
Residue Method
ROC dictates right/left sidedness

CHAMBER 09

Poles & Zeros

Roots of Numerator (Zeros, ○)
Roots of Denominator (Poles, ×)
Pole radius determines growth/decay
Pole angle determines oscillation frequency

CHAMBER 10

System Function H(z)

H(z) = Y(z) / X(z)
Z-transform of impulse response h[n]
Rational transfer functions
Determines complete LTI behavior

CHAMBER 11

Difference Equations

Discrete equivalent of differential equations
Applying delay property z^{-k}
Finding H(z) directly from coefficients
Zero-State vs Zero-Input response

CHAMBER 12

Unit Circle & Stability

Unit circle |z| = 1 boundary
Causal LTI Stability: All poles INSIDE unit circle
Frequency Response evaluates H(z) on unit circle
Poles outside |z|=1 cause instability

CHAMBER 13

Z-Domain Classification

FIR systems (All poles at origin)
IIR systems (Feedback, poles away from origin)
Minimum-phase systems (zeros inside unit circle)
ROC topology mapping

FINAL PROTOCOL

14 — The Z-Domain Laboratory

1. H(z) = 1 / (1 - 1.5z⁻¹ + 0.5z⁻²)

2. POLES AT z = 1.0, z = 0.5

3. SYSTEM MARGINALLY STABLE (Pole ON Unit Circle)

[1] FIND H(z) [2] PLOT POLES [3] IDENTIFY ROC [4] CHECK UNIT CIRCLE [5] FIND FREQ RESPONSE

We have successfully mapped discrete sequences into algebraic geometry. By observing where the poles land relative to the Unit Circle, we gain total command over the stability and behavior of digital filters. The final step is to understand how these discrete sequences are actually created from physical reality. You are now ready for Realm 07: Sampling & Quantization.

Z-DOMAIN DIAGNOSTIC RUNNING