Chapter 4: Sampling & Multi-Rate Processing — Compact Review

1. The Shannon-Nyquist Sampling Theorem

1.1 Theorem Statement and Fundamental Bounds

*(Target: Theory Descriptive / Numerical Solving)* [1.05, 4.01]

Shannon-Nyquist Theorem: A continuous-time, band-limited analog signal $x_{a} (t)$ containing no frequency components higher than $f_{max}$ Hz can be uniquely and perfectly reconstructed from its discrete samples $x_{a} (n T)$ if and only if the sampling frequency $F_{s}$ (samples/second) satisfies [1.05, 6.1.2]: $F_{s} \geq 2 f_{max}$
Nyquist Rate ( $F_{N}$ ): The absolute minimum theoretical sampling rate to avoid overlap (aliasing) [1.05, 6.1.2]: $F_{N} = 2 f_{max}$
Nyquist Interval ( $T_{N}$ ): The maximum allowable time duration between consecutive samples [1.05]: $T_{N} = \frac{1}{F _{N}} = \frac{1}{2 f _{max}}$
Band-Pass Sampling Theorem: For a band-pass signal with non-zero energy restricted to the frequency band $f_{L} < ∣ f ∣ < f_{H}$ , the minimum sampling rate to prevent aliasing is [6.1.2]: $F_{s} \geq 2Δ f = 2 (f_{H} - f_{L})$

1.2 Frequency-Domain Representation of Sampling (Spectral Replication)

*(Target: Mathematical Proof / 10-Mark Derivation)* [4.01]

Mathematical Modeling: The sampled signal $x_{s} (t)$ is modeled as the multiplication of the analog signal $x_{a} (t)$ by an infinite periodic Dirac impulse train $p (t) = \sum_{n = - \infty}^{\infty} δ (t - n T_{s})$ with period $T_{s}$ [6.1.1]: $x_{s} (t) = x_{a} (t) \cdot p (t) = \sum_{n = - \infty}^{\infty} x_{a} (n T_{s}) δ (t - n T_{s}) (derivation)$
Frequency-Domain Spectrum: Multiplying in the time domain corresponds to convolving their respective Fourier transforms in the frequency domain, replicating the analog spectrum $X_{a} (j Ω)$ at integer multiples of the sampling angular frequency $Ω_{s} = \frac{2 π}{T _{s}}$ [4.01, 7.4]: $X_{s} (j Ω) = \frac{1}{T _{s}} \sum_{k = - \infty}^{\infty} X_{a} (j (Ω - k Ω_{s})) (derivation)$

2. The Three Sampling Conditions

*(Target: Theory Descriptive / Spectral Diagrams)* [1.05, 4.02]

Condition	Mathematical Criteria	Spectral Dynamics	Reconstruction Filter Requirement
Over-sampling	$F_{s} > 2 f_{max}$	Adjacent spectral replications are separated by a guard band ( $F_{s} - 2 f_{max}$ ) [1.05].	Practical, cheap low-pass filter with a gradual transition band [1.05].
Nyquist-rate sampling	$F_{s} = 2 f_{max}$	Adjacent spectral replications touch exactly at their edges without overlapping [1.05].	Ideal “brick-wall” low-pass filter with an infinite roll-off slope [1.05].
Under-sampling	$F_{s} < 2 f_{max}$	Adjacent spectral replications overlap, causing aliasing (frequency folding) [1.05].	Non-recoverable: Original signal cannot be reconstructed by any filter [1.05].

[GRAPH: Replicated frequency spectra showing: (1) Over-sampling (spectral copies separated by guard bands), (2) Nyquist sampling (copies exactly touching at f_max), and (3) Under-sampling (copies overlapping, highlighting shaded aliasing fold-over regions) — source: Ch 4.02 / Ch 7 Fig 7.12]

3. Aliasing Dynamics & Anti-Aliasing Filters

3.1 Aliasing Effect

*(Target: Theory Descriptive)* [1.05, 4.02]

Definition: A destructive, irreversible frequency-folding distortion that occurs when an analog signal is under-sampled ( $F_{s} < 2 f_{max}$ ) [1.05, 6.1.2].
Mechanism: High-frequency spectral components above the folding frequency (Nyquist frequency, $F_{s} /2$ ) fold back into the baseband spectrum and masquerade as false low-frequency components [1.05, 6.1.2].

3.2 Anti-Aliasing Filter

*(Target: Theory Descriptive)* [4.02]

Definition: A high-order analog low-pass filter placed before the sampler (A/D converter) [1.05, 4.02].
Function: It band-limits the input analog signal by stripping away all noise and frequency components higher than $F_{s} /2$ {the folding limit} before sampling occurs, ensuring the Nyquist criterion is strictly satisfied [1.05, 4.02].

4. Classification of Sampling Techniques

*(Target: Theory Descriptive / Structural Comparison)* [1.05, 4.03]

The physical switching implementation of sampling is divided into three distinct methodologies:

Parameter / Feature	Ideal (Impulse) Sampling	Natural Sampling (Chopping)	Flat-Top Sampling (Sample & Hold)
Mathematical Multiplier	Infinite train of zero-width Dirac delta impulses: $δ_{T_{s}} (t)$ [1.05, 4.03].	Periodic train of finite-width rectangular pulses of duration $τ$ [1.05, 4.03].	Sampled value held strictly constant over duration $τ$ via capacitor [1.05, 4.03].
Waveform Top Profile	Zero width, infinite height impulses [1.05].	Tops of pulses follow the exact analog curve of $x_{a} (t)$ [1.05, 141].	Tops of pulses are perfectly flat, producing a staircase profile [1.05, 141].
Spectral Envelope	Flat amplitude scaling factor $\frac{1}{T _{s}}$ across all frequencies [7.4].	Monotonically decaying sinc envelope: scaled by Fourier coefficients $C_{n}$ [4.03].	Decaying sinc function envelope: $H_{sh} (j Ω) = τ \cdot sinc (\frac{Ω τ}{2}) e^{- j Ω τ /2}$ [4.03].
High-Frequency Distortion	None.	None (within the baseband) [4.03].	Aperture Effect: Sinc envelope attenuates high frequencies within the baseband [4.03].
Equalizer Required?	No.	No [4.03].	Yes: Requires a $sinc^{- 1}$ equalizer filter to restore flat response [4.03].

[GRAPH: Graphical wave representation comparing: (1) Analog wave, (2) Natural sampled wave (curving tops), and (3) Flat-top sampled wave (flat horizontal tops) — source: Ch 4.03 / Ch 6 Fig 6.3]

4.1 The Aperture Effect

*(Target: Theory Descriptive)* [4.03]

Aperture Effect: The high-frequency amplitude distortion (droop) introduced during flat-top sampling because the pulse width $τ$ is finite (not an ideal impulse) [4.03].
Mathematical Envelope: The baseband spectrum is multiplied by a sinc envelope [4.03]: $H_{sh} (j Ω) = τ (\frac{s i n ( Ω τ /2 )}{Ω τ /2}) e^{- j Ω τ /2}$
Remedy: An active equalizer circuit with frequency response proportional to $H_{eq} (j Ω) \approx \frac{1}{sinc ( Ω τ /2 )}$ is placed in the reconstruction stage to compensate for the high-frequency attenuation [4.03].

5. Reconstruction & Zero-Order Hold (ZOH)

5.1 Ideal Reconstruction (Whittaker-Shannon Interpolation)

*(Target: Mathematical Proof / 10-Mark Derivation)* [7.5]

Mechanism: Ideal reconstruction is achieved by passing the sampled impulse train $x_{s} (t)$ through an ideal “brick-wall” low-pass filter $H_{LP} (j Ω)$ with cutoff frequency $Ω_{c} = Ω_{s} /2 = π / T_{s}$ and gain $T_{s}$ [7.5]: $H_{LP} (j Ω) = {T_{s}, 0, ∣Ω∣ \leq Ω_{c} ∣Ω∣ > Ω_{c} \leftrightarrow h_{LP} (t) = \frac{s i n ( π t / T _{s} )}{π t / T _{s}} = sinc (\frac{t}{T _{s}}) (derivation)$
Reconstruction Formula: In the time domain, convolving $x_{s} (t)$ with $h_{LP} (t)$ yields the continuous-time signal $x_{a} (t)$ via sinc interpolation [7.5]: $x_{a} (t) = \sum_{n = - \infty}^{\infty} x_{a} (n T_{s}) \cdot sinc (\frac{t - n T _{s}}{T _{s}}) (derivation)$

5.2 Quantization Mechanics & SQNR

*(Target: Theory Descriptive / Numerical Solving)* [6.1.2, 6.1.3]

Quantization Step Size ( $Δ$ ): For a $b$ -bit linear quantizer with a full-scale voltage range $A$ , the step size is [6.1.3]: $Δ = \frac{A}{2 ^{b}}$
Quantization Noise Power ( $P_{qn}$ or $σ_{e}^{2}$ ): Assuming the quantization error $e (n)$ is uniformly distributed in the range $[- Δ/2, Δ/2]$ , the mean-square error (noise power) is [6.1.3]: $P_{qn} = σ_{e}^{2} = \frac{1}{Δ} \int_{- Δ/2}^{Δ/2} e^{2} d e = \frac{Δ ^{2}}{12} (derivation)$
Signal-to-Quantization Noise Ratio (SQNR): Expressed as a function of the number of bits $b$ , the maximum theoretical SQNR for a full-scale sinusoidal input is [6.1.3]: $SQNR_{dB} \approx 6.02 b + 1.76 dB$ {Note: Every additional bit added to the ADC resolution improves the SQNR by exactly 6.02 dB}.

6. Multi-Rate Signal Processing

*(Target: Theory Descriptive / Numerical Solving)* [4.04]

6.1 Discrete-Time Down-sampler (Decimator)

*(Target: Numerical Solving / Array Manipulation)* [1.05, 4.04]

Definition: Reduces the sampling rate of a discrete sequence by an integer factor $M$ [1.05, 4.04].
Operation: Keeps every $M$ -th sample and discards the intermediate $M - 1$ samples [1.05, 4.04]: $x_{d} [n] = x [n M]$
Anti-Aliasing Filter Requirement: To prevent digital aliasing before discarding samples, the discrete signal must be band-limited to $∣ ω ∣ < π / M$ using a digital low-pass decimation filter [4.04].

6.2 Discrete-Time Up-sampler (Interpolator)

*(Target: Numerical Solving / Array Manipulation)* [1.05, 4.04]

Definition: Artificially increases the sampling rate of a discrete sequence by an integer factor $L$ [1.05, 4.04].
Operation: Inserts $L - 1$ zero-valued samples between consecutive original samples [1.05, 4.04]: $x_{e} [n] = {x [n / L], 0, n = 0, \pm L, \pm 2 L, \dots otherwise$
Anti-Imaging Filter Requirement: To remove the high-frequency spectral images created by the inserted zeros, the up-sampled signal must be passed through a digital low-pass interpolation filter with cutoff $ω_{c} = π / L$ and gain factor $L$ [4.04].

6.3 Down-sampling vs. Up-sampling Comparison

*(Target: Theory Descriptive)* [4.04]

Feature / Property	Down-sampler (Compressor)	Up-sampler (Expander)
Mathematical Identity	$x_{d} [n] = x [n M]$ [1.05, 4.04]	$x_{e} [n] = x [n / L]$ for multiples of $L$ [1.05, 4.04]
Effect on Array Length	Slashes length by a factor of $M$ .	Expands length by a factor of $L$ .
Time-Domain Operation	Discards $M - 1$ in-between samples [1.05, 4.04].	Inserts $L - 1$ zeros in-between samples [1.05, 4.04].
Frequency Spectrum Effect	Stretches the spectrum in frequency.	Compresses the spectrum, creating images.
Filtering Required	Low-pass decimation filter before down-sampling [4.04].	Low-pass interpolation filter after up-sampling [4.04].
Data Loss Profile	Lossy (irreversible unless over-sampled) [1.05].	Non-lossy (information is fully preserved).

7. Common Mistakes That Cost Marks

Critical Exam Pitfalls

Bit-Reversal / Shift Origin Mismatch: In down-sampling numericals, forgetting to track the origin index ( $n = 0$ , underlined or marked with an arrow). Down-sampling keeps samples at $n M$ measured strictly relative to the original origin sample, not just from the left-most element of the array.

Omitting Zero Insertion in Up-sampling: Writing interpolations by directly duplicating adjacent samples (staircase interpolation) instead of inserting actual zeros first before passing through the low-pass interpolation filter.

Forgetting the Equalizer in Flat-Top Sampling: Stating that flat-top sampling preserves baseband signal spectrum shape without distortion. You must specify that it introduces aperture effect droop and requires a $sinc^{- 1}$ equalizer [4.03].

Nyquist Interval Variable Swap: Confusing the Nyquist Rate (frequency, $2 f_{max}$ ) with the Nyquist Interval (time, $1/ (2 f_{max})$ ).

8. PYQ Bank — Verbatim Questions & Answer Plans

Q1: Down-sampling and Up-sampling Array Solving [KUET 2024, 2022]

Question: What is discrete-time up-sampler and down-sampler? Find the up-sampling sequence and down-sampling sequence for a given signal array by factor 3.
Answer Plan:
1. Define down-sampler and write the compressor identity: $x_{d} [n] = x [n M]$ [1.05].
2. Define up-sampler and write the expander identity: $x_{e} [n] = x [n / L]$ [1.05].
3. Identify the index $n = 0$ of the given array.
4. Extract indices at multiples of $3$ to formulate the down-sampled array.
5. Insert exactly 2 zeros between every adjacent sample of the original array to formulate the up-sampled array.

Q2: Shannon-Nyquist Theorem Proof [KUET 2019, 2018, 2017]

Question: State and prove the Shannon-Nyquist sampling theorem.
Answer Plan:
1. State the theorem: $F_{s} \geq 2 f_{max}$ [1.05].
2. Model the impulse-train sampler mathematically: $x_{s} (t) = x_{a} (t) \cdot \sum δ (t - n T_{s})$ [6.1.1].
3. (derivation): Apply continuous-time Fourier transform to show $X_{s} (j Ω) = \frac{1}{T _{s}} \sum X_{a} (j (Ω - k Ω_{s}))$ [4.01].
4. Discuss how overlapping spectra (aliasing) occurs if $Ω_{s} < 2 Ω_{m}$ , whereas guard bands are maintained if $Ω_{s} > 2 Ω_{m}$ [1.05, 4.02].

Q3: Distinguish Between Sampling Techniques [KUET 2018, 2017]

Question: Classify sampling techniques and distinguish between Ideal, Natural, and Flat-top sampling.
Answer Plan:
1. List the three sampling classifications [1.05].
2. Insert comparison matrix detailing: Mathematical multiplier, Waveform top profile, Spectrum envelope, and Equalizer requirements [4.03].
3. Explicitly define the aperture effect droop and the role of the recovery filter [4.03].

Chapter 9 Self-Check Revision Checklist

Can you write down the frequency-domain representation of uniform sampling from memory?
Do you know how the aperture effect shifts flat-top sampling spectrum profiles compared to ideal impulse sampling?
Can you solve discrete down-sampling array mappings relative to a shifted index origin?
Do you know the exact SQNR improvement obtained per additional ADC bit?

007_index

4.00 Sampling and Multi-Rate Processing Compact Review