NYQUIST: f_s > 2 f_max
RESOLUTION: L = 2^N
SYSTEM_STATE: SAMPLING
DOMAIN: DISCRETE_DIGITAL
ASKiIMAN™ DOOR 05 / DSP / REALM 07
--:-- · -- --- ----

Ontological Layer: The Analog/Digital Boundary

Sampling & Quantization

Measuring Reality to Create Digital Data

The Digital Translation

A computer cannot process reality; it can only process numbers. To bring an infinitely continuous physical signal into the machine, we must shatter it into discrete fragments of time (Sampling) and approximate its infinite values into fixed, binary steps (Quantization). This realm defines the absolute mathematical boundaries of this translation: how fast we must sample to avoid Aliasing (the Nyquist Theorem), and the inevitable error introduced when we round reality to fit into digital resolution.

ANALOG SIGNAL x(t) → SAMPLER (DISCRETE TIME) → NYQUIST LIMIT → QUANTIZER (DISCRETE AMP) → ERROR |e| ≤ Δ/2 → DIGITAL ENCODER

The 14 Conversion Nodes

Ontological Mapping: From Continuous to Binary

CHAMBER 01

Why Sample?

  • Computers require discrete data
  • Measuring at fixed time intervals
  • Bridge between analog and digital
  • Sampling frequency (f_s) concept
CHAMBER 02

Sampling Process

  • Ideal impulse-train sampling
  • Multiplication in time domain
  • Sample-and-hold circuit
  • x_s(t) = x(t)·p(t)
CHAMBER 03

Sampling Rate

  • f_s = 1 / T_s relationship
  • Sample density over time
  • Oversampling vs Undersampling
  • High rates → Better approximation
CHAMBER 04

Nyquist Theorem

  • Minimum theoretical sampling rate
  • Must sample at > 2·f_max
  • Bandlimited signal requirement
  • Guarantees perfect reconstruction
CHAMBER 05

Aliasing

  • Violation of Nyquist limit
  • High frequencies fold back as low frequencies
  • Spectral overlap in frequency domain
  • Irreversible information corruption
CHAMBER 06

Anti-Aliasing Filter

  • Analog low-pass prefilter
  • Removes frequencies above f_s/2
  • Enforces bandlimited condition
  • Essential hardware before ADC
CHAMBER 07

Spectral View

  • Sampling replicates spectrum
  • Replicas centered at integer multiples of f_s
  • Convolution in frequency domain
  • Bridge to Fourier analysis
CHAMBER 08

Reconstruction

  • Digital to Analog Conversion (DAC)
  • Zero-order hold (Staircase generation)
  • Low-pass reconstruction filter
  • Ideal sinc interpolation
CHAMBER 09

Quantization

  • Discretizing continuous amplitude
  • Mapping to nearest discrete level
  • Uniform vs Non-uniform steps
  • Creates the "staircase" effect
CHAMBER 10

Quantization Error

  • Difference between analog value and step
  • e_q = Quantized Value - True Value
  • Max error for rounding: ± Δ/2
  • Perceived as Granular Noise
CHAMBER 11

Resolution & Bits

  • Bit depth (N) determines levels (L = 2^N)
  • 8-bit = 256 levels, 16-bit = 65,536
  • Higher resolution → smaller step size (Δ)
  • Improves Signal-to-Noise Ratio (SNR)
CHAMBER 12

ADC Architecture

  • Full pipeline hardware
  • Analog Filter → S/H → Quantizer → Encoder
  • Conversion time and delay
  • Flash, SAR, Sigma-Delta concepts
CHAMBER 13

Signal Classification

  • Analog: Continuous Time / Continuous Amp
  • Sampled: Discrete Time / Continuous Amp
  • Digital: Discrete Time / Discrete Amp
  • Nyquist constraint evaluation
FINAL PROTOCOL

14 — The Conversion Laboratory

1. f_max = 20 kHz → f_N = 40 kHz
2. SAMPLE AT f_s = 44.1 kHz (SAFE)
3. QUANTIZE: 16-BIT (65,536 LEVELS)
4. CD-QUALITY AUDIO ESTABLISHED
[1] CALCULATE NYQUIST [2] DETECT ALIASING [3] CHOOSE LPF CUTOFF [4] MEASURE ERROR e_q [5] RECONSTRUCT SIGNAL

You have successfully pulled a continuous physical signal through the digital gate. By obeying the Nyquist theorem and managing quantization error, reality is now represented as an array of binary numbers in memory. The machine can finally perform math upon it. You are now prepared for Realm 08: Digital Signal Processing.

CONVERSION DIAGNOSTIC RUNNING