Study guide

4.3 Direct Digital Synthesis (DDS), SDR Architectures, and Digital Filter Topologies

ACMA Amateur Radio Advanced Recognition Certificate - Theory Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: DC Theory, Circuit Laws & Passive Components

1.1 DC Circuit Analysis, Ohm's Law, and Kirchhoff's Laws 1.2 AC Fundamentals, Sine Waves, Peak, RMS, and Phase Relationships 1.3 Inductance, Capacitance, Reactance, and Time Constants

2 Chapter 2: Impedance, Resonance & Passive Filters

2.1 Complex Impedance, Phasors, and AC Circuit Analysis 2.2 Series and Parallel LC Resonance and Q Factor 2.3 Passive Filters, Cutoff Frequency, and Attenuator Pads

3 Chapter 3: Semiconductor Devices & Power Supplies

3.1 Semiconductor Diodes, Zener Regulators, and Rectifier Circuits 3.2 Bipolar Junction Transistors, FETs, and Operational Amplifiers 3.3 Thermionic Valves (Vacuum Tubes) and High-Power Linear Amplifiers 3.4 DC Power Supplies, Filter Networks, and Voltage Regulators

4 Chapter 4: Oscillators & Frequency Synthesis

4.1 RF Oscillators, LC Tank Topologies, and Frequency Stability 4.2 Phase-Locked Loops (PLLs) and Frequency Synthesisers 4.3 Direct Digital Synthesis (DDS), SDR Architectures, and Digital Filter Topologies

5 Chapter 5: RF Amplifiers & Linearity

5.1 Classes of Amplification, Conduction Angles, and Operating Efficiency 5.2 RF Power Amplifiers, Push-Pull Topologies, and Output Matching 5.3 Amplifier Stability, Neutralisation, and Intermodulation Distortion

6 Chapter 6: Modulation & Demodulation

6.1 Amplitude Modulation, Double Sideband, and Single Sideband (SSB) 6.2 Frequency Modulation, Phase Modulation, and FM Detectors 6.3 Digital Modulation Modes, Spectral Efficiency, and Weak-Signal Protocols

7 Chapter 7: Transmitters, Mixers & Receivers

7.1 RF Mixers, Frequency Translation, and Intermodulation 7.2 Transmitter Architectures, CW Keying, and Output Filtering 7.3 Superheterodyne Receiver Design, IF Selection, and Image Rejection 7.4 Receiver Performance Specifications, Dynamic Range, and Selectivity

8 Chapter 8: Transmission Lines & Waveguides

8.1 Transmission Line Characteristics, Impedance, and Velocity Factor 8.2 Standing Waves, Reflection Coefficient, SWR, and Return Loss 8.3 Resonant Line Sections, Quarter-Wave Transformers, and Stubs

9 Chapter 9: Impedance Matching & Baluns

9.1 Lumped-Element Matching Networks and Antenna Tuning Units 9.2 Baluns, Ununs, and Common-Mode Current Choking 9.3 Feedline Losses, High-SWR Stress, and Coaxial Installation Practice

10 Chapter 10: Practical Antennas & Arrays

10.1 Resonant Dipoles, Inverted-Vs, and Multiband Wire Antennas 10.2 Quarter-Wave Verticals, Ground Systems, and Radiation Efficiency 10.3 Parasitic Arrays, Yagi-Uda Antennas, and Quad Arrays 10.4 Antenna Gain, Aperture Antennas & Horns, ERP/EIRP, Radiation Patterns

11 Chapter 11: Radio Wave Propagation & Ionospheric Mechanics

11.1 Electromagnetic Wave Fundamentals, Polarisation, and Ground Waves 11.2 The Ionosphere, Solar Radiation, and Solar Cycles 11.3 Critical Frequency, Maximum Usable Frequency, and HF Propagation Paths

12 Chapter 12: VHF/UHF Propagation & Space Communications

12.1 Line-of-Sight, Tropospheric Ducting, and Diffraction 12.2 Sporadic-E, Auroral Scatter, and Trans-Equatorial Propagation 12.3 Amateur Satellites, Doppler Shift, and Earth-Moon-Earth (EME)

13 Chapter 13: Test Equipment & RF Measurements

13.1 Decibels, Power Ratios, and Cascaded Stage Calculations 13.2 RF Power Meters, Directional Couplers, and Dummy Loads 13.3 Multirange Meters, Waveform Diagnostics, Oscilloscopes, and Frequency Counters

14 Chapter 14: Advanced RF Analysis & Diagnostics

14.1 Spectrum Analyser Architecture, Operation, and Spectral Purity 14.2 Antenna Analysers, Vector Network Analysers, and Smith Charts 14.3 Calibrated Signal Generators, Grid Dip Meters, and Component Testing

15 Chapter 15: Electromagnetic Compatibility & Interference

15.1 Sources of Interference, Coupling Mechanisms, and Audio Rectification 15.2 Receiver Susceptibility, Desensitisation, and Front-End Intermodulation 15.3 Practical RFI Suppression, Filter Design, and Bonding Techniques

16 Chapter 16: Electrical, RF & Station Safety

16.1 Biological Effects of RF Energy and ARPANSA Exposure Standards 16.2 Safe Separation Distances, Power Density, and Duty Cycles 16.3 Station Electrical Safety, Battery Hazards, and Safe Headphone Use 16.4 Mast and Tower Construction, Power Line Clearance, and Lightning Protection

4.3 Direct Digital Synthesis (DDS), SDR Architectures, and Digital Filter Topologies

Key Takeaways Explain This Topic AI

Direct Digital Synthesis (DDS) generates RF sine waves numerically by incrementing an N-bit phase accumulator by Frequency Tuning Word M at clock rate f_clk, yielding f_out = (M · f_clk) / 2^N with sub-hertz resolution Δf = f_clk / 2^N.

Software Defined Radios utilize orthogonal In-phase (I) and Quadrature (Q) baseband processing to separate positive and negative frequencies, eliminating image responses mathematically without analog IF crystal ladder filters.

Finite Impulse Response (FIR) filters use a finite set of input samples and are stable for finite coefficients. Symmetric or antisymmetric real coefficients give linear phase; sharp transitions may require many taps.

Infinite Impulse Response (IIR) filters are recursive, emulating sharp analog Butterworth/Chebyshev skirts with minimal coefficients, but possess non-linear phase and require all z-plane poles to reside strictly inside the unit circle (|z_p| < 1) for stability.

The Convolution Theorem establishes that discrete time-domain convolution (y[n] = x[n] * h[n] = Σ x[k] h[n-k])—evaluated by folding, shifting, multiplying, and summing—is mathematically equivalent to multiplication in the frequency domain (Y(f) = X(f) · H(f)).

Last updated: November 2026

4.3 Direct Digital Synthesis (DDS), SDR Architectures, and Digital Filter Topologies

Digital signal processing (DSP) and high-speed mixed-signal converters have revolutionized modern amateur radio transceiver design. In place of drift-prone analog LC tanks, varactor diodes, and crystal ladder filters, contemporary equipment employs Direct Digital Synthesis (DDS) for agile frequency generation, Software Defined Radio (SDR) front-ends for direct digitisation, and FIR/IIR digital filters operating via discrete convolution.

Sampling, Quantisation and Conversion

An ADC samples voltage at times n T s nT_s n T s ​ , where T s = 1 / f s T_s=1/f_s T s ​ = 1/ f s ​ , then assigns each sample an amplitude code. Sampling makes time discrete; quantisation gives a finite set of amplitude levels. An ideal 8-bit converter has 256 codes; over a 1 V input span its nominal step is 1 / 256 = 3.906 mV 1/256=3.906\text{ mV} 1/256 = 3.906 mV . Rounding to the nearest level introduces quantisation error, rather than preserving every possible input voltage.

For ordinary real-valued baseband sampling, keep the highest signal frequency below the Nyquist frequency f s / 2 f_s/2 f s ​ /2 . Thus 3.4 kHz audio needs a rate greater than 6.8 kS/s; 8 kS/s leaves some transition space for an analogue anti-alias filter. At 8 kS/s, an unwanted 6 kHz tone aliases to 2 kHz and cannot later be distinguished from an original 2 kHz input using those samples alone. Analogue input --> anti-alias filter --> ADC --> digital processing

Digital output --> DAC --> reconstruction/anti-image filter --> analogue output

The input filter prevents unwanted frequencies from folding into the sampled band. The output filter suppresses DAC spectral images. More bits improve amplitude resolution; they do not replace an adequate sampling rate or filtering.

Direct Digital Synthesis (DDS) Architecture

A Direct Digital Synthesiser—or Numerically Controlled Oscillator (NCO) —synthesizes periodic waveforms mathematically by computing digital phase samples and converting them to analog voltages at a constant master clock rate f clk f_{\text{clk}} f clk ​ . +-----------------+ +-----------------+ +---------+ +----------------+

  • f_clk ---->| N-bit Phase |====>| Phase-to-Amp |====>| High- |====>| Reconstruction |----> f_out
  • | Accumulator | | LUT / CORDIC | | Spd DAC | | Analog LPF |
  • M (FTW) -->| (overflow=f0) | | (P-bit MSBs) | +---------+ +----------------+
  • +-----------------+ +-----------------+
  • Functional Pipeline and Tuning Mathematics

Phase Accumulator ( N N N bits): Acts as an ideal digital integrator of frequency into phase. On each clock edge of f clk f_{\text{clk}} f clk ​ , an N N N -bit register increments its content by an N N N -bit Frequency Tuning Word (FTW), denoted M M M : Φ [ n ] = ( Φ [ n − 1 ] + M ) ( m o d 2 N ) \Phi[n] = (\Phi[n-1] + M) \pmod{2^N} Φ [ n ] = ( Φ [ n − 1 ] + M ) ( mod 2 N ) Accumulator overflows establish the fundamental output frequency: f out = M ⋅ f clk 2 N f_{\text{out}} = \frac{M \cdot f_{\text{clk}}}{2^N} f out ​ = 2 N M ⋅ f clk ​ ​ The minimum frequency resolution ( Δ f \Delta f Δ f , for M = 1 M = 1 M = 1 ) is: Δ f = f clk 2 N \Delta f = \frac{f_{\text{clk}}}{2^N} Δ f = 2 N f clk ​ ​ For a 32-bit accumulator clocked at 100 MHz 100\text{ MHz} 100 MHz , Δ f ≈ 0.0233 Hz \Delta f \approx 0.0233\text{ Hz} Δ f ≈ 0.0233 Hz , delivering sub-hertz tuning agility across the Nyquist bandwidth.

Phase-to-Amplitude Converter: Translates instantaneous phase values into sinusoidal amplitude words via a Read-Only Memory lookup table (LUT) or pipelined CORDIC algorithm.

Digital-to-Analog Converter (DAC): Converts discrete digital words into an analog staircase voltage waveform.

Reconstruction Low-Pass Filter: Suppresses DAC staircase sampling harmonics and Nyquist alias images ( f image = f clk − f out f_{\text{image}} = f_{\text{clk}} - f_{\text{out}} f image ​ = f clk ​ − f out ​ ). Practical designs restrict f out ≤ 0.40 ⋅ f clk f_{\text{out}} \le 0.40 \cdot f_{\text{clk}} f out ​ ≤ 0.40 ⋅ f clk ​ to ensure realizable analog filter cutoff skirts.

Phase Truncation Spurs: Passing only P P P MSBs (e.g., 12 to 16 bits) to the sine LUT discards the N − P N - P N − P least significant bits. This periodic truncation error modulates the carrier, generating discrete phase truncation spurs. DAC non-linearity also creates spurs. Spurious-Free Dynamic Range (SFDR) is the carrier-to-largest-spur ratio in the specified bandwidth; bit depth alone does not determine it.

Software Defined Radio (SDR) Front-End Architectures

SDR architectures represent RF signals as complex analytic phasors using In-phase ( I I I ) and Quadrature ( Q Q Q , 90 ∘ 90^\circ 9 0 ∘ offset) baseband components: s ( t ) = I ( t ) + j Q ( t ) = A ( t ) e j ϕ ( t ) s(t) = I(t) + j Q(t) = A(t) e^{j\phi(t)} s ( t ) = I ( t ) + j Q ( t ) = A ( t ) e j ϕ ( t ) Because complex representation separates positive ( e + j ω t e^{+j\omega t} e + jω t ) and negative ( e − j ω t e^{-j\omega t} e − jω t ) frequencies, an SDR mathematically rejects image responses ( S USB = I − H { Q } S_{\text{USB}} = I - \mathcal{H}\{Q\} S USB ​ = I − H { Q } ) without multi-pole analog IF crystal filters.

Direct Conversion (Zero-IF / Low-IF): Translates RF directly to baseband using quadrature mixers. The Tayloe detector employs a 4-phase commutating switch clocked at 4 f LO 4 f_{\text{LO}} 4 f LO ​ into four integrating capacitors ( 0 ∘ , 90 ∘ , 180 ∘ , 270 ∘ 0^\circ, 90^\circ, 180^\circ, 270^\circ 0 ∘ , 9 0 ∘ , 18 0 ∘ , 27 0 ∘ ). The capacitor outputs are combined to obtain the in-phase and quadrature baseband signals. Conversion loss, noise and intermodulation performance depend on the implemented circuit.

Direct RF Sampling: High-speed ADCs (e.g., 16-bit at 122.88 MSPS 122.88\text{ MSPS} 122.88 MSPS ) directly digitize the entire HF spectrum from the antenna. A Field-Programmable Gate Array (FPGA) Digital Down-Converter (DDC) applies digital quadrature mixing and decimation filtering, generating substantial processing gain: Processing Gain = 10 log ⁡ 10 ( f s 2 B ) dB \text{Processing Gain} = 10 \log_{10}\left( \frac{f_s}{2 B} \right)\text{ dB} Processing Gain = 10 lo g 10 ​ ( 2 B f s ​ ​ ) dB For approximately white ADC noise, this filtering improves in-band SNR. It does not raise the ADC clipping level or remove distortion spurs.

Digital Filtering: FIR vs. IIR Filter Topologies

Digital filtering in SDR transceivers is achieved through Finite Impulse Response (FIR) or Infinite Impulse Response (IIR) topologies. Direct Form I, second-order IIR (a0 = 1)

  • Input delays: x[n] -> [z^-1] -> x[n-1] -> [z^-1] -> x[n-2]
  • Output delays: y[n] -> [z^-1] -> y[n-1] -> [z^-1] -> y[n-2]
  • Feedforward sum = b0*x[n] + b1*x[n-1] + b2*x[n-2]
  • Feedback sum = -a1*y[n-1] - a2*y[n-2]
  • y[n] = Feedforward sum + Feedback sum

Each z^-1 is one sample of delay. Both weighted sums feed the output.

Mathematical Difference Equations and z-Plane Stability

FIR Filters (Non-Recursive): Output samples depend solely on present and past input samples: y [ n ] = ∑ k = 0 M b k x [ n − k ] y[n] = \sum_{k=0}^{M} b_k x[n-k] y [ n ] = ∑ k = 0 M ​ b k ​ x [ n − k ] In the complex z z z -plane, all poles reside at origin z = 0 z = 0 z = 0 . FIR filters with finite coefficients are stable . Real coefficients that are symmetric or antisymmetric about the impulse-response midpoint give linear phase (constant group delay). FIR filters need not have linear phase. Sharp transitions may require many taps, increasing computation and delay.

IIR Filters (Recursive): Output samples incorporate feedback from prior output samples: y [ n ] = ∑ k = 0 M b k x [ n − k ] − ∑ k = 1 N a k y [ n − k ] ⟺ H ( z ) = ∑ k = 0 M b k z − k 1 + ∑ k = 1 N a k z − k y[n] = \sum_{k=0}^{M} b_k x[n-k] - \sum_{k=1}^{N} a_k y[n-k] \quad \Longleftrightarrow \quad H(z) = \frac{\sum_{k=0}^{M} b_k z^{-k}}{1 + \sum_{k=1}^{N} a_k z^{-k}} y [ n ] = ∑ k = 0 M ​ b k ​ x [ n − k ] − ∑ k = 1 N ​ a k ​ y [ n − k ] ⟺ H ( z ) = 1 + ∑ k = 1 N ​ a k ​ z − k ∑ k = 0 M ​ b k ​ z − k ​

Realization Topologies: Direct Form I implements separate tapped delay lines for inputs and feedback outputs. Direct Form II is canonical, sharing a single tapped delay line of state variables, minimizing memory.

z z z -Plane Stability: Under the bilinear transform, z = ( 1 + s T / 2 ) / ( 1 − s T / 2 ) z=(1+sT/2)/(1-sT/2) z = ( 1 + s T /2 ) / ( 1 − s T /2 ) , where T T T is the sample period. It maps the left-half of the Laplace s s s -plane inside the z z z -plane unit circle. An IIR filter is bounded-input bounded-output (BIBO) stable if and only if all poles reside strictly inside the unit circle: ∣ z p ∣ < 1 |z_p| < 1 ∣ z p ​ ∣ < 1 For this causal rational filter, poles on or outside the unit circle ( ∣ z p ∣ ≥ 1 |z_p| \ge 1 ∣ z p ​ ∣ ≥ 1 ) fail the BIBO stability condition; natural responses may persist or grow. Fixed-point coefficient quantization can shift pole positions toward the unit circle, causing arithmetic overflow and limit-cycle oscillations (persistent autonomous oscillations under zero input).

Operational Trade-Offs: IIR filters can emulate classical analog filters (Butterworth, Chebyshev, elliptic), often meeting a magnitude-response specification with fewer coefficients than an FIR filter. Required order and delay depend on the specification. However, they exhibit non-linear phase (group delay dispersion), which can distort pulsed digital modulation waveforms.

  • Filter Characteristic Finite Impulse Response (FIR) Infinite Impulse Response (IIR)
  • Structure Non-recursive (feedforward only) Recursive (feedback of prior outputs)

Difference Equation y [ n ] = ∑ k = 0 M b k x [ n − k ] y[n] = \sum_{k=0}^{M} b_k x[n-k] y [ n ] = ∑ k = 0 M ​ b k ​ x [ n − k ] y [ n ] = ∑ k = 0 M b k x [ n − k ] − ∑ k = 1 N a k y [ n − k ] y[n] = \sum_{k=0}^{M} b_k x[n-k] - \sum_{k=1}^{N} a_k y[n-k] y [ n ] = ∑ k = 0 M ​ b k ​ x [ n − k ] − ∑ k = 1 N ​ a k ​ y [ n − k ]

z z z -Plane Poles All poles fixed at origin ( z = 0 z = 0 z = 0 ) Configurable poles anywhere in z z z -plane

Stability Unconditionally stable Conditionally stable ( ∣ z p ∣ < 1 \lvert z_p \rvert < 1 ∣ z p ​ ∣ < 1 required)

Phase Response Linear phase with suitable coefficient symmetry Usually non-linear phase

Computational Cost Often more taps for a given sharp transition Often fewer coefficients for the same magnitude response

  • Analog Emulation Complex tapped delay Direct Butterworth, Chebyshev, Elliptic
  • Linear Time-Invariant Systems and Discrete Convolution

The response y [ n ] y[n] y [ n ] of any Linear Time-Invariant (LTI) system to an arbitrary input sequence x [ n ] x[n] x [ n ] is computed by convolving x [ n ] x[n] x [ n ] with the system's unit impulse response h [ n ] h[n] h [ n ] . For an FIR digital filter, the impulse response values h [ k ] h[k] h [ k ] correspond directly to the filter tap coefficients b k b_k b k ​ .

Definition and the Convolution Theorem

The continuous convolution integral and discrete convolution sum are: y ( t ) = ∫ − ∞ ∞ x ( τ ) h ( t − τ ) d τ ⟺ y [ n ] = x [ n ] ∗ h [ n ] = ∑ k = − ∞ ∞ x [ k ] h [ n − k ] y(t) = \int_{-\infty}^{\infty} x(\tau) h(t - \tau) \, d\tau \quad \Longleftrightarrow \quad y[n] = x[n] * h[n] = \sum_{k=-\infty}^{\infty} x[k] h[n - k] y ( t ) = ∫ − ∞ ∞ ​ x ( τ ) h ( t − τ ) d τ ⟺ y [ n ] = x [ n ] ∗ h [ n ] = ∑ k = − ∞ ∞ ​ x [ k ] h [ n − k ]

The Convolution Theorem dictates that time-domain convolution is equivalent to point-by-point multiplication in the frequency domain: F { x [ n ] ∗ h [ n ] } = X ( f ) ⋅ H ( f ) \mathcal{F}\{x[n] * h[n]\} = X(f) \cdot H(f) F { x [ n ] ∗ h [ n ]} = X ( f ) ⋅ H ( f ) Convolving a digitized RF signal with an impulse response h [ n ] h[n] h [ n ] shapes the spectrum by multiplying by H ( f ) H(f) H ( f ) , attenuating out-of-band noise while preserving passband signals.

Step-by-Step Graphical Convolution

Evaluating discrete convolution follows five consecutive operations:

Change of Variable: Express both sequences in terms of dummy summation index k k k , yielding x [ k ] x[k] x [ k ] and h [ k ] h[k] h [ k ] .

Fold (Flip): Time-reverse the impulse response about the origin ( k = 0 k = 0 k = 0 ) to form h [ − k ] h[-k] h [ − k ] .

Shift (Translate): Slide the flipped sequence along the k k k -axis by displacement n n n to form h [ n − k ] h[n - k] h [ n − k ] .

Multiply: Compute the point-by-point product of overlapping samples x [ k ] ⋅ h [ n − k ] x[k] \cdot h[n - k] x [ k ] ⋅ h [ n − k ] .

Sum (Accumulate): Sum all products to obtain output sample y [ n ] y[n] y [ n ] . Increment n n n and repeat. Graphical Representation of Discrete Convolution: y[n] = Σ x[k] h[n-k]

  • Step 1: Express sequences in dummy index k: x[k], h[k]
  • Step 2: Fold (flip) impulse response: h[k] -> h[-k]
  • Step 3: Shift h[-k] by index n: h[-k] -> h[n-k]

Steps 4 & 5: Multiply overlapping samples and Sum products to compute y[n]

At n = 1:

x[k]: ... x[0] x[1] x[2] ...

* *

h[1-k]: ... h[1] h[0] 0 ...

  • | |
  • Products: x[0]h[1] + x[1]h[0] ===> y[1] = Σ x[k] h[1-k]
  • DFT and FFT: Time Samples to Frequency Bins

The discrete Fourier transform (DFT) represents N N N samples by N N N complex frequency-bin values: X [ k ] = ∑ n = 0 N − 1 x [ n ] e − j 2 π k n / N . X[k]=\sum_{n=0}^{N-1}x[n]e^{-j2\pi kn/N}. X [ k ] = n = 0 ∑ N − 1 ​ x [ n ] e − j 2 πkn / N .

Each bin describes amplitude and phase at f k = k f s / N f_k=kf_s/N f k ​ = k f s ​ / N , with bin spacing Δ f = f s / N \Delta f=f_s/N Δ f = f s ​ / N . Bins above the positive Nyquist range represent negative frequencies for a real sampled waveform. An FFT is an efficient algorithm for the same DFT, not a different transform. The inverse transform reconstructs the sample sequence from its complex bins.

For N = 4 N=4 N = 4 , f s = 8 kS/s f_s=8\text{ kS/s} f s ​ = 8 kS/s and x = [ 1 , 0 , − 1 , 0 ] x=[1,0,-1,0] x = [ 1 , 0 , − 1 , 0 ] : Time samples x[n] DFT magnitude |X[k]|

  • +1 * 2 * *
  • 0 +---*---+---*--> n 0 *---+---*---+--> k
  • 1 * 0 1 2 3
  • 0 1 2 3

The result is X = [ 0 , 2 , 0 , 2 ] X=[0,2,0,2] X = [ 0 , 2 , 0 , 2 ] . Bins 1 and 3 correspond to +2 kHz and −2 kHz: the two-sided representation of the sampled cosine. The forward-transform convention above gives magnitudes 2; dividing by N N N gives 0.5 in each conjugate bin. Real FFT displays may use other stated normalisations. A finite record that does not contain whole cycles spreads energy between bins; windowing reduces sidelobes at the cost of a wider main lobe.

  • Worked Engineering Calculations
  • Example 1: DDS Tuning Word, Resolution, and Nyquist Image

Problem: A DDS synthesiser uses a 32-bit phase accumulator ( N = 32 N = 32 N = 32 ) clocked at f clk = 125.000 MHz f_{\text{clk}} = 125.000\text{ MHz} f clk ​ = 125.000 MHz . Calculate the frequency resolution ( Δ f \Delta f Δ f ), the Tuning Word ( M M M ) for f out = 14.150000 MHz f_{\text{out}} = 14.150000\text{ MHz} f out ​ = 14.150000 MHz , and the primary Nyquist alias image.

Solution:

Resolution: Δ f = f clk 2 N = 125 × 10 6 Hz 2 32 ≈ 0.02910 Hz \Delta f = \frac{f_{\text{clk}}}{2^N} = \frac{125 \times 10^6\text{ Hz}}{2^{32}} \approx 0.02910\text{ Hz} Δ f = 2 N f clk ​ ​ = 2 32 125 × 1 0 6 Hz ​ ≈ 0.02910 Hz .

Tuning Word ( M M M ): M = round ( 14.150 × 10 6 × 2 32 125 × 10 6 ) = 486 , 190 , 298 M = \text{round}\left( \frac{14.150 \times 10^6 \times 2^{32}}{125 \times 10^6} \right) = 486,190,298 M = round ( 125 × 1 0 6 14.150 × 1 0 6 × 2 32 ​ ) = 486 , 190 , 298

Nyquist Image: f image = f clk − f out = 125.000 MHz − 14.150 MHz = 110.850 MHz f_{\text{image}} = f_{\text{clk}} - f_{\text{out}} = 125.000\text{ MHz} - 14.150\text{ MHz} = 110.850\text{ MHz} f image ​ = f clk ​ − f out ​ = 125.000 MHz − 14.150 MHz = 110.850 MHz , readily attenuated by an analog low-pass reconstruction filter.

Example 2: Discrete Convolution Sequence Evaluation

Problem: An input sequence x [ n ] = { 2 , 3 , 1 } x[n] = \{2, 3, 1\} x [ n ] = { 2 , 3 , 1 } ( n = 0 , 1 , 2 n = 0, 1, 2 n = 0 , 1 , 2 ) passes through an FIR filter with impulse response h [ n ] = { 0.5 , 0.25 } h[n] = \{0.5, 0.25\} h [ n ] = { 0.5 , 0.25 } ( n = 0 , 1 n = 0, 1 n = 0 , 1 ). Compute the output sequence y [ n ] = x [ n ] ∗ h [ n ] y[n] = x[n] * h[n] y [ n ] = x [ n ] ∗ h [ n ] using the flip, shift, multiply, sum method.

Solution: Total output length is L = 3 + 2 − 1 = 4 L = 3 + 2 - 1 = 4 L = 3 + 2 − 1 = 4 samples ( n = 0 , 1 , 2 , 3 n = 0, 1, 2, 3 n = 0 , 1 , 2 , 3 ):

n = 0 n = 0 n = 0 : y [ 0 ] = x [ 0 ] h [ 0 ] = 2 × 0.5 = 1.0 y[0] = x[0]h[0] = 2 \times 0.5 = 1.0 y [ 0 ] = x [ 0 ] h [ 0 ] = 2 × 0.5 = 1.0

n = 1 n = 1 n = 1 : y [ 1 ] = x [ 0 ] h [ 1 ] + x [ 1 ] h [ 0 ] = ( 2 × 0.25 ) + ( 3 × 0.5 ) = 0.5 + 1.5 = 2.0 y[1] = x[0]h[1] + x[1]h[0] = (2 \times 0.25) + (3 \times 0.5) = 0.5 + 1.5 = 2.0 y [ 1 ] = x [ 0 ] h [ 1 ] + x [ 1 ] h [ 0 ] = ( 2 × 0.25 ) + ( 3 × 0.5 ) = 0.5 + 1.5 = 2.0

n = 2 n = 2 n = 2 : y [ 2 ] = x [ 1 ] h [ 1 ] + x [ 2 ] h [ 0 ] = ( 3 × 0.25 ) + ( 1 × 0.5 ) = 0.75 + 0.5 = 1.25 y[2] = x[1]h[1] + x[2]h[0] = (3 \times 0.25) + (1 \times 0.5) = 0.75 + 0.5 = 1.25 y [ 2 ] = x [ 1 ] h [ 1 ] + x [ 2 ] h [ 0 ] = ( 3 × 0.25 ) + ( 1 × 0.5 ) = 0.75 + 0.5 = 1.25

n = 3 n = 3 n = 3 : y [ 3 ] = x [ 2 ] h [ 1 ] = 1 × 0.25 = 0.25 y[3] = x[2]h[1] = 1 \times 0.25 = 0.25 y [ 3 ] = x [ 2 ] h [ 1 ] = 1 × 0.25 = 0.25 Output sequence: y [ n ] = { 1.0 , 2.0 , 1.25 , 0.25 } y[n] = \{1.0, 2.0, 1.25, 0.25\} y [ n ] = { 1.0 , 2.0 , 1.25 , 0.25 } .

Example 3: IIR Filter Difference Equation and Stability Check

Problem: A first-order recursive filter has difference equation y [ n ] = 0.4 x [ n ] + 0.75 y [ n − 1 ] y[n] = 0.4 x[n] + 0.75 y[n-1] y [ n ] = 0.4 x [ n ] + 0.75 y [ n − 1 ] . Determine its transfer function H ( z ) H(z) H ( z ) , pole location, stability, and steady-state DC gain.

Solution:

Transfer Function: Taking the z z z -transform yields Y ( z ) = 0.4 X ( z ) + 0.75 z − 1 Y ( z ) Y(z) = 0.4 X(z) + 0.75 z^{-1} Y(z) Y ( z ) = 0.4 X ( z ) + 0.75 z − 1 Y ( z ) : H ( z ) = Y ( z ) X ( z ) = 0.4 1 − 0.75 z − 1 H(z) = \frac{Y(z)}{X(z)} = \frac{0.4}{1 - 0.75 z^{-1}} H ( z ) = X ( z ) Y ( z ) ​ = 1 − 0.75 z − 1 0.4 ​

Pole and Stability: The single pole is at z p = 0.75 z_p = 0.75 z p ​ = 0.75 . Because ∣ z p ∣ = 0.75 < 1 |z_p| = 0.75 < 1 ∣ z p ​ ∣ = 0.75 < 1 , the pole lies strictly inside the unit circle, confirming bounded-input bounded-output (BIBO) stability.

DC Gain: Setting z = 1 z = 1 z = 1 : H ( 1 ) = 0.4 1 − 0.75 = 0.4 0.25 = 1.60 H(1) = \frac{0.4}{1 - 0.75} = \frac{0.4}{0.25} = 1.60 H ( 1 ) = 1 − 0.75 0.4 ​ = 0.25 0.4 ​ = 1.60