image-20260616221239668

Poddar, Ajay & Rohde, Ulrich & Apte, Anisha. (2013). How Low Can They Go?: Oscillator Phase Noise Model, Theoretical, Experimental Validation, and Phase Noise Measurements. Microwave Magazine, IEEE. [http://time.kinali.ch/rohde/noise/how_low_can_they_go-2013-poddar_rohde_apte.pdf]

F. L. Traversa, M. Bonnin and F. Bonani, "The Complex World of Oscillator Noise: Modern Approaches to Oscillator (Phase and Amplitude) Noise Analysis," in IEEE Microwave Magazine, vol. 22, no. 7, pp. 24-32, July 2021 [https://sci-hub.ru/10.1109/MMM.2021.3069535]

Phase Noise Definition

image-20250104080553842

Eq. (3.25) is widely adopted by industry and academia

image-20250104080619943

using the narrow angle assumption, the two definitions above are equivalent

If the narrow angle condition is not satisfied, however, the two definitions differ


Sam Palermo, ECEN620: Network Theory Broadband Circuit Design Fall 2025, Lecture 7: Voltage-Controlled Oscillators[https://people.engr.tamu.edu/spalermo/ecen620/lecture07_ee620_vcos.pdf]

image-20260609234730501

Phase Noise Profile

Power Spectral Density of Brownian Motion despite non-stationary [https://dsp.stackexchange.com/a/75043/59253]

white noise\(1/f^2\) Phase Noise Profile

image-20250104084510063

image-20250104084814395

image-20250104085222610

image-20250104084925644

image-20250104085722649


image-20250601101355166

Sudhakar Pamarti. CICC 2020 ES2-2: Basics of Closed- and Open-Loop Fractional Frequency Synthesis [https://youtu.be/t1TY-D95CY8]



flicker noise\(1/f^3\) Phase Noise Profile \[ S_{\phi n} = \frac{K}{f}\left(\frac{K_{VCO}}{2\pi f}\right)^2 \propto \frac{1}{f^3} \]


image-20250104092711462

[https://dsp.stackexchange.com/a/75152/59253]

Free-running Oscillator

image-20250103224818171

Note that \(f_{min}\) is related to the observation time. The longer we observe the device under test, the smaller \(f_{min}\) must be

image-20250524081737793


image-20250104111025626


Ali Sheikholeslami ISSCC 2008 T5: Basics of Chip-to-Chip and Backplane Signaling

image-20250524082246710


image-20250606204607565

B. Casper and F. O'Mahony, "Clocking Analysis, Implementation and Measurement Techniques for High-Speed Data Links-A Tutorial," in IEEE Transactions on Circuits and Systems I. [https://people.engr.tamu.edu/spalermo/ecen689/clocking_analysis_hs_links_casper_tcas1_2009.pdf]

Leeson's model — LTI

M.H. Perrott, Short Course On Phase-Locked Loops and Their Applications Day 2, AM Lecture Basic Building Blocks Voltage-Controlled Oscillators [https://www.cppsim.com/PLL_Lectures/day2_am.pdf]

—, 6.976 High Speed Communication Circuits and Systems Lecture 12 Noise in Voltage Controlled Oscillators [https://ocw.mit.edu/courses/6-976-high-speed-communication-circuits-and-systems-spring-2003/ceb3d539691d5393a29af71ae98afb62_lec12.pdf]

Leeson's model is outcome of linearized VCO noise analysis

image-20260614183453498

image-20260614183309639

Assuming voltage noise tone \((\omega_0+\omega_m)\) and \((\omega_0-\omega_m)\) are independent and symmetric

two_offset_folding_into_pm_sidebands


Leeson's limitations

image-20251122144811362


image-20260702211009442

1/f noise Upconversion & Thermal noise Upconversion

Hajimiri's ISF— LTV in Time Domain

A. Hajimiri and T. H. Lee, "A general theory of phase noise in electrical oscillators," in IEEE Journal of Solid-State Circuits, vol. 33, no. 2, pp. 179-194, Feb. 1998 [paper], [slides]

—, RFIC 2024 Technical Lecture: Noise in Oscillators from Understanding to Design

Thomas H. Lee. Linearity, Time-Variation, Phase Modulation and Oscillator Phase Noise [https://class.ece.iastate.edu/djchen/ee507/PhaseNoiseTutorialLee.pdf]

Aditya Varma Muppala, [https://adityamuppala.github.io/assets/Notes_YouTube/Oscillators_ISF_model.pdf]

image-20260613113055683

image-20260621160607012

image-20260623012755556

The peak magnitude of the ISF, \[ \Gamma_{\max}=\max_\theta |\Gamma(\theta)|, \] can be greater than 1, equal to 1, or less than 1.

A value \(\Gamma>1\) therefore does not mean "more than 100%." It simply means that the oscillator has relatively high phase sensitivity at that particular phase.

image-20260621110835891

image-20260716002214469

\(\psi(t)\) is literally the instantaneous frequency deviation. Check the dimensions: \(i(t)/q_{max}\) has units of A/C = 1/s, and \(\Gamma\) is dimensionless, so \(\psi(t) = \Gamma(\omega_0 t)\,i(t)/q_{max}\) is in rad/s. The diagram is saying \(d\phi/dt = \psi(t)\), i.e. \(\phi(t) = \int_{-\infty}^{t}\psi(\tau)d\tau\). An ideal integrator has transfer function \(1/j\Delta\omega\), so in power spectra: \[ S_\phi(\Delta\omega) = \frac{S_\psi(\Delta\omega)}{\Delta\omega^2} \] That single block is the origin of every \(1/\Delta\omega^2\) factor in phase noise theory — including the \((\omega_0/2Q\Delta\omega)^2\) term in Leeson's equation

Pure sinusoidal voltage

image-20260622231558562

image-20260623014318589

White-noise Folding

image-20260623011047045

Suppose a low frequency sinusoidal perturbation current \(i(t) = I_m \cos[(m\omega_0 +\Delta \omega)t]\),

\[\begin{align} \phi(t) &= \frac{1}{q_\text{max}}\left[\frac{C_0}{2}\int_{-\infty}^t I_m\cos((m\omega_0 +\Delta \omega)\tau)d\tau + \sum_{n=1}^\infty C_n\int_{-\infty}^t I_m\cos((m\omega_0 +\Delta \omega)\tau)\cos(n\omega_0\tau)d\tau\right] \\ &= \frac{I_m}{q_\text{max}}\left[\frac{C_0}{2}\int_{-\infty}^t \cos((m\omega_0 +\Delta \omega)\tau)d\tau + \sum_{n=1}^\infty C_n\int_{-\infty}^t \frac{\cos((m\omega_0 + \Delta \omega+ n\omega_0)\tau)+ \cos((m\omega_0+\Delta \omega - n\omega_0)\tau)}{2}d\tau\right] \end{align}\]

If \(m=0\) \[ \phi(t) \approx \frac{I_0C_0}{2q_\text{max}\Delta \omega}\sin(\Delta\omega t) \] If \(m\neq 0\) and \(m=n\) \[ \phi(t) \approx \frac{I_mC_m}{2q_\text{max}\Delta \omega}\sin(\Delta\omega t) \]

When performing the phase noise computation integral, there will be a negligible contribution from all terms, other than \(n=m\)

image-20260623011353874

apply equation (18) derived from sinusoidal to white noise

image-20260623011536856

image-20260621101558719


Corrections to "A General Theory of Phase Noise in Electrical Oscillators"

A. Hajimiri and T. H. Lee, "Corrections to "A General Theory of Phase Noise in Electrical Oscillators"," in IEEE Journal of Solid-State Circuits, vol. 33, no. 6, pp. 928-928, June 1998 [https://sci-hub.se/10.1109/4.678662]

L. Lu, Z. Tang, P. Andreani, A. Mazzanti and A. Hajimiri, "Comments on “Comments on “A General Theory of Phase Noise in Electrical Oscillators””," in IEEE Journal of Solid-State Circuits, vol. 43, no. 9, pp. 2170-2170, Sept. 2008 [https://sci-hub.se/10.1109/JSSC.2008.2005028]

Noise power around the frequency \(\color{blue}n\omega_0 + \Delta\omega\) causes two equal sidebands at \(\omega_0 \pm \Delta\omega\). However, the noise power at \(\color{blue}n\omega_0 - \Delta\omega\) has a similar effect as mentioned in the paper. Therefore, twice the power of noise at \(n\omega_0 + \Delta\omega\) should be taken into account

image-20260623010902374

image-20260623010700154

Given \(i(t) = I_m \cos[(m\omega_0 - \Delta \omega)t]\) and \(m \ge 1\)

\[\begin{align} \phi(t) &= \frac{1}{q_\text{max}}\left[\frac{C_0}{2}\int_{-\infty}^t I_m\cos((m\omega_0 -\Delta \omega)\tau)d\tau + \sum_{n=1}^\infty C_n\int_{-\infty}^t I_m\cos((m\omega_0 -\Delta \omega)\tau)\cos(n\omega_0\tau)d\tau\right] \\ &= \frac{I_m}{q_\text{max}}\left[\frac{C_0}{2}\int_{-\infty}^t \cos((m\omega_0 -\Delta \omega)\tau)d\tau + \sum_{n=1}^\infty C_n\int_{-\infty}^t \frac{\cos((m\omega_0 - \Delta \omega+ n\omega_0)\tau)+ \cos((m\omega_0-\Delta \omega - n\omega_0)\tau)}{2}d\tau\right] \end{align}\]

If \(m\ge 1\) and \(m=n\) \[ \phi(t) \approx \frac{I_mC_m}{2q_\text{max}\Delta \omega}\sin(\Delta\omega t) \] That is

\(m = 0\) \(m\gt 0\) & \(m\omega_0+\Delta \omega\) \(m\gt 0\) & \(m\omega_0-\Delta \omega\)
\(\phi(t)\) \(\frac{I_0C_0}{2q_\text{max}\Delta \omega}\sin(\Delta\omega t)\) \(\frac{I_mC_m}{2q_\text{max}\Delta \omega}\sin(\Delta\omega t)\) \(\frac{I_mC_m}{2q_\text{max}\Delta \omega}\sin(\Delta\omega t)\)
\(P_{SBC}(\Delta \omega)\) \(10\log(\frac{I_0^2C_0^2}{16q_\text{max}^2\Delta \omega^2})\) \(10\log(\frac{I_m^2C_m^2}{16q_\text{max}^2\Delta \omega^2})\) \(10\log(\frac{I_m^2C_m^2}{16q_\text{max}^2\Delta \omega^2})\)

\[\begin{align} \mathcal{L}\{\Delta \omega\} &= 10\log\left(\frac{I_0^2C_0^2}{16q_\text{max}^2\Delta \omega^2} + 2\frac{I_m^2C_m^2}{16q_\text{max}^2\Delta \omega^2}\right) = 10\log\left(\frac{\overline{i_n^2/\Delta f}\cdot \frac{C_0^2}{2} }{4q_\text{max}^2\Delta \omega^2} + \frac{\overline{i_n^2/\Delta f}\cdot\sum_{m=1}^\infty C_m^2 }{4q_\text{max}^2\Delta \omega^2}\right) \\ &= 10\log \frac{\overline{i_n^2/\Delta f}(C_0^2/2+\sum_{m=1}^\infty C_m^2)}{4q_\text{max}^2\Delta \omega^2} = 10\log \frac{\overline{i_n^2/\Delta f}\cdot \Gamma_\text{rms}^2}{2q_\text{max}^2\Delta \omega^2} \end{align}\]



[pdf]

image-20260616235441690

image-20260621105213052

image-20260617004658323

1/f-noise Upconversion

image-20260623020547145

image-20260617004812519

image-20260617005703943


Suppose \(c_0\neq 0\), corresponding phase noise in response to injected noise \(i_n(t)\) is equal to:

\[ \phi_{n,c_0} = \int_{-\infty}^t c_0 i_n(\tau) d\tau \qquad \boxed{S_{\phi n,c_0}(f) = \frac{c_0^2}{\omega^2}S_i(f)= \frac{\mathcal{\Gamma}_\text{dc}^2}{\omega^2}S_i(f)} \]

alternative derivation

Michael Perrott August 12, 2008, Short Course On Phase-Locked Loops and Their Applications Day 2, AM Lecture Basic Building Blocks Voltage-Controlled Oscillators [https://www.cppsim.com/PLL_Lectures/day2_am.pdf]

image-20260624205523543

White Noise Input

image-20260624210533972

1/f Noise in Input Current

image-20260624210650690

Current Noise Modulation

image-20260624211311029

image-20260624211359445

another alternative derivation

image-20260627184837586

image-20260627185121907

another_isf.drawio \[ S_{\phi,USB} = \frac{S_n^{''}}{q_\text{max}^2\Delta\omega^2}\left(a_0^2+\sum_{k\neq0}a_k^2\right)=\frac{S_n^{''}}{q_\text{max}^2\Delta\omega^2}\left(\frac{c_0^2}{4}+\sum_{k=1}^\infty \frac{c_k^2}{2}\right)=\frac{S_n^{'}}{4q_\text{max}^2\Delta\omega^2}\left(\frac{c_0^2}{2}+\sum_{k=1}^\infty c_k^2\right) \] where \(S_n^{''}\) is two sided PSD, \(S_n^{}\) is one sided PSD

Diff. Pair Noise with ISF

image-20260621114354471

only half of this current is differentially injected in the tank at the zero-crossing

half_noise_diffpair.drawio

Given \(\Gamma_{MOS}\) shown as above slide \[ F_{rms,MOS}^2 = \frac{1/4\cdot T_\text{w}}{T_0/2} = \frac{T_\text{w}}{2T_0} \]

diff_pair_isf_20260623.PNG


image-20260624201443189

image-20260624201510173



P. Andreani, X. Wang, "On the Phase-Noise and Phase-Error Performances of Multiphase LC CMOS VCOs," IEEE Journal of Solid-State Circuits, vol. 39, pp. 1883-1893, Nov. 2004. [https://backend.orbit.dtu.dk/ws/files/4109919/Wang.pdf]

P. Andreani, X. Wang, L. Vandi, A. Frad, "A study of phase noise in Colpitts and LC-tank CMOS oscillators," IEEE Journal of Solid-State Circuits, vol. 40, pp. 1107-1118, May 2005. [https://backend.orbit.dtu.dk/ws/files/3976825/Andreani.pdf]

A. Bevilacqua, P. Andreani, "An Analysis of 1/f Noise to Phase Noise Conversion in CMOS Harmonic Oscillators," IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 59, no. 5, pp. 938-945, May 2012 [https://sci-hub.jp/10.1109/TCSI.2012.2190564]

For Class-B with an Ideal Current Source

  • noise factor is \(\boxed{1+\gamma_n}\)
  • \(-g_m\) transistors (M1,2) do not contribute to \(1/f\) noise upconversion

image-20260702212831279

class_b_flicker_isf_cancellation

Note the contrast with thermal noise: white noise is uncorrelated between the two crossings, so the two kicks don't cancel — their variances add. That's why the same commutation mechanism gives you the full \(\gamma_n\) term in \(F = 1+\gamma_n\) for the \(1/f^2\) region, yet contributes nothing in \(1/f^3\)

Tail-Current Noise Conversion with the ISF

A. Hajimiri and T. H. Lee, "Design issues in CMOS differential LC oscillators," in IEEE Journal of Solid-State Circuits, vol. 34, no. 5, pp. 717-724, May 1999. [paper]

T. H. Lee, Linearity, Time-Variation, Phase Modulation and Oscillator Phase Noise. [slides]

K. Gunnam and M. VahidFar, eds., Selected Topics in RF, Analog and Mixed Signal Circuits and Systems, 1st ed. River Publishers, 2017.

image-20260805221347730

image-20260805221944438

The differential pair commutates twice per oscillation cycle. After half a cycle, the two sides exchange roles, but the common tail node returns to the same state. Therefore, both the tail voltage and the tail-current ISF have half-period symmetry: \[ v_\text{tail}\left(t+\frac{T_0}{2}\right)=v_\text{tail}(t), \qquad \Gamma_\text{tail}(\theta+\pi)=\Gamma_\text{tail}(\theta). \] It follows that the tail ISF can have a DC component but only even harmonics of \(\omega_0\): \[ \Gamma_\text{tail}(\theta) =\sum_{k=-\infty}^{\infty}c_{2k}e^{j2k\theta} \approx c_0+c_2e^{j2\theta}+c_{-2}e^{-j2\theta}, \] where the approximation retains the DC and dominant second-harmonic terms.

Tail-current noise first produces an instantaneous frequency perturbation, which is then integrated into phase: \[ \dot{\phi}_\text{tail}(t) =\frac{\Gamma_\text{tail}(\omega_0t)i_\text{n,tail}(t)}{q_\text{max}}, \qquad \boxed{\phi_\text{tail}(t) =\frac{1}{q_\text{max}}\int_{-\infty}^{t} \Gamma_\text{tail}(\omega_0\tau)i_\text{n,tail}(\tau)\,d\tau.} \]

Multiplication by the periodic ISF acts as a mixer. For stationary tail-current noise, using a two-sided PSD convention, the phase-noise PSD at an offset \(\Omega\ll\omega_0\) is \[ S_{\phi,\text{tail}}(\Omega) =\frac{1}{q_\text{max}^2\Omega^2} \sum_{k=-\infty}^{\infty}|c_{2k}|^2 S_{i,\text{tail}}(\Omega-2k\omega_0). \] Thus, \(c_0\) converts low-frequency noise directly to close-in phase noise, while \(c_{\pm2}\) downconvert noise near \(2\omega_0\pm\Omega\) to the same offset \(\Omega\). Noise near \(\omega_0\) makes no first-order contribution because the odd Fourier coefficients vanish.

In the DC-plus-second-harmonic approximation, only low-frequency noise and noise near \(2\omega_0\) create close-in phase noise.

More generally, a nonsinusoidal tail ISF can also fold noise near \(4\omega_0,6\omega_0,\ldots\); low-frequency conversion vanishes when the DC coefficient \(c_0\) is zero.

image-20260805222648254

Closed-Form Formula for the ISF

image-20260718105439247If the state variables are node voltages, write \(\Delta \vec X = \sum_i \Delta v_i\,\hat e_i\) (with \(\Delta v_i = \Delta q_i/C_i\)) and the dot product distributes: \[ \Delta\phi = \frac{2\pi}{T}\frac{\big(\sum_i \Delta v_i \hat e_i\big)\cdot \dot{\vec X}}{\lVert\dot{\vec X}\rVert^{2}} \;=\frac{2\pi}{T}\; \sum_i\,\frac{\Delta v_i\, \dot v_i}{\lVert\dot{\vec X}\rVert^{2}} \;=\; \sum_i \Delta\phi_i, \] For second-order system, one can use the normalized waveform and its derivative as the state variables \[ \Gamma_{1}(x)=\frac{f'(x)}{f^{2}(x)+f'^{2}(x)} \qquad \Gamma_{2}(x)=\frac{f''(x)}{f'^{2}(x)+f''^{2}(x)} \] In the case of an ideal sinusoidal oscillator \(f=\cos(x)\) \[ \Gamma_{1}(x)=-\sin(x) \qquad \Gamma_{2}(x)=-\cos(x) \] A finite charge impulse into the node cannot make the inductor current jump (\(v\) stays bounded, so \(i_L=\frac{1}{L}\int v\,dt\) is continuous) — current component of the perturbation is exactly zero. That's physics of the input, not an approximation: \(\Delta\vec X = (\Delta v,\,0)\) exactly, so \(\Gamma_2\) gets multiplied by zero

Total phase noise sums over physical sources, each weighted by its own ISF

  • If every noise source in the circuit injects current into nodes — transistor channel noise, resistor noise, the usual on-chip situation — then the \(\Gamma_1\) family is the whole story with no approximation
  • \(\Gamma_2\) enters only when a source physically acts as a series voltage on the inductor (flux injection), such as the coil's series resistance

image-20260718115933857

quietly assumes the normal component contributes zero phase shift, i.e., that surfaces of equal phase (isochrons) cross the limit cycle orthogonally

Real oscillators violate this to varying degrees (amplitude-to-phase conversion), which is why the paper ranks direct impulse-injection simulation as the most accurate


The dot product and norm in (31)–(33) mean different things in different coordinates, so the same physical oscillator run through (33) in two different coordinate systems yields two different ISFs — and only one coordinate choice yields the paper's intended answer

Consider the ideal parallel LC network — pure sinusoid wave

Suppose a current pulse with area \(q\) suddenly changes the charge across the capacitor, its voltage changes by \(\Delta v_c=\Delta q/C\)

phase_kick_decomposition_radial_tangential

Decompose the horizontal kick \(\Delta\vec r=(\Delta x,0)\) and \(\Delta x=\Delta v_C/A_0\), with tangential direction \(\hat t=(-\sin\theta,\cos\theta)\) and radial direction \(\hat r=(\cos\theta,\sin\theta)\) \[ \Delta \phi = \arctan\left(\frac{\Delta\vec r\cdot \hat t}{1 + \Delta\vec r\cdot \hat r}\right) = \arctan\left(\frac{-\Delta x \sin \theta}{1 + \Delta x \cos \theta}\right)\approx -\frac{\Delta v_C}{A_0} \sin(\omega_0 \tau) \]

image-20260613191539886

Therefore, the ISF of an ideal parallel LC resonator can be expressed as \(\boxed{\Gamma(\omega \tau)=-\sin(\omega_0 \tau)}\), which is independent of peak voltage value \(A_0\)


C. Calculation of ISF Based on the First Derivative

image-20260624205015362

additive voltage error

A fixed \(\Delta V\) at a crossing shifts the crossing time by \(\Delta t = \Delta V/\dot v\), so \(\Delta\phi = \omega_0\Delta V/\dot v\). Express this against the normalized injection \(\Delta\phi = \Gamma\cdot\Delta V/V_{\max}\) and solve: \[ \Gamma_{\text{crossing}} = \frac{\omega_0 V_{\max}}{\dot v} = \frac{1}{f'} \] Now take eq. (37) at the mid-transition, where \(f'' = 0\) (inflection point): \[ \Gamma = \frac{f'}{f'^2 + f''^2}\;\Big|_{f''=0} = \frac{f'}{f'^2} = \frac{1}{f'} \]

\[ \boxed{ \text{steeper transition} \quad\Longrightarrow\quad \text{smaller ISF peak} } \] with \(\Gamma = \sin x\), at crossing \(\sin x =1\), which is derivative of edge \[ \Delta \phi = \Gamma \frac{\Delta q}{q_\text{max}} = \sin x\cdot \frac{\Delta q}{C\cdot A}= \sin x\cdot \frac{\Delta q}{C\cdot A\sin x} \]

Effective ISF

cyclostationary noise sources

Cyclostationary noise can be viewed as stationary noise, \(i_{n0}(t)\), multiplied by a periodic envelope, \(\alpha(\omega_0 t)\).

Effective ISFISF multiplied with Noise Modulating Function (NMF)

image-20260617010019682

image-20260617010125436

For Colpitts Oscillator, \(\Gamma_\text{eff}(x)\) is different from \(\Gamma(x)\), however \(\Gamma_\text{eff}(x)\) and \(\Gamma(x)\) are almost identical for ring oscillator

thermal noise with NMF

image-20260720230732764

source-specific ISF + its NMF

flicker noise with effective non-normalized ISF

Y. Hu, T. Siriburanon and R. B. Staszewski, "A Low-Flicker-Noise 30-GHz Class-F23 Oscillator in 28-nm CMOS Using Implicit Resonance and Explicit Common-Mode Return Path," in IEEE Journal of Solid-State Circuits, vol. 53, no. 7, pp. 1977-1987, July 2018 [https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8345650]

—, "Oscillator Flicker Phase Noise: A Tutorial," in IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 68, no. 2, pp. 538-544, Feb. 2021 [paper] [slides]

—, "Intuitive Understanding of Flicker Noise Reduction via Narrowing of Conduction Angle in Voltage-Biased Oscillators," in IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 66, no. 12, pp. 1962-1966, Dec. 2019 [https://sci-hub.jp/10.1109/TCSII.2019.2896483]

image-20260807204616765

image-20260807214139295

image-20260807213853180

image-20260807213716397


With the paper’s implicit \(1\text{-Hz}\) noise bandwidth, Eq. (3) \[ v_{1/f}(t) = \sqrt{2}\,V_{1/f,\mathrm{rms}} \cos(\Delta\omega t+\gamma) \] represents one narrowband sinusoidal noise component.

Here: \[ V_{1/f,\mathrm{rms}} = \sqrt{S_{v,1/f}(\Delta f)\cdot 1\,\mathrm{Hz}} \] is the RMS voltage amplitude of that component. Therefore, strictly within Eq. (3), \[ [V_{1/f,\mathrm{rms}}]=\mathrm V. \] Because the bandwidth is implicitly \(1\,\mathrm{Hz}\), its numerical value equals the amplitude spectral density expressed in \(\mathrm{V}/\sqrt{\mathrm{Hz}}\): \[ V_{1/f,\mathrm{rms}}[\mathrm V] \overset{B=1\,\mathrm{Hz}}{=} \sqrt{S_{v,1/f}} \left[\frac{\mathrm V}{\sqrt{\mathrm{Hz}}}\right] \sqrt{1\,\mathrm{Hz}}. \] Also, more precisely:

  • \(\Delta\omega t+\gamma\) is the phase of the sinusoidal component.
  • \(\cos(\Delta\omega t+\gamma)\) is the dimensionless sinusoidal waveform.
  • \(\gamma\) is the random initial phase.
  • \(\sqrt{2}V_{1/f,\mathrm{rms}}\) is the peak amplitude.

Indeed, \[ \operatorname{rms} \left\{ \sqrt{2}V_{1/f,\mathrm{rms}} \cos(\Delta\omega t+\gamma) \right\} = V_{1/f,\mathrm{rms}}. \] Therefore, the same interpretation applies to Eq. (4): \[ i_{1/f,\mathrm{cyclo}}(t) = \sqrt{2}I_{1/f,\mathrm{rms}}(t) \cos(\Delta\omega t+\gamma). \] Under the implicit \(1\text{-Hz}\) bandwidth, \[ [I_{1/f,\mathrm{rms}}(t)]=\mathrm A, \] From Eq. (4), \[ i_{1/f,\mathrm{cyclo}}(t) = \sqrt{2}\,I_{1/f,\mathrm{rms}}(t) \cos(\Delta\omega t+\gamma). \] Substitute this into the phase perturbation integral: \[ \begin{aligned} \phi(t) &= \int_{-\infty}^{t} h_{\mathrm{DS}}(\tau) i_{1/f,\mathrm{cyclo}}(\tau)\,d\tau \\ &= \sqrt{2} \int_{-\infty}^{t} h_{\mathrm{DS}}(\tau) I_{1/f,\mathrm{rms}}(\tau) \cos(\Delta\omega\tau+\gamma)\,d\tau. \end{aligned} \] Define the periodically varying effective ISF as \[ \color{blue}\boxed{h_{\mathrm{eff}}(t) \equiv h_{\mathrm{DS}}(t)I_{1/f,\mathrm{rms}}(t)} \] Therefore, \[ \phi(t) = \sqrt{2} \int_{-\infty}^{t} h_{\mathrm{eff}}(\tau) \cos(\Delta\omega\tau+\gamma)\,d\tau. \] Since \(h_{\mathrm{eff}}(t)\) is periodic with period \(T=2\pi/\omega_0\), write \[ h_{\mathrm{eff}}(t) = h_{\mathrm{eff,dc}} + \sum_{k=1}^{\infty} H_k\cos(k\omega_0t+\psi_k), \] where \[ h_{\mathrm{eff,dc}} = \frac{1}{T} \int_0^T h_{\mathrm{eff}}(t)\,dt = \frac{1}{T} \int_0^T h_{\mathrm{DS}}(t) I_{1/f,\mathrm{rms}}(t)\,dt. \] This is Eq. (7).

Substitution gives \[ \begin{aligned} \phi(t) ={}& \sqrt{2}h_{\mathrm{eff,dc}} \int^t\cos(\Delta\omega\tau+\gamma)\,d\tau \\ &+ \sqrt{2}\sum_{k=1}^{\infty}H_k \int^t \cos(k\omega_0\tau+\psi_k) \cos(\Delta\omega\tau+\gamma)\,d\tau. \end{aligned} \] The first term is \[ \sqrt{2}h_{\mathrm{eff,dc}} \int^t\cos(\Delta\omega\tau+\gamma)\,d\tau = \frac{\sqrt{2}h_{\mathrm{eff,dc}}}{\Delta\omega} \sin(\Delta\omega t+\gamma). \] For the harmonic terms, use \[ \cos A\cos B = \frac{1}{2}\left[\cos(A+B)+\cos(A-B)\right]. \] Thus, the exact harmonic contribution is \[ \begin{aligned} \phi_k(t) = \frac{\sqrt{2}H_k}{2} \Bigg[ & \frac{ \sin\!\left[(k\omega_0+\Delta\omega)t+\psi_k+\gamma\right] }{ k\omega_0+\Delta\omega } \\ +& \frac{ \sin\!\left[(k\omega_0-\Delta\omega)t+\psi_k-\gamma\right] }{ k\omega_0-\Delta\omega } \Bigg]. \end{aligned} \] These terms lie near \(k\omega_0\pm\Delta\omega\), whereas the DC term produces a slowly varying phase component directly at \(\Delta\omega\).

Because \[ \Delta\omega\ll\omega_0, \] the slow component is also much larger after integration: \[ \frac{1}{\Delta\omega} \gg \frac{1}{k\omega_0\pm\Delta\omega}. \] Therefore, keeping only the dominant low-frequency phase term, \[ \color{blue}\boxed{ \phi(t) \approx \frac{\sqrt{2}h_{\mathrm{eff,dc}}}{\Delta\omega} \sin(\Delta\omega t+\gamma) } \] The essential mechanism is \[ \underbrace{h_{\mathrm{DS}}(t)}_{\text{periodic ISF}} \, \underbrace{I_{1/f,\mathrm{rms}}(t)}_{\text{periodic noise amplitude}} \longrightarrow \underbrace{h_{\mathrm{eff,dc}}}_{\text{nonzero average}}, \]


M. Shahmohammadi, M. Babaie and R. B. Staszewski, "A 1/f Noise Upconversion Reduction Technique for Voltage-Biased RF CMOS Oscillators," in IEEE Journal of Solid-State Circuits, vol. 51, no. 11, pp. 2610-2624, Nov. 2016 [https://pure.tudelft.nl/ws/portalfiles/portal/30880387/07571191.pdf]

image-20260720234322600

Murphy's Model — LTV in Frequency Domain

C. Samori, A. L. Lacaita, F. Villa and F. Zappa, "Spectrum folding and phase noise in LC tuned oscillators," in IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, vol. 45, no. 7, pp. 781-790, July 1998 [https://sci-hub.ru/10.1109/82.700925]

D. Murphy, J. J. Rael and A. A. Abidi, "Phase Noise in LC Oscillators: A Phasor-Based Analysis of a General Result and of Loaded Q ," in IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 57, no. 6, pp. 1187-1203, June 2010 [https://sci-hub.ru/10.1109/TCSI.2009.2030110]

The differential pair plays two distinct roles. Toward its own noise it acts as a sampling gate — each transistor contributes only within the short conduction windows at the zero crossings — and the resulting injection is almost purely phase-modulating.

Toward the tail noise it acts as a single-balanced mixer, commutating the upstream current with a square wave and folding it as a single sideband that splits equally into AM and PM

Diff. Pair Noise

For diff. pair noise, the diff. pair is its own noise gate

image-20260615005115044

half of the noise current of each generator reaches the tank, while the remaining half circulates within the transistor

image-20260615005234730

A reference pulse train centered at \(t=0\) would have plain positive coefficients (\(\tfrac{T_w}{T_0}\), with \(\operatorname{sinc} \approx 1\)). \[ c_n = \frac{1}{2}\cdot \frac{T_w}{T_0/2}\operatorname{sinc}\left(\frac{nT_w}{T_0/2}\right)=\frac{T_w}{T_0}\operatorname{sinc}\left(\frac{2nT_w}{T_0}\right) \] The real injection sits at \(t=T_0/4\), and since the pulse-train period is \(P=T_0/2\), that offset is exactly \(P/2\) — a half-period shift. Every coefficient therefore picks up \((-1)^m\)\(e^{j2m\omega_0\cdot T_0/4}=e^{jm\pi}\) \[ c_{2m} = \underbrace{(-1)^m}_{\text{position}}\, \underbrace{\frac{T_w}{T_0}}_{\text{area / period}}\, \underbrace{\operatorname{sinc}\!\left(\frac{2mT_w}{T_0}\right)}_{\to\,1 \text{ as } T_w \ll T_0} \] image-20260615005921381

Consequently, excess noise arises solely from the components at \(\omega_0\pm \omega_m\), since all other spectral components lie outside the tank bandwidth and are therefore suppressed by the resonator's frequency-selective filtering

image-20260620203920911

With Cyclostationary Noise (Modulated Noise) [https://raytroop.github.io/2024/04/27/noise/#cyclostationary-noise-modulated-noise]

For one MOS, Two-Sided PSD is \[ S_O = S_I \cdot \mathcal{D}\cdot \mathcal{h}^2 = 2kT\gamma g_m\cdot \frac{2T_W}{T_0}\cdot\frac{1}{4} = \frac{T_W}{2T_0}\cdot 2kT\gamma g_m \] yield One-Sided PSD of one MOS \[ S_O' = \textcolor{blue}{\frac{T_W}{2T_0}}\cdot 4kT\gamma g_m \] image-20260620204007657

The single-tone analysis establishes that the differential-pair current is injected as almost pure phase noise, while summing the white-noise power over all harmonics of the gating function (\(\overline{H^2}=T_W/2T_0\)) sets its magnitude; together these yield the differential-pair contribution to the oscillator phase noise.


phase noise is independent of the transconductance of the transistors

img

Tail Noise

For the tail noise, the diff. pair is a mixer

image-20260620171318943 \[ V_{AM} = \tfrac{1}{2}\big(C_+ + \overline{C}_-\big) = \tfrac{1}{2}\Big(\tfrac{c_1^* i}{2} + \tfrac{c_3^* i}{2}\Big)\qquad V_{PM} = \tfrac{1}{2}\big(C_+ - \overline{C}_-\big) = \tfrac{1}{2}\Big(\tfrac{c_1^* i}{2} - \tfrac{c_3^* i}{2}\Big) \] \(V_{AM}\approx V_{PM}\) for a square wave \(|c_1|=3|c_3|\) — modulated tail noise is divided into AM and phase noise almost equally \[ S_{I,PN} = S_{nI,T} \cdot \mathcal{D}\cdot \mathcal{h}^2 \cdot \frac{1}{2} = S_{nI,T} \cdot 1 \cdot \frac{1}{4}\cdot \frac{1}{2} = \boxed{\frac{1}{8}\cdot S_{nI,T}} \] The commutation folds tail noise as a (near) single sideband, which is equivalent to equal AM and PM — and only the PM half counts toward phase noise

Noise around \(\boxed{2\omega_0 \pm\omega_m}\) dominate phase noise due to \(|c_1|, |c_3| \gg |c_{2m+1}| \space\space\space\space \forall m>1\)

image-20260620234423406


E. Hegazi, H. Sjoland and A. Abidi, "A filtering technique to lower oscillator phase noise," 2001 IEEE International Solid-State Circuits Conference. Digest of Technical Papers. ISSCC (Cat. No.01CH37177), San Francisco, CA, USA, 2001 [paper, slides]

Peter Kinget, ISSCC 2010 short course, Transistor-Level Design of Critical PLL Circuits

image-20260711204714462

image-20260805205218513

In the first-order, noise around DC (flicker) is upconverted as a pair of correlated, symmetric sidebands around the carrier — which is pure AM

flicker_upconversion_spectrum


J. J. Rael and A. A. Abidi, "Physical processes of phase noise in differential LC oscillators," IEEE Custom Integrated Circuits Conference (CICC), 2000 [https://people.engr.tamu.edu/spalermo/ecen620/physical_processes_pn_diff_lc_osc_rael_cicc_2000.pdf]

image-20260702220509880

practical outcome once second-order conversion effects are included

  • flicker near DC → AM/bias modulation → converted to FM → 1/f3 PN (the purple arrow in its spectrum)
  • while thermal noise at 2fosc → direct PN → 1/f2 PN (the blue arrow)

Demir's Model — NLTV

A. Demir, A. Mehrotra and J. Roychowdhury, "Phase noise in oscillators: a unifying theory and numerical methods for characterization," in IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol. 47, no. 5, pp. 655-674, May 2000 [https://sci-hub.jp/10.1109/81.847872]

A. Demir and A. Sangiovanni-Vincentelli, Analysis and Simulation of Noise in Nonlinear Electronic Circuits and Systems, vol. 425. Boston, MA, USA: Kluwer Academic Publishers, 1998

A. Mehrotra and A. Sangiovanni-Vincentelli, Noise Analysis of Radio Frequency Circuits, 1st ed. New York, NY, USA: Springer, 2004

Demir's theory is essentially Floquet theory applied to the limit cycle of an autonomous oscillator, and the PPV is one specific Floquet vector

image-20251122143914081

image-20250920101142887

PPV (Perturbation Projection Vector)

A. Demir and J. Roychowdhury, "A reliable and efficient procedure for oscillator PPV computation, with phase noise macromodeling applications," in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 22, no. 2, pp. 188-197, Feb. 2003 [https://sci-hub.se/10.1109/TCAD.2002.806599]

Helene Thibieroz, Customer Support CIC. Using Spectre RF Noise-Aware PLL Methodology to Predict PLL Behavior Accurately [https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=3056e59ea76165373f90152f915a829d25dabebc]

Aditya Varma Muppala. Perturbation Projection Vector (PPV) Theory | Oscillators 11 | MMIC 16 [youtu.be, notes]

S. Levantino and P. Maffezzoni, "Computing the Perturbation Projection Vector of Oscillators via Frequency Domain Analysis," in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 31, no. 10, pp. 1499-1507, Oct. 2012 [https://sci-hub.se/10.1109/TCAD.2012.2194493]

Limit Cycles

[https://adityamuppala.github.io/assets/Notes_YouTube/MMIC_Limit_Cycles.pdf]

Nonlinear Dynamics

image-20250622202023590

image-20250920101927173

Lorentzian spectrum

image-20240720134811859

We typically use the two spectra, \(S_{\phi n}(f)\) and \(S_{out}(f)\), interchangeably, but we must resolve these inconsistencies. voltage spectrum is called Lorentzian spectrum


The periodic signal \(x(t)\) can be expanded in Fourier series as:

image-20240720141514040

Assume that the signal is subject to excess phase noise, which is modeled by adding a time-dependent noise component \(\alpha(t)\). The noisy signal can be written \(x(t+\alpha(t))\), the added excess phase \(\phi(t)= \frac{\alpha(t)}{\omega_0}\)

image-20250103211650043

The autocorrelation of the noisy signal is by definition:

image-20240720141525576

The autocorrelation averaged over time results in:

image-20240720141659415

By taking the Fourier transform of the autocorrelation, the spectrum of the signal \(x(t + \alpha(t))\)​ can be expressed as

image-20240720141813256

It is also interesting to note how the integral in Equation 9.80 around each harmonic is equal to the power of the harmonic itself \(|X_n|^2\)

The integral \(S_x(f)\) around harmonic is \[\begin{align} P_{x,n} &= \int_{f=-\infty}^{\infty} |X_n|^2\frac{\omega_0^2n^2c}{\frac{1}{4}\omega_0^4n^4c^2+(\omega +n\omega_0)^2}df = |X_n|^2\int_{\Delta f=-\infty}^{\infty}\frac{2\beta}{\beta^2+(2\pi\cdot\Delta f)^2}d\Delta f \\ &= |X_n|^2\frac{1}{\pi}\arctan(\frac{2\pi \Delta f}{\beta})|_{-\infty}^{\infty} = |X_n|^2 \end{align}\]

The phase noise does not affect the total power in the signal, it only affects its distribution

  • Without phase noise, \(S_v(f)\) is a series of impulse functions at the harmonics of \(f_o\).
  • With phase noise, the impulse functions spread, becoming fatter and shorter but retaining the same total power

image-20250626213351673

[https://community.cadence.com/cadence_technology_forums/f/rf-design/51484/comparing-transient-noise-pnoise-and-pnoise-with-lorentian-approximation-of-a-ring-oscillator/1382911]


image-20250815232359572

image-20250815234653864

Razavi's PN

Additive Noise to PN

\(n_I(t)\) and \(n_Q(t)\) have the same PSD and are uncorrelated

image-20260628111202330

image-20260628111723352

image-20260628113608943

Tail Thermal Noise

image-20260801094552320

low-frequency content:

image-20260801094204572

around \(\omega_0\):

no phase noise is produced

image-20260801094304755

around \(2\omega_0\):

\(\frac{2}{\pi}[n_I(t)\cos2\omega_0 t - n_Q(t)\sin2\omega_0 t]\cdot \color{red}\cos\omega_0 t\) produce most phase noise

\(\frac{2}{\textcolor{green}{3}\pi}[n_I(t)\cos2\omega_0 t - n_Q(t)\sin2\omega_0 t]\cdot \color{red}\cos3\omega_0 t\) produce phase noise, but can be negligible — \(10\log(1+\frac{1}{3^2})\approx +0.46\, \text{dB}\)

Tail Flicker Noise

image-20260801102320489

Abidi & Hooman's PN

A. A. Abidi and D. Murphy, "How to Design a Differential CMOS LC Oscillator," in IEEE Open Journal of the Solid-State Circuits Society, vol. 5, pp. 45-59, 2025 [https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=10818782]

A. Mirzaei and A. A. Abidi, "The Spectrum of a Noisy Free-Running Oscillator Explained by Random Frequency Pulling," in IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 57, no. 3, pp. 642-653, March 2010 [https://sci-hub.jp/10.1109/TCSI.2009.2024970]

J. J. Rael and A. A. Abidi, "Physical processes of phase noise in differential LC oscillators," IEEE Custom Integrated Circuits Conference (CICC), 2000 [https://people.engr.tamu.edu/spalermo/ecen620/physical_processes_pn_diff_lc_osc_rael_cicc_2000.pdf]

image-20260725231729074

\[ V_{PM}\cos \omega_m t \overset{\text{power}}{\longrightarrow} \frac{S_{Vpm}}{2} = \frac{1}{2}(2kTR + 2kTR) \] quadrature noise → geometric tilt \(\phi,\, \Phi\) (bounded) → frequency shift \(f \propto \theta\) → accumulated phase \(\phi = \int f\,dt,\, \Theta\). Me


image-20260726111128525

Noise Passing through a Nonlinearity

image-20260726112432265

image-20260726112649814

Bank's General Result

J. Bank, "A harmonic-oscillator design methodology based on describing functions," Ph.D. dissertation, Dept. Signals Syst., Sch. Elect. Eng., Chalmers Univ. Techn., Chalmers, Sweden, 2006. [https://publications.lib.chalmers.se/records/fulltext/17376.pdf]

A. Mazzanti and A. Bevilacqua, "On the Phase Noise Performance of Transformer-Based CMOS Differential-Pair Harmonic Oscillators," in IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 62, no. 9, pp. 2334-2341, Sept. 2015 [https://sci-hub.jp/10.1109/TCSI.2015.2451915]

image-20260726154549762

image-20260726153846807

image-20260726154648915

For the oscillation condition \(\overline{g_m}R_p=1\), the total noise-current power spectral density (PSD) is \[ \overline{i_n^2} = \overline{i_R^2} + \overline{i_{gnr}^2} = \frac{4kT}{R_p} + 4kT\gamma\overline{g_m} = \frac{4kT}{R_p}\left(1+\gamma\overline{g_m}R_p\right) = \frac{4kT}{R_p}(1+\gamma). \]

More generally, if \(K\overline{g_m}R_p=1\), then \(\overline{g_m}R_p=1/K\), and the PSD becomes \[ \overline{i_n^2} = \frac{4kT}{R_p}\left(1+\frac{\gamma}{K}\right). \]

Two-Port Oscillators

image-20260715223627399

flicker noise upconversion

Y. Hu, T. Siriburanon and R. B. Staszewski, "Oscillator Flicker Phase Noise: A Tutorial," in IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 68, no. 2, pp. 538-544, Feb. 2021 [paper] [slides]

—, "Intuitive Understanding of Flicker Noise Reduction via Narrowing of Conduction Angle in Voltage-Biased Oscillators," in IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 66, no. 12, pp. 1962-1966, Dec. 2019 [https://sci-hub.jp/10.1109/TCSII.2019.2896483]

E. G. Ioannidis, C. G. Theodorou, T. A. Karatsori, S. Haendler, C. A. Dimitriadis and G. Ghibaudo, "Drain-Current Flicker Noise Modeling in nMOSFETs From a 14-nm FDSOI Technology," in IEEE Transactions on Electron Devices, vol. 62, no. 5, pp. 1574-1579, May 2015 [https://sci-hub.jp/10.1109/TED.2015.2411678]

Two different mechanisms: \[ \boxed{\text{tail-transistor }1/f\text{ noise}} \qquad\text{vs.}\qquad \boxed{\text{cross-coupled-pair }1/f\text{ noise}} \] They are not upconverted through exactly the same physical path

Tail-current-source flicker noise

J. J. Rael and A. A. Abidi, "Physical processes of phase noise in differential LC oscillators," Proceedings of the IEEE 2000 Custom Integrated Circuits Conference (Cat. No.00CH37044), Orlando, FL, USA, 2000 [https://people.engr.tamu.edu/spalermo/ecen620/physical_processes_pn_diff_lc_osc_rael_cicc_2000.pdf]

A. Bevilacqua and P. Andreani, "An Analysis of 1/f Noise to Phase Noise Conversion in CMOS Harmonic Oscillators," in IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 59, no. 5, pp. 938-945, May 2012 [https://sci-hub.jp/10.1109/TCSI.2012.2190564]

\[ v_{n,\mathrm{tail}}^{1/f} \rightarrow \Delta I_T \rightarrow \text{AM and harmonic-content modulation} \rightarrow \Delta\omega_0 \rightarrow \phi(t). \]

They explicitly associate tail-current flicker noise with the sensitivity of oscillation frequency to tail current, \[ K_{I_T\rightarrow\omega} = \frac{\partial\omega_{\mathrm{osc}}}{\partial I_T}. \] Thus, \[ S_{\phi}(\Delta f) \approx \frac{ \left| \partial\omega_{\mathrm{osc}}/\partial I_T \right|^2 S_{I_T}(\Delta f)} {(2\pi\Delta f)^2}. \] For \(S_{I_T}\propto1/\Delta f\), this produces \(S_\phi\propto1/\Delta f^3\).

Cross-coupled-pair flicker noise

Y. Hu, T. Siriburanon and R. B. Staszewski, "A Low-Flicker-Noise 30-GHz Class-F23 Oscillator in 28-nm CMOS Using Implicit Resonance and Explicit Common-Mode Return Path," in IEEE Journal of Solid-State Circuits, vol. 53, no. 7, pp. 1977-1987, July 2018 [https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8345650]

F. Pepe, A. Bonfanti, S. Levantino, C. Samori and A. L. Lacaita, "Analysis and Minimization of Flicker Noise Up-Conversion in Voltage-Biased Oscillators," in IEEE Transactions on Microwave Theory and Techniques, vol. 61, no. 6, pp. 2382-2394, June 2013 [https://sci-hub.jp/10.1109/TMTT.2013.2259257]

P. Andreani and A. Fard, "More on the 1/f2 Phase Noise Performance of CMOS Differential-Pair LC-Tank Oscillators," in IEEE Journal of Solid-State Circuits, vol. 41, no. 12, pp. 2703-2712, Dec. 2006 [https://backend.orbit.dtu.dk/ws/files/3913656/Andreani.pdf]

Its central model is \[ i_{n,1/f}(t) = \alpha(t)n_{1/f}(t), \] where \(\alpha(t)\) represents the cyclostationary modulation of MOS flicker noise. The relevant phase-conversion function is then \[ \Gamma_{\mathrm{eff}}(t) = \Gamma(t)\alpha(t). \] The low-frequency noise produces first-order phase accumulation when \[ \Gamma_{\mathrm{eff,DC}} = \frac{1}{T_0} \int_0^{T_0} \Gamma_{\mathrm{eff}}(t)\,dt \neq 0. \]

Tail Capacitance Effect

image-20260801161111253

image-20260805221750191


Flicker noise of the tail transistor \[ M_{\mathrm{tail}}\text{ flicker} \rightarrow \Delta I_T \rightarrow \Delta A,\Delta H_n \rightarrow \Delta\omega_0. \]

Tail capacitance affecting pair flicker \[ C_T \rightarrow \text{asymmetric }i_{D1}(t) \rightarrow \Gamma_{\mathrm{eff,DC}}\neq0 \rightarrow M_{1,2}\text{ flicker upconversion}. \]

The tail capacitor is not itself a flicker-noise generator. It modifies the periodic operating point and breaks the cancellation of the cross-coupled pair’s flicker-noise-induced phase perturbations

Chembiyan's Phase Perturbation

Chembiyan T, "Brownian Motion And The Oscillator Phase Noise" [link]

—, "Jitter and Phase Noise in Oscillators" [link]

—, "Jitter and Phase Noise in Phase Locked Loops" [link]

—, "PLLs and reference spurs" [link]

w/ stationary noise with Gaussian PDF

image-20241227233228376

image-20241228022311313


If keep \(\phi_{rms}\) in \(R_x(\tau)\), i.e. \[ R_x(\tau)=\frac{A^2}{2}e^{-\phi_{rms}^2}\cos(2\pi f_0 \tau)e^{R_\phi(\tau)}\approx \frac{A^2}{2}e^{-\phi_{rms}^2}\cos(2\pi f_0 \tau)(1+R_\phi(\tau)) \] The PSD of the signal is \[ S_x(f) = \mathcal{F} \{ R_x(\tau) \} = \frac{P_c}{2}e^{-\phi_{rms}^2}\left[S_\phi(f+f_0)+S_\phi(f-f_0)\right] + \frac{P_c}{2}e^{-\phi_{rms}^2}\left[\delta(f+f_0)+\delta(f-f_0)\right] \] ❗❗above Eq isn't consistent with stationary white noise process - the following section

w/ stationary white noise

image-20241207091104944

Assuming that the delay line is noiseless

image-20241207100921644


image-20241207091457850

Expanding the cosine function we get \[\begin{align} R_y(t,\tau) &= \frac{A^2}{2}\left\{\cos(2\pi f_0\tau)E[\cos(\phi(t)-\phi(t-\tau))] - \sin(2\pi f_0\tau)E[\sin(\phi(t)-\phi(t-\tau))]\right\} \\ &+ \frac{A^2}{2}\left\{\cos(4\pi f_0(t+\tau/2-T_D))E[\cos(\phi(t)+\phi(t-\tau))] - \sin(4\pi f_0(t+\tau/2-T_D))E[\sin(\phi(t)+\phi(t-\tau))] \right\} \end{align}\]

where, both the process \(\phi(t)-\phi(t-\tau)\) and \(\phi(t)+\phi(t-\tau)\) are independent of time \(t\), i.e. \(E[\cos(\phi(t)+\phi(t-\tau))] = m_{\cos+}(\tau)\), \(E[\cos(\phi(t)-\phi(t-\tau))] = m_{\cos-}(\tau)\), \(E[\sin(\phi(t)+\phi(t-\tau))] = m_{\sin+}(\tau)\) and \(E[\sin(\phi(t)-\phi(t-\tau))] = m_{\sin-}(\tau)\)

we obtain \[\begin{align} R_y(t,\tau) &= \frac{A^2}{2}\left\{\cos(2\pi f_0\tau)m_{\cos-}(\tau) - \sin(2\pi f_0\tau)m_{\sin-}(\tau)\right\} \\ &+ \frac{A^2}{2}\left\{\cos(4\pi f_0(t+\tau/2-T_D))m_{\cos+}(\tau) - \sin(4\pi f_0(t+\tau/2-T_D))m_{\sin+}(\tau) \right\} \end{align}\]

The second term in the above expression is periodic in \(t\) and to estimate its PSD, we compute the time-averaged autocorrelation function \[ R_y(\tau) = \frac{A^2}{2}\left\{\cos(2\pi f_0\tau)m_{\cos-}(\tau) - \sin(2\pi f_0\tau)m_{\sin-}(\tau)\right\} \] image-20241207095906575

After nontrivial derivation

image-20241207104018395

image-20241227205459845


image-20241207103912086

w/ Weiner process

image-20241207103414365

image-20241207105127885

The phase process \(\phi(t)\) is also gaussian but with an increasing variance which grows linearly with time \(t\)

image-20241207110524419

\[\begin{align} R_y(t,\tau) &= \frac{A^2}{2}\left\{\cos(2\pi f_0\tau)E[\cos(\phi(t)-\phi(t-\tau))] - \sin(2\pi f_0\tau)E[\sin(\phi(t)-\phi(t-\tau))]\right\} \\ &+ \frac{A^2}{2}\left\{\cos(4\pi f_0(t+\tau/2-T_D)E[\cos(\phi(t)+\phi(t-\tau))] - \sin(4\pi f_0(t+\tau/2-T_D)E[\sin(\phi(t)+\phi(t-\tau))] \right\} \end{align}\]

The spectrum of \(y(t)\) is determined by the asymptotic behavior of \(R_y(t,\tau)\) as \(t\to \infty\)

❗❗ \(\lim_{t\to\infty}R_y(t,\tau)\) rather than time-averaged autocorrelation function of cyclostationary process, ref. Demir's paper

We define \(\zeta(t, \tau)=\phi(t)+\phi(t-\tau) = \phi(t)-\phi(t-\tau) + 2\phi(t-\tau)\), the expected value of \(\zeta(t,\tau)\) is 0, the variance is \(\sigma_{\zeta}^2=(k\sigma)^2(\tau + 4(t-\tau))=(k\sigma)^2(4t-3\tau)\) \[ E[\cos(\zeta(t,\tau))]=\frac{1}{\sqrt{2\pi \sigma_{\zeta}^2}}\int_{-\infty}^{\infty}e^{-\zeta^2/2\sigma_{\zeta}^2}\cos(\zeta)d\zeta = e^{-\sigma_{\zeta}^2/2}=e^{-(k\sigma)^2(4t-\tau)} \] i.e., \(\lim _{t\to \infty} E[\cos(\zeta(t,\tau))] = \lim_{t\to \infty}e^{-(k\sigma)^2(4t-\tau)} = 0\)

For \(E[\sin(\zeta(t,\tau))]\), we have \[ E[\sin(\zeta(t,\tau))] = \frac{1}{\sqrt{2\pi \sigma_{\zeta}^2}}\int_{-\infty}^{\infty}e^{-\zeta^2/2\sigma_{\zeta}^2}\sin(\zeta)d\zeta \] i.e., \(E[\sin(\zeta(t,\tau))]\) is odd function, therefore \(E[\sin(\zeta(t,\tau))]=0\)

Finally, we obtain

image-20241207114053083

image-20241227210018613

image-20241207114805792


image-20241207174403033

image-20241207181038749

image-20241208100556466

ISF & PPV Extraction

PPV values from pss/pnoise simulation in spectreRF [https://community.cadence.com/cadence_technology_forums/f/rf-design/35062/ppv-values-from-pss-pnoise-simulation-in-spectrerf]

ISF Function Extraction in Cadence Virtuoso [https://community.cadence.com/cadence_technology_forums/f/custom-ic-design/43969/isf-function-extraction-in-cadence-virtuoso]

ISF from Transient Analysis

David Dolt. ECEN 620 Network Theory - Broadband Circuit Design: "VCO ISF Simulation" [https://people.engr.tamu.edu/spalermo/ecen620/ISF_SIM.pdf]

an injected current impulse with charge \(\Delta q=\int i(t)\,dt\), produces the permanent phase shift \[ \Delta\phi = \Gamma(\omega_0\tau)\frac{\Delta q}{q_{\max}}. \] Therefore, \[ \Gamma(\omega_0\tau) = \Delta\phi \frac{q_{\max}}{\Delta q}. \]



image-20260712130019636 \[ \boxed{ \text{Same injected charge} \quad\Longrightarrow\quad \Delta\phi\propto\frac{\Gamma}{q_{\max}} } \] So:

  • To compare actual robustness against equal charge impulses, compare \(\Delta\phi/\Delta q\)
  • To compare the formal dimensionless ISFs, multiply each simulated phase response by its own \(q_{\max}/\Delta q\)


Aditya Varma Muppala, ISF Simulation in Cadence Using Transient Analysis | Oscillators 07 | MMIC 12 [https://youtu.be/yiMn2rCtTXY]

\[ h_{\phi}(t,{\tau}) = \frac{\Gamma(\omega_0{\tau})}{q_{\max}} u(t-\tau) \]

Therefore, \[ \boxed{ \Gamma(\omega_0{\tau}) = \frac{\Delta t}{T_0} \cdot 2\pi \cdot \frac{q_{\max}}{\Delta q} } \]

  1. \(\Delta q\) should be:
    • not too small \(\rightarrow\) numerical error
    • not too large \(\rightarrow\) nonlinearity
  2. \(\Delta t\) should be measured after the amplitude settles down (steady-state solution).
  3. The impulse should be injected after the oscillator stabilizes.
  4. The simulation step size used to measure \(\Delta t\) should be small.
  5. The transient-simulation error tolerance should be small.

Use cross function to find zero crossing when impulse is off. Set significant digits to 16 and note down the value. \[ T_{i=0} = 15.62239156\times10^{-9} = 15.622\times10^{-9} + 0.39156\times10^{-12} \]

  • Subtract it from the cross output. ADE output truncates it, so break it up into different unit scales.
  • Check that the output is approximately zero before running sweeps.

image-20260712152742440

Oscillator Injection Linearity

image-20260712175756081

time shift by sweeping current pulse delay

image-20260712172056648



Aditya Varma Muppala, Noise Modulation Function (NMF) Simulation in Cadence | Oscillators 08 | MMIC 13 [https://youtu.be/CvcLG9cSreg] [code]

source-specific ISF

For example, if MOS drain thermal noise is represented as a current source between drain and source, then the perturbation used to obtain the source-specific ISF should also be injected between those same drain and source nodes

image-20260718182429958

image-20260718182328349

NMF \(\alpha_{NMF}(t)\) shall work with the corresponding source-specific ISF/PPV

image-20260712162600802 \[ \boxed{I_n(t)=4kT\gamma \cdot \textcolor{red}{g_m(t)} = 4kT\gamma \cdot \textcolor{red}{\alpha_{NMF} (t)g_{m,0}}} \]

image-20260718115348587

ISF from PSS + Positive Sidebands of PXF

Hu, Yizhe, "Intuitive Understanding of Flicker Noise Reduction via Narrowing of Conduction Angle in Voltage-Biased Oscillators," in IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 66, no. 12, pp. 1962-1966, Dec. 2019 [https://sci-hub.ru/10.1109/TCSII.2019.2896483]

—. (2019). A Simulation Technique of Impulse Sensitivity Function (ISF) Based on Periodic Transfer Function (PXF). 10.13140/RG.2.2.32151.60323. [link]

—, "Oscillator Flicker Phase Noise: A Tutorial," in IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 68, no. 2, pp. 538-544, Feb. 2021 [paper] [slides]

Aditya Varma Muppala, Fast Simulation of ISF and PPV using PSS and PXF in Cadence | Oscillators 12 | MMIC 19 [video note code]

image-20260721001737826

image-20260721003010409

  • freqaxis=in

    PXF preserves the signed input-frequency axis. Therefore, both positive- and negative-frequency input sidebands can be used directly to extract the ISF

  • freqaxis=absin (default)

    Positive sidebands can be used directly. For negative sidebands, the PXF result corresponds to the Hermitian-symmetric positive-frequency response and must first be complex-conjugated; equivalently, retain its magnitude and reverse its phase

image-20260721074606473

image-20260721075448677


time reference between tran simulation and pss/pxf is different, that's why circshift is used.

1
2
3
ISF_Tran2 = interp1(time_Tran,-ISF_Tran{:,2},t);

plot(t/1e-9,circshift(ISF_Tran2,633),'--','LineWidth',3)

image-20260720081429910

Complex Derivation of PXF from ISF

credits to chatgpt

Using a complex exponential representation gives the same result as the cosine derivation in the slides, provided the Fourier coefficient conventions are handled consistently.

1. Test Current

Instead of

\[ i_t(t)=I_t\cos\!\left((k\omega_0+\Delta\omega)t+\gamma_k\right), \]

use the analytic signal

\[ \tilde{i}_t(t) = I_t e^{j[(k\omega_0+\Delta\omega)t+\gamma_k]}. \]

2. Complex Fourier Series of ISF

The slide defines the real ISF as

\[ h_{DS}(t) = \frac12 h_0\cos\theta_0 + \sum_{m=1}^{\infty} h_m\cos(m\omega_0t+\theta_{h,m}). \]

Expressing it as a complex Fourier series,

\[ h_{DS}(t) = \sum_{m=-\infty}^{\infty} H_m e^{jm\omega_0t}, \]

gives

\[ H_{\pm m} = \frac{h_m}{2} e^{\pm j\theta_{h,m}}. \]

Hence

\[ H_{-k} = \frac{h_k}{2} e^{-j\theta_{h,k}}. \]

3. Phase Perturbation

The phase perturbation is

\[ \phi(t) = \int h_{DS}(t)i_t(t)\,dt. \]

Substituting the Fourier series,

\[ \phi(t) = I_t \sum_m \frac{H_m} {j[(m+k)\omega_0+\Delta\omega]} e^{j[(m+k)\omega_0+\Delta\omega]t}. \]

Only the slowly varying term contributes significantly, so choose

\[ m=-k, \]

which yields

\[ \boxed{ \phi(t) = \frac{I_tH_{-k}} {j\Delta\omega} e^{j(\Delta\omega t+\gamma_k)}. } \]

4. Oscillator Voltage

Represent the oscillator voltage as

\[ V_{DS} = V_{H1} e^{j(\omega_0t+\phi(t))}. \]

Using the small-angle approximation,

The small-angle approximation remains valid even if the phase perturbation is complex, provided its magnitude is small \(|\theta| \ll 1\)

\[ e^{j\phi}\approx1+j\phi, \]

gives

\[ V_{DS} \approx V_{H1}e^{j\omega_0t} + \frac{V_{H1}I_tH_{-k}} {\Delta\omega} e^{j(\omega_0+\Delta\omega)t}. \]

Therefore,

\[ \boxed{ H_{\mathrm{PXF}} = \frac{V_{H1}}{\Delta\omega} H_{-k}. } \]

5. Relation to the Slide

The fundamental drain voltage is

\[ v_{DS}(t) = V_{h1}\cos(\omega_0t+\theta), \]

whose complex coefficient is

\[ \boxed{ V_{H1} = \frac{V_{h1}}{2} e^{j\theta}. } \]

Since

\[ H_{-k} = \frac{h_k}{2} e^{-j\theta_{h,k}}, \]

we obtain

\[ H_{\mathrm{PXF}} = \frac{V_{h1}}{2\Delta\omega} \cdot \frac{h_k}{2} e^{j(\theta-\theta_{h,k})} = \frac{V_{h1}h_k} {4\Delta\omega} e^{j(\theta-\theta_{h,k})}. \]

Thus

\[ \boxed{ |H_{\mathrm{PXF}}| = \frac{V_{h1}h_k} {4\Delta\omega} } \]

and

\[ \boxed{ \angle H_{\mathrm{PXF}} = \theta-\theta_{h,k}. } \]

These are exactly Eqs. (6) and (7) in the slide.

Conclusion

The complex-exponential derivation is algebraically simpler than the cosine derivation. The only subtlety is the Fourier-series convention:

  • Positive-frequency coefficient of a cosine: \[ H_k=\frac{h_k}{2}e^{j\theta_{h,k}}. \]

  • Fundamental voltage phasor: \[ V_{H1}=\frac{V_{h1}}{2}e^{j\theta}. \]

Accounting for these \(1/2\) factors yields the identical PXF expression derived in the slides.

PPV from PSS inbuilt solver

Aditya Varma Muppala, Fast Simulation of ISF and PPV using PSS and PXF in Cadence | Oscillators 12 | MMIC 19 [https://youtu.be/Lu6VEWEEdxo]

TODO 📅

image-20260725201359867

References

Jun Yin. ISSCC 2025 T10: mm-Wave Oscillator Design

Pietro Andreani. ISSCC 2011 T1: Integrated LC oscillators

—. ISSCC 2017 F2: Integrated Harmonic Oscillators

—. SSCS Distinguished Lecture: RF Harmonic Oscillators Integrated in Silicon Technologies [https://www.ieeetoronto.ca/wp-content/uploads/2020/06/DL-Toronto.pdf]

—. ESSCIRC 2019 Tutorials: RF Harmonic Oscillators Integrated in Silicon Technologies [https://youtu.be/k1I9nP9eEHE]

—. "Harmonic Oscillators in CMOS—A Tutorial Overview," in IEEE Open Journal of the Solid-State Circuits Society, vol. 1, pp. 2-17, 2021 [pdf]

C. Samori, ISSCC2016 T1 "Tutorial: Understanding Phase Noise in LC VCOs"

—, "Understanding Phase Noise in LC VCOs: A Key Problem in RF Integrated Circuits," in IEEE Solid-State Circuits Magazine, vol. 8, no. 4, pp. 81-91, Fall 2016 [https://sci-hub.ru/10.1109/MSSC.2016.2573979]

—, Phase Noise in LC Oscillators: From Basic Concepts to Advanced Topologies [https://www.ieeetoronto.ca/wp-content/uploads/2020/06/DL-VCO-short.pdf]

A. Hajimiri, RFIC2024 "Noise in Oscillators from Understanding to Design"

Antonio Liscidini, ESSCIRC 2019 Tutorials: Phase Noise in Wireless Applications [https://youtu.be/nGmQ0JdoSE4]

Aditya Varma Muppala. Oscillators [https://youtube.com/playlist?list=PL9Trid0A4Da2fOmYTEjhAnUkGPxyiH7H6&si]

P.E. Allen - 2003. ECE 6440 - Frequency Synthesizers: Lecture 160 – Phase Noise - II [https://pallen.ece.gatech.edu/Academic/ECE_6440/Summer_2003/L160-PhNoII(2UP).pdf]

Jaeha Kim. Lecture 8. Special Topics: Design Trade -Offs in LC -Tuned Oscillators



Lacaita, Andrea Leonardo, Salvatore Levantino, and Carlo Samori. Integrated frequency synthesizers for wireless systems. Cambridge University Press, 2007.

Darabi H. Radio Frequency Integrated Circuits and Systems. 2nd ed. Cambridge University Press; 2020.

Hegazi, Emad, Asad Abidi, and Jacob Rael. The Designer's Guide to High-purity Oscillators. [New York]: Kluwer Academic Publishers, 2005. The Designer's Guide to High-Purity Oscillators

Bae, Woorham, and Deog-Kyoon Jeong. Analysis and Design of CMOS Clocking Circuits for Low Phase Noise. Institution of Engineering and Technology, 2020.

M. Babaie, M. Shahmohammadi, R. B. Staszewski, (2019) "RF CMOS Oscillators for Modern Wireless Applications" River Publishers [https://www.riverpublishers.com/pdf/ebook/RP_E9788793609488.pdf]

  • proportional term (P) depends on the present error
  • integral term (I) depends on past errors
  • derivative term (D) depends on anticipated future errors

PID controller makes use of linear extrapolation of the measured output

PI controller does not make use of any prediction of the future state of the system

The prediction by linear extrapolation (D) can generate large undesired control signals because measurement noise is amplified, that's why D is not used widely


The Problem of "Sinusoids Running Around Loops"

The representative of Fourier transform \(\frac{1}{j\omega+j\omega_0}\) back in the time domain \(e^{-j\omega_0 t}\) is infinite extent in time

Running around a loop, chasing one's tail — these are thought pictures that only work in a discretized, time-sequenced conceptual framework that has a beginning and an end

Fix in your mind that oscillations are a type of resonance

System Type

Control of Steady-State Error to Polynomial Inputs: System Type

image-20240502232125317

control systems are assigned a type number according to the maximum degree of the input polynominal for which the steady-state error is a finite constant. i.e.

  • Type 0: Finite error to a step (position error)
  • Type 1: Finite error to a ramp (velocity error)
  • Type 2: Finite error to a parabola (acceleration error)

image-20260227020054150

If we consider tracking the reference input alone and set \(W = V = 0\)

The open-loop transfer function can be expressed as \[ T(s) = \frac{K_n(s)}{s^n} \]

where we collect all the terms except the pole (\(s\)) at eh origin into \(K_n(s)\),

The polynomial inputs, \(r(t)=\frac{t^k}{k!} u(t)\), whose transform is \[ R(s) = \frac{1}{s^{k+1}} \]

Then the equation for the error, \(R(s)-Y(s)\) is simply \[ E(s) = \frac{1}{1+T(s)}R(s) \]

Application of the Final Value Theorem to the error formula gives the result

\[\begin{align} \lim _{t\to \infty} e(t) &= e_{ss} = \lim _{s\to 0} sE(s) \\ &= \lim _{s\to 0} s\frac{1}{1+\frac{K_n(s)}{s^n}}\frac{1}{s^{k+1}} \\ &= \lim _{s\to 0} \frac{s^n}{s^n + K_n}\frac{1}{s^k} \end{align}\]

  • if \(n > k\), \(e=0\)
  • if \(n < k\), \(e\to \infty\)
  • if \(n=k\)
    • \(e_{ss} = \frac{1}{1+K_n}\) if \(n=k=0\)
    • \(e_{ss} = \frac{1}{K_n}\) if \(n=k \neq 0\)

where we define \(K_n(0) = K_n\)

rearrangement

loop-refactor.drawio

The closed loop transfer function of \(Y/X\) and \(Y_1/X_1\) are almost same, except sign

\[\begin{align} \frac{Y}{X} &= +\frac{H_1(s)H_2(s)}{1+H_1(s)H_2(s)} \\ \frac{Y_1}{X_1} &= -\frac{H_1(s)H_2(s)}{1+H_1(s)H_2(s)} \end{align}\]

loop-refactor-partion.drawio

define \(-Y_1=Y_n\), then \[ \frac{Y_n}{X_1} = \frac{H_1(s)H_2(s)}{1+H_1(s)H_2(s)} \] loop-refactor-partion-general.drawio

image-20240805231921946

Saurabh Saxena, IIT Madras. CICC2022 Clocking for Serial Links - Frequency and Jitter Requirements, Phase-Locked Loops, Clock and Data Recovery

Effect of Feedback on Noise

Feedback does not improve the noise performance of circuits.

image-20240508205903213

The input-referred noise voltage and current remain the same if the feedback network introduces no noise

derivative control

Introduction: PID Controller Design. [https://ctms.engin.umich.edu/CTMS/?example=Introduction&section=ControlPID]

Stability Criterion

Barkhausen criteria

Barkhausen criteria are necessary but not sufficient conditions for sustainable oscillations

image-20240720090654883

it simply "latches up" rather than oscillates

Nyquist Stability Criterion

Michael H. Perrott, High Speed Communication Circuits and Systems, Lecture 15 Integer-N Frequency Synthesizers[https://www.cppsim.com/CommCircuitLectures/lec15.pdf]

Zoran Gajic. Nyquist Stability Criterion [https://eceweb1.rutgers.edu/~gajic/psfiles/nyquist.pdf]

TODO 📅

image-20251122095944300

image-20251122095709631

Root-Locus Techniques

closed-loop system

image-20260426164543043

Mason's Gain Rule

Rick Lyons, Using Mason's Rule to Analyze DSP Networks [https://www.dsprelated.com/showarticle/76.php]

Mason's gain formula (MGF) is a method for finding the transfer function of a linear signal-flow graph (SFG).

TODO 📅

reference

Gene F. Franklin, J. David Powell, and Abbas Emami-Naeini. Feedback Control of Dynamic Systems, Global Edition (8th Edition). Pearson. [pdf]

Åström, K.J. & Murray, Richard. (2021). Feedback Systems: An Introduction for Scientists and Engineers Second Edition [pdf]

Dawson, Joel L. A Guide to Feedback Theory. Cambridge: Cambridge University Press, 2021. [pdf]

Yan Lu, ISSCC2021 T10: Fundamentals of Fully Integrated Voltage Regulators

Jens Anders (University of Stuttgart, DE). ESSERC2025 Circuits Insights: The Magic of Feedback in Analog Circuit Design [https://youtu.be/NyXuA6WZ8Hg]

image-20241004163356709

charge pumps are capacitive DC-DC converters. The two most common switched capacitor voltage converters are the voltage inverter and the voltage doubler circuit


image-20241014211627207


voltage doubler

image-20241019092038444

output buffer capacitor

To achieve a stable DC output voltage

Step-Wise Ramp-Up

\[ V_{in} C_p + V_{out,n-1}C_o = (V_{out,n}-V_{in})C_p + V_{out,n}C_o \]

We derive a recursive equation that describes the output voltage \(V_{out,n}\) after the \(n\)th clock cycle \[ V_{out,n} = \frac{2V_{in}C_p + V_{out,n-1}C_o}{C_p + C_o} \]

Voltage Ripple & Droop

ripple_droop.drawio

\[\begin{align} (V_t - V_h)(C_p + C_o) &= \frac{I_{load}}{2f_{sw}} \\ (V_h - V_b)C_o &= \frac{I_{load}}{2f_{sw}} \end{align}\]

we obtain \[ V_t - V_b = \frac{I_{load}}{f_{sw}C_o}\left(1 - \frac{C_p}{2(C_p + C_o)}\right) \] That is, peak-to-peak ripple \[ \Delta V_{out,p2p} \approx \frac{I_{load}}{f_{sw}C_o} \space\space\space\space \text{if}\space\space C_o \gg C_p \]

Then, with aforementioned Step-Wise Ramp-Up equation, \(V_t = \frac{2V_{in}C_p + V_bC_o}{C_p + C_o}\) \[\begin{align} V_b &= 2V_{in} - \frac{I_{load}}{f_{sw}C_p}\left(1 + \frac{C_p}{2C_o}\right) \\ V_t &= 2V_{in} - \frac{I_{load}}{f_{sw}C_p}\left(1 - \frac{C_p}{2(C_p+C_o)}\right) \end{align}\]

Therefore, average output voltage \(\overline{V}_{out}\) in steady-state is \[ \overline{V}_{out} = \frac{V_t+V_b}{2}=2V_{in} - \frac{I_{load}}{f_{sw}C_p}\left(1 + \frac{C_p^2}{4C_o(C_p+C_o)}\right) \approx 2V_{in} - \frac{I_{load}}{f_{sw}C_p} \] which results in a simple expression for the output voltage droop

\[ \Delta V_{out} = \frac{I_{load}}{f_{sw}C_p} \]

The charge pump can be modeled as a voltage source with a source resistance \(R_\text{out}\). Therefore, \(\Delta V_{out}\) can be seen as the voltage drop across \(R_\text{out}\) due to the load current:

\[ R_{out} = \frac{\Delta V_{out}}{I_{load}} = \frac{1}{f_{sw}C_p} \] image-20241015072846141

multiphase CP

multiphaeCP.drawio

\[ (V_t - V_b) (C_p + C_o) = I_{load}\Delta t \]

Therefore peak-to-peak ripple \[ \Delta V_{out,p2p} = \frac{I_{load}\Delta t}{C_p+C_o} = \frac{I_{load}\Delta t}{C_{tot}} \]

where \(C_{tot} = C_p+C_o\)

with \[ \left\{ \begin{array}{cl} V_b &= 2V_{in} - \frac{I_{load}\Delta t}{C_p} \\ V_t &= 2V_{in} - \frac{I_{load}\Delta t}{C_p} + \frac{I_{load}\Delta t}{C_p+C_o} \end{array} \right. \]

Then \[ \overline{V}_{out} = \frac{V_t+V_b}{2}=2V_{in} - \frac{I_{load}\Delta t}{C_p}\cdot \frac{C_p+2C_o}{2C_p+2C_o} \approx 2V_{in} - \frac{I_{load}\Delta t}{C_p} \] That is output voltage droop \[ \Delta V_{out} = \frac{I_{load}\Delta t}{C_p} \]

reference

Bernhard Wicht, "Design of Power Management Integrated Circuits". 2024 Wiley-IEEE Press

Breussegem, T. v., & Steyaert, M. (2013). CMOS integrated capacitive DC-DC converters. Springer

Zhang, Milin, Zhihua Wang, Jan van der Spiegel and Franco Maloberti. "Advanced Tutorial on Analog Circuit Design." (2023).

Anton Bakker, Tim Piessens., ISSCC2014 T9: Charge Pump and Capacitive DC-DC Converter Design

Wicht, B., ISSCC2020 T2: Analog Building Blocks of DC-DC Converters [https://www.nishanchettri.com/isscc-slides/2020%20ISSCC/TUTORIALS/T2Visuals.pdf]

Hoi Lee, ISSCC2018 T8: Fundamentals of Switched-Mode Power Converter Design [slides,transcript]

G. Palumbo and D. Pappalardo, "Charge Pump Circuits: An Overview on Design Strategies and Topologies," in IEEE Circuits and Systems Magazine, vol. 10, no. 1, pp. 31-45, First Quarter 2010 [pdf]

image-20241019142915175


alternative view of sampling, assuming DC value is \(A\)

sampling-c2d-d2d.drawio

  • \(x_c(t)\) and \(x_s(t)\)

    \(\overline{x_c} = A\); \(\overline{x_s}=\frac{A}{T}\): therefore \(X_s(j0) = \frac{1}{T}X_c(j0)\)

  • \(x[n]\) and \(x_d[n]\)

    \(\overline{x} = A\); \(\overline{x_d}=\frac{A}{2}\): therefore \(X_d(e^{j0}) = \frac{1}{2}X(e^{j0})\)

expander

sampling-expander.drawio

  • \(x[n]\) and \(x_e[n]\)

    \(\overline{x} = A\); \(\overline{x_e}=A\): therefore \(X_e(e^{j0}) = X(e^{j0})\)

    Fourier transform of the output of the expander is a frequency-scaled version of the Fourier transform of the input


Subsampling or Downsampling

image-20241004151215993

image-20241004151308422

image-20241004151434477

  • Eqs. (4.72)

    the superposition of an infinite set of amplitude-scaled copies of \(X_c(j\Omega)\), frequency scaled through \(\omega = \Omega T_d\) and shifted by integer multiples of \(2\pi\)

  • Eq. (4.77)

    the superposition of \(M\) amplitude-scaled copies of the periodic Fourier transform \(X (e^{j\omega})\), frequency scaled by \(M\) and shifted by integer multiples of \(2\pi\)


downsampled by a factor of \(M = 2\)

image-20241004161805974


image-20241005073349726

image-20241005073534041

Upsampling or Zero Insertion

image-20250701070658641

image-20250616212057960


Rouphael, Tony. (2009). RF and Digital Signal Processing for Software-Defined Radio. [pdf]

image-20250921001932934


image-20250616215844032

Assuming \(X(e^{j\omega_1}) = U_f(e^{j\omega_1})\) with \(\omega_1 = \Omega T_1\), upsampled by ratio \(L\), then obtain

\[ Y(e^{j\omega_2})=X(e^{j\omega_2 L}) = U_f(e^{j\omega_2 L}) \]

by EQ. (4.85), i.e. substitute \(\omega_1\) with \(\omega_2 L\), where with \(\omega_2 = \Omega T_2\) and \(T_2 L = T_1\)

Provided that \(\xi = e^{j\omega_1}\) and \(z = e^{j\omega_2}\), we have \(U_f(\xi)\) upsampled to \(U_f(z^L)\)

Interpolation filter

image-20250616214711197


image-20250611205725078

Pavan, Schreier and Temes, "Understanding Delta-Sigma Data Converters, Second Edition"


image-20250618225150839

Markus Nentwig. Polyphase filter / Farrows interpolation [https://www.dsprelated.com/showarticle/22.php]


image-20250630230658621

sampling identities

sampling-ID.drawio


downsampling identity

image-20241007085509889

image-20241007090624888


upsampling identity

image-20241007085527233

image-20241007090939701

up/down-sampling cascading

In general,

\[ \boxed{\downarrow N\;\rightarrow\;\uparrow N \neq \text{identity}} \]

while

\[ \boxed{\uparrow N\;\rightarrow\;\downarrow N = \text{identity}} \]

a useful way to remember the asymmetry:

\[ \boxed{ \uparrow N\rightarrow\downarrow N: \quad \text{insert zeros, then remove those zeros} \Rightarrow x[n] } \]

but

\[ \boxed{ \downarrow N\rightarrow\uparrow N: \quad \text{remove real samples, then insert zeros} \Rightarrow \text{information lost}. } \]

If you put an ideal anti-aliasing filter before downsampling and an ideal interpolation filter after upsampling, then for a sufficiently bandlimited signal you can reconstruct the original signal. That case is where the apparent \(N\) or \(1/N\) gain factors become especially important.

For \(y[n]=x[Nn],\) the DTFT is

\[ \boxed{ Y(e^{j\omega}) = \frac{1}{N} \sum_{k=0}^{N-1} X\left(e^{j(\omega+2\pi k)/N}\right) } \]

so the \(1/N\) appears explicitly.

But this doesn't mean downsampling has a physical gain of \(1/N\). The \(N\) compressed/shifted spectral copies are summed


assuming the downsampler keeps the samples inserted at multiples of \(N\).

For example, let \(N=2\):

\[ x[n]=[a,b,c,d,e,f,\ldots] \]

Downsample by 2:

\[ x_d[n]=[a,c,e,\ldots] \]

Then upsample by 2:

\[ y[n]=[a,0,c,0,e,0,\ldots] \]

Clearly,

\[ \boxed{y[n]\neq x[n]} \]

The information in \(b,d,f,\ldots\) was destroyed by the downsampler. Upsampling cannot reconstruct it; it only inserts zeros.

In fact, the cascade is

\[ \boxed{ y[n]= \begin{cases} x[n], & n=0,\pm N,\pm2N,\ldots\\ 0, & \text{otherwise}. \end{cases}} \]

Time domain

The cascade multiplies \(x[n]\) by an impulse train:

\[ y[n]=x[n]\,c_N[n],\qquad c_N[n]=\sum_{r=-\infty}^{\infty}\delta[n-rN] \]

The useful trick is to write that comb as a sum of complex exponentials (a DFT identity):

\[ c_N[n]=\frac{1}{N}\sum_{k=0}^{N-1}e^{j2\pi kn/N}=\frac{1}{N}\sum_{k=0}^{N-1}W_N^{-kn},\qquad W_N\triangleq e^{-j2\pi/N} \]

So the cascade is a modulation by \(N\) carriers, which is exactly where the aliasing comes from.

\(z\) domain \[ Y(z)=\sum_n x[n]c_N[n]z^{-n}=\frac{1}{N}\sum_{k=0}^{N-1}\sum_n x[n]\big(zW_N^{k}\big)^{-n} \]

\[ \boxed{\;Y(z)=\frac{1}{N}\sum_{k=0}^{N-1}X\!\left(zW_N^{k}\right)=\frac{1}{N}\sum_{k=0}^{N-1}X\!\left(z\,e^{-j2\pi k/N}\right)\;} \]

You get the same thing by composing the two stages. Decimation by \(N\):

\[ V(z)=\frac{1}{N}\sum_{k=0}^{N-1}X\!\left(z^{1/N}W_N^{k}\right) \]

Expansion by \(N\) just substitutes \(z\to z^N\):

\[ Y(z)=V(z^N)=\frac{1}{N}\sum_{k=0}^{N-1}X\!\left(zW_N^{k}\right) \]

L. Avallone, M. Mercandelli, A. Santiccioli, M. P. Kennedy, S. Levantino and C. Samori, "A Comprehensive Phase Noise Analysis of Bang-Bang Digital PLLs," in IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 68, no. 7, pp. 2775-2786, July 2021 [https://sci-hub.st/10.1109/TCSI.2021.3072344]

image-20260908233201823


↑N followed immediately by \(\downarrow N\) is identity

Start with \(x[n]\)

Upsample:

\[ x_u[n]= \begin{cases} x[n/N],&n=N k\\ 0,&\text{otherwise}. \end{cases} \]

Then downsample:

\[ y[n]=x_u[Nn] \]

Therefore

\[ \boxed{y[n]=x[n]} \]

So

\[ \boxed{ x[n]\xrightarrow{\uparrow N}\xrightarrow{\downarrow N}x[n] } \]

has total gain 1, not \(1/N\).

The frequency-domain formula confirms this. After upsampling,

\[ X_u(e^{j\omega})=X(e^{jN\omega}) \]

Then downsampling gives

\[ \begin{aligned} Y(e^{j\omega}) &= \frac1N \sum_{k=0}^{N-1} X_u\left(e^{j(\omega+2\pi k)/N}\right)\\ &= \frac1N \sum_{k=0}^{N-1} X\left(e^{jN(\omega+2\pi k)/N}\right)\\ &= \frac1N \sum_{k=0}^{N-1} X(e^{j(\omega+2\pi k)}). \end{aligned} \]

Because the DTFT is \(2\pi\)-periodic,

\[ X(e^{j(\omega+2\pi k)})=X(e^{j\omega}) \]

so

\[ Y(e^{j\omega}) = \frac1N \underbrace{\sum_{k=0}^{N-1}X(e^{j\omega})}_{N\text{ identical terms}} = \boxed{X(e^{j\omega})} \]

So the apparent \(1/N\) is exactly canceled by the \(N\) spectral copies being summed.

Polyphase Decomposition

Polyphase decomposition is a powerful technique used in digital signal processing to efficiently implement multirate systems.

image-20241020122709610

image-20241020122726153

where \(e_k[n]=h[nM+k]\)


Polyphase Implementation of Decimation Filters & Interpolation Filters

Decimation system Interpolation system
image-20241020123035001 image-20241020123043829
image-20241020123027067 image-20241020123101780
sampling identity image-20241020123345371 image-20241020123355113

LPTV Implementation

TODO 📅

The interpolation filter following an up-sampler generally is time varying and cannot be represented by a simple transfer function. The equivalent filter in a zero-order hold is an exception, perhaps unique, that can be represented with a time-invariant transfer function

Dr. Deepa Kundur, Multirate Digital Signal Processing: Part I [pdf, https://www.comm.utoronto.ca/dkundur/course/discrete-time-systems/]

ZOH interpolator

The interpolation filter following an up-sampler generally is time varying and cannot be represented by a simple transfer function. The equivalent filter in a Zero-Order Hold is an exception, perhaps unique, that can be represented with a time-invariant transfer function

image-20250627173816810

image-20250627173926092


zoh.drawio \[ F_1(z) = X(z^{LM})\frac{1-z^{-LM}}{1-z^{-1}} \]

Split the \(1:LM\) hold process into a \(1 : L\) hold followed by a \(1 : M\) hold \[ Y(\eta)=X(\eta^{L})\frac{1-\eta^{-L}}{1-\eta^{-1}} \] then \[\begin{align} F_2(z) &= Y(z^M)\cdot\frac{1-z^{-M}}{1-z^{-1}} \\ &=X(z^{LM})\frac{1-z^{-LM}}{1-z^{-M}}\cdot \frac{1-z^{-M}}{1-z^{-1}} \\ &= X(z^{LM})\frac{1-z^{-LM}}{1-z^{-1}} \end{align}\]

That is \(F_1(z)=F_2(z)\), i.e. they are equivalent


image-20241103180315919

Random Signals & Multirate Systems

Balu Santhanam, Probability Theory & Stochastic Process 2020: Random Signals & Multirate Systems [https://ece-research.unm.edu/bsanthan/ece541/rand.pdf]

Decimation by Summing

proportional path

The loop gain of a proportional path is unchanged

phug_loop.drawio

In (a), the loop gain is \(\frac{\phi_o(z)}{\phi_e(z)}\), which is \[ LG_a(z)=\frac{\phi_o(z)}{\phi_e(z)} = \frac{1}{1-z^{-1}} \]

In (b), Accumulate-And-Dump (AAD) is \(\frac{1-z^{-L}}{1-z^{-1}}\), then \(\phi_m(\eta)\) can be expressed as \[ \phi_m(\eta) = \frac{1-\eta^{-1}}{1-\eta^{-1/L}}\cdot \frac{1}{L} \] Hence \[\begin{align} \phi_o(\eta) &= \phi_m(\eta) \frac{1}{1-\eta^{-1}} \\ &= \frac{1-\eta^{-1}}{1-\eta^{-1/L}}\cdot \frac{1}{L}\cdot \frac{1}{1-\eta^{-1}} \end{align}\]

After zero-order hold process, we obtain \(\phi_f(z)\), which is \[\begin{align} \phi_f(z) &= \phi_o(z^L) \cdot \frac{1-z^{-L}}{1-z^{-1}} \\ &=\frac{1-z^{-L}}{1-z^{-1}}\cdot \frac{1}{L}\cdot \frac{1}{1-z^{-L}}\cdot \frac{1-z^{-L}}{1-z^{-1}} \end{align}\] i.e., \[ LG_b(z) = \frac{1}{1-z^{-1}}\cdot \frac{1}{L}\cdot \frac{1-z^{-L}}{1-z^{-1}} \]

When bandwidth is much less than sampling rate (data rate), \(\frac{1}{L}\cdot \frac{1-z^{-L}}{1-z^{-1}} \approx 1\)

Therefore \[ LG_b(z) \approx \frac{1}{1-z^{-1}} \]

In the end \[ LG_a(z) \approx LG_b(z) \]


Assume PD output is constant

phug_seq.drawio

integral path

integral path gain reduced by \(L\)

frug_loop.drawio

In (a), \(\phi_o(z)=\frac{1}{(1-z^{-1})^2}\), i.e. \[ LG_a(z) = \frac{1}{(1-z^{-1})^2} \]

In (b), after Accumulate-And-Dump (AAD), \(\phi(\eta)\) is \[ \phi_m(\eta) = \frac{1-\eta^{-1}}{1-\eta^{-1/L}}\cdot \frac{1}{L} \]

After frequency integrator and phase integrator \[\begin{align} \phi_o(\eta) &= \phi_m(\eta) \cdot \frac{1}{(1-\eta^{-1})^2} \\ &= \frac{1-\eta^{-1}}{1-\eta^{-1/L}}\cdot \frac{1}{L} \cdot \frac{1}{(1-\eta^{-1})^2} \end{align}\] Then \(\phi_f(z)\) is shown as below \[\begin{align} \phi_f(z) &= \phi_o(z^L)\cdot \frac{1-z^{-L}}{1-z^{-1}} \\ &= \frac{1-z^{-L}}{1-z^{-1}}\cdot \frac{1}{L}\cdot \frac{1}{(1-z^{-L})^2}\cdot \frac{1-z^{-L}}{1-z^{-1}} \\ &= \frac{1}{L} \cdot \frac{1}{(1-z^{-1})^2} \end{align}\]

That is, \[ LG_b(z) = \frac{1}{L} \cdot \frac{1}{(1-z^{-1})^2} = \frac{1}{L}\cdot LG_a(z) \]


Assume PD output is constant

frug_seq.drawio

\[ \lim_{n\to +\infty} \frac{\Delta P_1}{\Delta P_0} = \lim_{n\to +\infty}\frac{n+2L}{nL+\alpha L+\beta L^2} = \frac{1}{L} \]

Decimation by Voting

image-20241126211307012


In above screenshot

  1. \(K_D\) is just relative value
  2. frug shall not be scaled by decimator factor

proved as below

DC gain \(K_B\) of summing (boxcar filter) is decimation factor \(M\) , voting gain \(K_V\) is about \(0.54K_b=0.54M\)

  1. downsampling \(\frac{1}{M}\) and ZOH \(\frac{1-z^{-M}}{1-z^{-1}}\) can be canceled out at low frequency
  2. decimation gain: accumulator \(\frac{1-z^{-M}}{1-z^{-1}}\) replaced with linearizing gain \(K_B\) and majority voting replaced with \(K_V\)

proportional path: \[\begin{align} LG_{ph} &= K_{BB}\cdot \frac{1-z^{-M}}{1-z^{-1}}\cdot \frac{1}{M}\cdot \frac{1}{1-z^{-M}}\cdot \frac{1-z^{-M}}{1-z^{-1}} \\ &\approx K_{BB}\cdot \frac{1-z^{-M}}{1-z^{-1}}\cdot \frac{1}{1-z^{-M}} \\ &= K_{BB}\cdot K_D\cdot \frac{1}{1-z^{-M}} \end{align}\]

integral path: \[\begin{align} LG_{fr} &= K_{BB}\cdot \frac{1-z^{-M}}{1-z^{-1}}\cdot \frac{1}{M}\cdot \frac{1}{(1-z^{-M})^2}\cdot \frac{1-z^{-M}}{1-z^{-1}} \\ &\approx K_{BB}\cdot \frac{1-z^{-M}}{1-z^{-1}}\cdot \frac{1}{(1-z^{-M})^2} \\ &= K_{BB}\cdot K_D\cdot \frac{1}{(1-z^{-M})^2} \end{align}\]

Y. Xia et al., "A 10-GHz Low-Power Serial Digital Majority Voter Based on Moving Accumulative Sign Filter in a PS-/PI-Based CDR," in IEEE Transactions on Microwave Theory and Techniques, vol. 68, no. 12 [https://sci-hub.se/10.1109/TMTT.2020.3029188]

J. Liang, A. Sheikholeslami, "On-Chip Jitter Measurement and Mitigation Techniques for Clock and Data Recovery Circuits" [https://tspace.library.utoronto.ca/bitstream/1807/91138/3/Liang_Joshua_201706_PhD_thesis.pdf]

J. Liang, A. Sheikholeslami. ISSCC2017. "A 28Gbps Digital CDR with Adaptive Loop Gain for Optimum Jitter Tolerance" [slides,paper]

J. Liang, A. Sheikholeslami,, "Loop Gain Adaptation for Optimum Jitter Tolerance in Digital CDRs," in IEEE Journal of Solid-State Circuits [https://sci-hub.se/10.1109/JSSC.2018.2839038]

M. M. Khanghah, K. D. Sadeghipour, D. Kelly, C. Antony, P. Ossieur and P. D. Townsend, "A 7-Bit 7-GHz Multiphase Interpolator-Based DPC for CDR Applications," in IEEE Transactions on Circuits and Systems I: Regular Papers [https://cora.ucc.ie/bitstreams/7ae5bfaa-8dd9-45a7-8276-99676b7b6078/download]

[CDR CIRCUIT-BLOCKS: DESIGN AND VERIFICATION USING VERILOG - 2.6. DECIMATOR]

Michael H. Perrott, Tutorial on Digital Phase-Locked Loops, CICC 2009, San Jose, CA, Sept. 13, 2009 [https://www.cppsim.com/PLL_Lectures/digital_pll_cicc_tutorial_perrott.pdf]

Liu, Tao, Tiejun Li, Fangxu Lv, Bin Liang, Xuqiang Zheng, Heming Wang, Miaomiao Wu, Dechao Lu, and Feng Zhao. 2021. "Analysis and Modeling of Mueller-Muller Clock and Data Recovery Circuits" Electronics 10 [https://www.mdpi.com/2079-9292/10/16/1888/pdf?version=1628492599]

Gu, Youzhi & Feng, Xinjie & Chi, Runze & Chen, Yongzhen & Wu, Jiangfeng. (2022). Analysis of Mueller-Muller Clock and Data Recovery Circuits with a Linearized Model. 10.21203/rs.3.rs-1817774/v1. [https://assets-eu.researchsquare.com/files/rs-1817774/v1_covered.pdf?c=1664188179]

Chen, Junkun, Youzhi Gu, Xinjie Feng, Runze Chi, Jiangfeng Wu, and Yongzhen Chen. 2024. "Analysis of Mueller–Muller Clock and Data Recovery Circuits with a Linearized Model" Electronics [https://mdpi-res.com/electronics/electronics-13-04218/article_deploy/electronics-13-04218-v2.pdf?version=1730106095]

K. Yadav, P. -H. Hsieh and A. C. Carusone, "Loop Dynamics Analysis of PAM-4 Mueller–Muller Clock and Data Recovery System," in IEEE Open Journal of Circuits and Systems [https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9910561]


TODO 📅

Tristate: \(\alpha=1\)

XOR: \(\alpha=1\)

\(\frac{1}{T}\) in Divider

image-20240928004526381

image-20240928004308700

Michael H. Perrott, PLL Design Using the PLL Design Assistant Program. [https://designers-guide.org/forum/Attachments/pll_manual.pdf]


\(\frac{1}{T}\) & \(T\) come from CT-DT & DT-CT

image-20240928203714450

H. Kang et al., "A 42.7Gb/s Optical Receiver With Digital Clock and Data Recovery in 28nm CMOS," in IEEE Access, vol. 12, pp. 109900-109911, 2024 [https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10630516]

Sonntag JSSC 2006

J. L. Sonntag and J. Stonick, "A Digital Clock and Data Recovery Architecture for Multi-Gigabit/s Binary Links," in IEEE Journal of Solid-State Circuits, vol. 41, no. 8, pp. 1867-1875, Aug. 2006 [https://sci-hub.se/10.1109/JSSC.2006.875292]

—, "A digital clock and data recovery architecture for multi-gigabit/s binary links," Proceedings of the IEEE 2005 Custom Integrated Circuits Conference, 2005.. [https://sci-hub.se/10.1109/CICC.2005.1568725]

J. Stonick. ISSCC 2011 tutorials, T5: "DPLL-Based Clock and Data Recovery"

Phase transfer function

image-20241129222258061

image-20241129223706720

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
clear;
close all;
clc;


Tb = 200e-12;
Ts = Tb*8; % the decimation factor was 8
z = tf('z', Ts);

Kdpc = 1/2^9;
Kv = 8*0.54;
Kpd = 10.6;
phug = 2^-3;
frug = 2^-12;
Nel = 18;

options = bodeoptions;
options.FreqUnits = 'MHz';
options.XLim = [1e-2, 1e1];
options.YLim = [-10, 5];

L = Kpd*Kv*Kdpc/(1-z^-1)*(phug + frug/(1-z^-1))*z^-Nel;
TF = L/(1+L);
bodemag(TF,options);

hold on;
frug = 2^-11;
L = Kpd*Kv*Kdpc/(1-z^-1)*(phug + frug/(1-z^-1))*z^-Nel;
TF = L/(1+L);
bodemag(TF,options);

hold on;
frug = 2^-10;
L = Kpd*Kv*Kdpc/(1-z^-1)*(phug + frug/(1-z^-1))*z^-Nel;
TF = L/(1+L);
bodemag(TF,options);

legend('frug=2^{-12}','frug=2^{-11}', 'frug=2^{-10}', 'FontSize',10)
grid on;
title('phase transfer function', 'FontSize', 12)
xlabel('frequency', 'FontSize',10)
ylabel('frequency response', 'FontSize',10)


Full View

image-20241129223734870

Offsets in Phase Slicer

dead zone, pn always 0 whether early or late!!!

image-20260706205916894

TODO 📅

Kpd, Kb, Kv

image-20260113223907845

image-20241130162850467

  • Kpd formula: 12.467; Kpd_bb_0 12.465
  • Kpd_Kb: 49.860; Kpd_Kv 27.265
  • Kb: 4.00; Kv 2.19

That is

  1. gain of BoxCar is the decimation factor
  2. Voting across 4 inputs had a 54% reduced gain relative to boxcar filter
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
import numpy as np
from scipy.stats import norm
import itertools
from tqdm import tqdm
import matplotlib.pyplot as plt

sigmai = 0.032 #UI, input jitter
Ptrans = 0.5 # Transition density
deci_factor = 4

phase_error = np.linspace(-0.1, 0.1, 201) #UI, phase offset
pd_late = norm.cdf(phase_error/sigmai)
pd_early = 1.0 - pd_late
pd_avg = pd_late*1.0 - 1.0*pd_early

Kpd_bb = (pd_avg[1:] - pd_avg[:-1])/(phase_error[1:] - phase_error[:-1])*Ptrans
Kpd_bb_0 = np.max(Kpd_bb)

## by formula
Kpd_calc = 1.0/(sigmai*np.sqrt(2*np.pi))

print(f'Kpd formula: {Kpd_calc:.3f}; Kpd_bb_0 {Kpd_bb_0:.3f}') # Kpd formula: 12.467; Kpd_bb_0 12.465

plt.figure()
plt.plot(phase_error, pd_avg, color='r', linewidth=3)
plt.title('!! PD average output vs timing offset(UI)')
plt.grid()
plt.show()


prob = np.zeros((phase_error.shape[0],3))
prob[:,0] = pd_early*Ptrans # -1
prob[:,1] = 1.0 - Ptrans # 0
prob[:,2] = pd_late*Ptrans # 1

pd_out = np.array([-1.0,0.0,1.0])
idxs = list([[0,1,2] for _ in range(deci_factor)])
boxcar_avg = []
voting_avg = []
for i in tqdm(range(phase_error.shape[0])):
prob_i = prob[i,:]
boxcar_tmp = 0.0
voting_tmp = 0.0
for idxs_tmp in itertools.product(*idxs):
pd_list = pd_out[[idxs_tmp]]
prob_list = prob_i[[idxs_tmp]]
pd_sum = np.sum(pd_list)
pd_vote = 1.0 if pd_sum > 0.0 else -1.0 if pd_sum <0.0 else 0.0
prob_prod = np.prod(prob_list)
boxcar_tmp += pd_sum*prob_prod
voting_tmp += pd_vote*prob_prod
boxcar_avg.append(boxcar_tmp)
voting_avg.append(voting_tmp)

boxcar_avg = np.array(boxcar_avg)
voting_avg = np.array(voting_avg)

plt.figure()
plt.plot(phase_error,boxcar_avg, label='FIR BoxCar', color='r', linewidth=3)
plt.plot(phase_error,voting_avg, label='Voting', color='b', linewidth=3, linestyle='--')
plt.legend()
plt.title('!!PD+BoxCar / !!PD+Voting vs timing offset(UI)')
plt.grid()
plt.show()


Kpd_Kb = (boxcar_avg[1:] - boxcar_avg[:-1])/(phase_error[1:] - phase_error[:-1])
Kpd_Kv = (voting_avg[1:] - voting_avg[:-1])/(phase_error[1:] - phase_error[:-1])
Kpd_kb_0 = np.max(Kpd_Kb)
Kpd_kv_0 = np.max(Kpd_Kv)
print(f'Kpd_Kb: {Kpd_kb_0:.3f}; Kpd_Kv {Kpd_kv_0:.3f}') # Kpd_Kb: 49.860; Kpd_Kv 27.265

plt.figure()
plt.plot(phase_error[:-1], Kpd_Kb, color='r', linewidth=3)
plt.plot(phase_error[:-1], Kpd_Kv, color='b', linewidth=3, linestyle='--')
plt.legend(['Kpd_Kb', 'Kpd_Kv'])
plt.title('Kpd*Kb / Kpd*Kv vs timing offset(UI)')
plt.grid()
plt.show()

Kb = Kpd_kb_0 / Kpd_bb_0
Kv = Kpd_kv_0 / Kpd_bb_0
print(f'Kb: {Kb:.2f}; Kv {Kv:.2f}') # Kb: 4.00; Kv 2.19


with deci_factor = 8

1
2
3
Kpd formula: 12.467; Kpd_bb_0 12.465
Kpd_Kb: 99.719; Kpd_Kv 39.155
Kb: 8.00; Kv 3.14

with deci_factor = 16

1
2
3
Kpd formula: 12.467; Kpd_bb_0 12.465
Kpd_Kb: 199.439; Kpd_Kv 55.784
Kb: 16.00; Kv 4.48

reference

Alan V Oppenheim, Ronald W. Schafer. 2010. Discrete-Time Signal Processing, 3rd edition

R. E. Crochiere and L. R. Rabiner, "Multirate Digital Signal Processing", Prentice Hall, 1983.

John G. Proakis and Dimitris G. Manolakis, Digital Signal Processing: Principles, Algorithms, and Applications, 4th edition, 2007.

D. Sundararajan. 2024. Digital Signal Processing: An Introduction 2nd Edition

F. M. Gardner, "Phaselock Techniques", 3rd Edition, Wiley Interscience, Hoboken, NJ, 2005 [https://picture.iczhiku.com/resource/eetop/WyIgwGtkDSWGSxnm.pdf]

Rhee, W. (2020). Phase-locked frequency generation and clocking : architectures and circuits for modern wireless and wireline systems. The Institution of Engineering and Technology


Qasim Chaudhari. Sample Rate Conversion [https://wirelesspi.com/sample-rate-conversion/]

Push-Pull

TODO 📅

Rinaldo Castello, "LINEARIZATION TECHNIQUES FOR PUSH-PULL AMPLIFIERS" [https://www.ieeetoronto.ca/wp-content/uploads/2020/06/AMPLIFIERS_Stanf_Tor_2016_Last.pdf]

Rail-to-Rail Op amp

[https://mixsignal.wordpress.com/wp-content/uploads/2013/03/689-604rail2rail.pdf]

[https://toshiba.semicon-storage.com/ap-en/semiconductor/knowledge/faq/linear_opamp/what-does-rail-to-rail-mean.html]

TODO 📅

self-biased active loading

image-20251029213156015


Vishal Saxena "CMOS Comparator Design Extra Slides" [https://www.eecis.udel.edu/~vsaxena/courses/ece614/Handouts/Comparator%20Slides.pdf]

preampSong202412181018


W. Liu, P. Huang and Y. Chiu, "A 12b 22.5/45MS/s 3.0mW 0.059mm2 CMOS SAR ADC achieving over 90dB SFDR," 2010 IEEE International Solid-State Circuits Conference - (ISSCC), San Francisco, CA, USA, 2010 [https://sci-hub.se/10.1109/ISSCC.2010.5433830]

image-20250805230555464

Slewing in Folded-Cascode Op Amps

image-20240817161915989

In practice, we choose \(I_P \simeq I_{SS}\)


image-20240817162418938

image-20240817162127452


image-20240816175038971

Avoid zero current in cascodes

  • left circuit

    \(I_b \gt I_a\)

  • right circuit

    \(I_b \gt 2I_a\)

Huijsing, J. H. (2017). Operational Amplifiers: Theory and Design. (3 ed.) Springer

[https://bbs.eetop.cn/forum.php?mod=redirect&goto=findpost&ptid=995502&pid=11548528]

image-20250922233947643

Response Speed in Analog Circuits

Hyun-Sik Kim, KAIST, A-SSCC 2024 Circuit Insights: FT3 Accelerating Response Speed in Analog Circuits [link]

image-20250105085449759


image-20250105072433452

Bandwidth limitation

image-20250105072748483

image-20250105073322162

image-20250105090203938image-20250105090204188

slew rate limitation

image-20250105083039901

Assuming linear response \[ V_o(t) = 1 - e^{-\omega_T t} \]

\[ \frac{\mathrm{d}V_o}{\mathrm{d}t} = \omega_Te^{-\omega_T t} = \frac{g_m}{C_L}e^{-\omega_T t} = \frac{g_m}{I_B}\cdot \frac{I_B}{C_L}\cdot e^{-\omega_T t} \gt \frac{I_B}{C_L} \]

where \(\frac{g_m}{I_B} e^{-\omega_T t} \gt 1\) at initial response

Therefore, initial response speed is dominated by SR, rather than \(G_m\) (or bandwidth)

image-20250105090105095

MOS parasitic Rd&Rs, Cd&Cs

Decrease the parasitic R&C

priority: \(R_s \gt R_d\), \(C_s \gt C_d\)

source follower

A. Sheikholeslami, "Voltage Follower, Part III [Circuit Intuitions]," in IEEE Solid-State Circuits Magazine, vol. 15, no. 2, pp. 14-26, Spring 2023, doi: 10.1109/MSSC.2023.3269457

—, ESSCIRC2023 Circuit Insights [https://youtu.be/2xFIZM5_FPw]

—, CICC2025 Circuit Insights: From Simple to Super Source Follower [https://youtu.be/CWfMKltPIQ8]

Paul R. Gray. 2009. Analysis and Design of Analog Integrated Circuits (5th. ed.). Wiley Publishing. [pdf]

Super-source follower (SSF)

image-20240924213742877

image-20240924213845608

image-20240924213853954

Flipped Voltage Follower (FVF)

image-20240921110019881

image-20240921113630249

T&H buffer in ADC

image-20240923200147070

[https://www.linkedin.com/posts/chembiyan-t-0b34b910_flipped-voltage-follower-fvf-basics-activity-7118482840803020800-qwyX?utm_source=share&utm_medium=member_desktop]

Z. Guo et al., "A 112.5Gb/s ADC-DSP-Based PAM-4 Long-Reach Transceiver with >50dB Channel Loss in 5nm FinFET," 2022 IEEE International Solid-State Circuits Conference (ISSCC), San Francisco, CA, USA, 2022, pp. 116-118, doi: 10.1109/ISSCC42614.2022.9731650.

Differential pair

Todd Brooks, Broadcom "Input Programmable Gain Amplifier (PGA) Design for ADC Signal Conditioning" [https://classes.engr.oregonstate.edu/eecs/spring2021/ece627/Lecture%20Notes/OSU%20Classroom%20Presentaton%20042511.ppt]

virtual ground?

image-20260703224921011 \[ \color{blue}V_P = V_{CM} - V_{TH} - \frac{1}{2} \sqrt{ -(2\Delta V)^2 + 4V_{ov,eq}^2 } \] image-20260703225321502

nonlinearity

image-20260703220740683

Resistive Degeneration

Resistive degeneration in differential pairs serves as one major technique for linear amplifier

image-20240824132739726

The linear region for CMOS differential pair would be extended by \(±I_{SS}R/2\) as all of \(I_{SS}/2\) flows through \(R\). \[ V_{in}^+ -V_{in}^- = V_{OV} + V_{TH}+\frac{I_{SS}}{2}R - V_{TH} = \sqrt{\frac{2I_{SS}}{\mu_nC_{OX}\frac{W}{L}}} + \frac{I_{SS}R}{2} \]

Jri Lee, "Communication Integrated Circuits." https://cc.ee.ntu.edu.tw/~jrilee/publications/Comm_IC.pdf

Figure 14.12, Design of Analog CMOS Integrated Circuits, Second Edition [https://electrovolt.ir/wp-content/uploads/2014/08/Design-of-Analog-CMOS-Integrated-Circuit-2nd-Edition-ElectroVolt.ir_.pdf]

Biasing Tradeoffs in Resistive-Degenerated Diff Pair

image-20241027095520556

w/ Current–Mirror Load

S. Pavan, "Revisiting the CMOS Differential Pair With a Current–Mirror Load [CAS Education]," in IEEE Circuits and Systems Magazine, vol. 25, no. 2, pp. 74-78, Secondquarter 2025 [pdf]

TODO 📅

Double Differential pair

\(V_\text{ip}\) and \(V_\text{im}\) are input, \(V_\text{rp}\) and \(V_\text{rm}\) are reference voltage \[ V_o = A_v(\overline{V_\text{ip} - V_\text{im}} - \overline{V_\text{rp} - V_\text{rm}}) \]

2diffpair.drawio

In differential comparison mode, the feedback loop ensure \(V_\text{ip} = V_\text{rp}\), \(V_\text{im} = V_\text{rm}\) in the end

assume input and reference common voltage are same

Pros of (b)

  • larger input range i.e., \(\gt \pm \sqrt{2}V_\text{ov}\) of (a), it works even one differential is off due to lower voltage
  • larger \(g_m\) (smaller input difference of pair)

Cons of (b)

  • sensitive to the difference of common voltage between \(V_\text{ip}\), \(V_\text{im}\) and \(V_\text{rp}\), \(V_\text{rm}\)

common-mode voltage difference

doublepair_cm.drawio

copy aforementioned formula here for convenience \[ V_o = A_v(\overline{V_\text{ip} - V_\text{im}} - \overline{V_\text{rp} - V_\text{rm}}) \]

at sample phase \(V_\text{ip}= V_\text{im}= V_\text{cmi}\) and \(V_\text{rp}= V_\text{rm}= V_\text{cmr}\)

  • \(I_\text{ip0}= I_\text{im0} = I_\text{i0}\)
  • \(I_\text{rp0}= I_\text{rm0} = I_\text{r0}\)

i.e. \(\overline{I_\text{ip} + I_\text{rm}} - \overline{I_\text{im} + I_\text{rp}} = 0\)

at compare start

  • \(V_\text{ip}= V_\text{im}= V_\text{cmi}\) and \(V_\text{rp}= V_\text{cmr}+\Delta\), \(V_\text{rp}= V_\text{cmr}-\Delta\)

  • \(I_\text{ip}\lt I_\text{ip0}\), \(I_\text{rp} \gt I_\text{rp0}\)

  • \(I_\text{im}\gt I_\text{im0}\), \(I_\text{rm} \lt I_\text{rm0}\)

i.e. \(\overline{I_\text{ip} + I_\text{rm}} - \overline{I_\text{im} + I_\text{rp}} \lt 0\), we need to increase \(V_\text{ip}\) and decrease \(V_\text{im}\).

at the compare finish

\[\begin{align} V_\text{ip}= V_\text{cmi} + \Delta \\ V_\text{im}= V_\text{cmi} - \Delta \end{align}\]

and \(I_\text{ip0}= I_\text{im0} = I_\text{i0}\), \(I_\text{rp0}= I_\text{rm0} = I_\text{r0}\)

i.e. \(\overline{I_\text{ip} + I_\text{rm}} - \overline{I_\text{im} + I_\text{rp}} = 0\)


If \(V_\text{cmr} - V_\text{cmi} = \sqrt{2}V_{OV} + \delta\), and \(\delta \gt 0\). one transistor carries the entire tail current

  • \(I_\text{ip} =0\) and \(I_\text{rp} = I_{SS}\), all the time

At the end, \(V_\text{im} = V_\text{cmi} - (\Delta - \delta)\), the error is \(\delta\)

In closing, \(V_\text{cmr} - V_\text{cmi} \lt \sqrt{2}V_{OV}\) for normal work

Furthermore, the difference between \(V_\text{cmr}\) and \(V_\text{cmi}\) should be minimized due to limited impedance of current source and input pair offset

In the end \[ V_\text{cmr} - V_\text{cmi} \lt \sqrt{2}V_{OV} - V_{OS} \]

Under the condition, every transistor of pairs are on in equilibrium

pair mismatch

diff_mismatch_connect.drawio

\[\begin{align} I_{SE} &= g_m(\sigma_{vth,0} + \sigma_{vth,1}) \\ I_{DE} &= g_m(\sigma_{vth,0} + \sigma_{vth,1}) \end{align}\]

The input equivalient offset voltage \[\begin{align} V_{os,SE} &= \frac{I_{SE}}{2g_m} = \frac{\sigma_{vth,0} + \sigma_{vth,1}}{2} \\ V_{os,DE} &= \frac{I_{DE}}{g_m} = \sigma_{vth,0} + \sigma_{vth,1} \end{align}\]

Then \[\begin{align} \sigma_{vos,SE} &= \sqrt{\frac{2\sigma_{vth}^2}{4}} = \frac{\sigma_{vth}}{\sqrt{2}} \\ \sigma_{vos,DE} &= \sqrt{2\sigma_{vth}^2} = \sqrt{2}\sigma_{vth} \end{align}\]

We obtain \[ \sigma_{vos,DE} = 2\sigma_{vos,SE} \]

Gm/ID Approach in Transistor Sizing

Hesham Omran, The Analog Designer's Toolbox (ADT) | Invited Talk by IEEE Santa Clara Valley Section CAS Society [https://youtu.be/FT6kKC5OdE0]

Jespers, P. G. A., & Murmann, B. (2017). Systematic Design of Analog CMOS Circuits: Using Pre-Computed Lookup Tables. Cambridge: Cambridge University Press.

Boris Murmann, February 26, 2016, Systematic Design of Analog Circuits Using Pre-Computed Lookup Tables [https://www.ieeetoronto.ca/wp-content/uploads/2020/06/20160226toronto_sscs.pdf]

image-20230103220933081

small gm/ID for High ro, or high Early voltage \(V_A\)

C/ID Approach in Transistor Sizing

Armin Tajalli, 27 August 2024, Algorithmic Analog Design C/ID: A Design Oriented FET Modeling and Design Approach [https://lcas.ece.utah.edu/wp-content/uploads/sites/91/2024/10/Introduction-to-CID-Algorithm-in-Circuit-Design.pdf]

—, CICC 2026 Circuit Insights, C over ID Approach in Transistor Sizing

image-20260607141930767

TODO 📅

ddsm_single_quantizer_vs_mash

The DDSM performs integer arithmetic (equivalently, fixed-point with the binary point at the LSB) to realize a fractional value.

image-20250906072230725

image-20250906072050727

image-20250906171710938

linearized model

Noise Cancellation Network

image-20260602071603557

image-20250824092757793 \[\begin{align} v[n] = \{0,1,2,...,M-1\} &\space\Rightarrow\space y[n] = 0 \space\Rightarrow\space e_q[n] = \{0, -\frac{1}{M},-\frac{2}{M},...,-\frac{M-1}{M}\} \\ v[n] = \{M,M+1,M2,...,2M-1\} &\space\Rightarrow\space y[n] = 1 \space\Rightarrow\space e_q[n] = \{0, -\frac{1}{M},-\frac{2}{M},...,-\frac{M-1}{M}\} \end{align}\]

image-20250823232924985

\((1 − z^{−1})^3\)

For the three stages of the MASH 1-1-1 DDSM

image-20250823232212295


1st order DDSM (digital accumulator)

image-20250604000323199

assuming \(n_0=2\)

\(x[n]+s[n]\) \(v\) \(e[n]\) \(c[n]\), y
0|00 0 0 0
0|01 1 1 0
0|10 2 2 0
0|11 3 3 0
1|00 4 0 1
1|01 5 1 1
1|10 6 2 1
1|11 7 3 1

yield \(M=2^{n_0}=4\)

2nd order DDSM

image-20250601170123635

In \(z\)-domain \[ \left\{(A + D - Y)\frac{z^{-1}}{1-z^{-1}} - 2Y \right\}\frac{z^{-1}}{1-z^{-1}} + Q = Y \] That is \[ Y = A z^{-2} + Dz^{-2} + Q(1-z^{-1})^2 \] In time domain \[\begin{align} y[n] &= \alpha[n-2] + d[n-2] + q[n]-2q[n-1]+q[n-2] \\ &= \alpha + d[n-2] + q[n]-2q[n-1]+q[n-2] \end{align}\]

LSB Dither

image-20250905064118796

image-20250905064139686


image-20250905065402176

?? integer valued impulse responses

S. Pamarti, J. Welz and I. Galton, "Statistics of the Quantization Noise in 1-Bit Dithered Single-Quantizer Digital Delta–Sigma Modulators," in IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 54, no. 3, pp. 492-503, March 2007 [pdf]

DSM stability

image-20250908213730155

image-20250908213849546

image-20250913161933338

accumulator wordlength

Z. Ye and M. P. Kennedy, "Hardware Reduction in Digital Delta–Sigma Modulators Via Error Masking—Part II: SQ-DDSM," in IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 56, no. 2, pp. 112-116, Feb. 2009 [https://sci-hub.se/10.1109/TCSII.2008.2010188]

—, "Hardware Reduction in Digital Delta-Sigma Modulators Via Error Masking - Part I: MASH DDSM," in IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 56, no. 4, pp. 714-726, April 2009 [https://sci-hub.se/10.1109/TCSI.2008.2003383]

image-20250906134655253

Truncation DAC

accumulator is implicit quantizer

image-20241022204239594

with \(\frac{y}{2^{m_2}} + q= v\), where \(v = \lfloor\frac{y}{2^{m_2}}\rfloor\)

\[ \left\{ \begin{array}{cl} Y + 2^{m_2} Q &= 2^{m_2}V \\ U - z^{-1}2^{m_2}Q &= Y \end{array} \right. \]

The STF & NTF is shown as below \[ V = \frac{1}{2^{m_2}}U + (1-z^{-1})Q \]

To avoid accumulator overflow, stable input range is only of a fraction of the full scale ( \(2^{m_1+m_2}-1\)) \[ u \leq 2^{m_1+m_2} - 2^{m_2} \]

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
m1 = 2  # MSBs
m2 = 4 # LSBs

ymax = 2**(m1 + m2)
umax = 2**(m1 + m2) - 2**m2 # int(m1*'1'+m2*'0', 2)
# format(48, '06b')
# Out[4]: '110000'

u = 48
assert u <= umax

ylist = [0]; vlist = [0]
elist = []; outlist = []

Niter = 2**10
for _ in range(Niter):
ecur = vlist[-1] - ylist[-1]
elist.append(ecur)
ycur = (u - ecur)
assert ycur < ymax, print(ycur)
ylist.append(ycur)
ycur_bin = format(ycur, f'0{m1+m2}b')
vcur = int(ycur_bin[:-m2]+'0'*m2, 2)
vlist.append(vcur)
outlist.append(int(ycur_bin[:-m2], 2))

print(vlist); print(ylist)
print(sum(vlist)/len(vlist)); print(sum(outlist)/len(outlist)*2**m2)

acc-wordlength.drawio

A conservative sufficient condition for avoiding accumulator overflow is

\[ \log_2(2^k + 2^{N-m}) \leq N \]

Thus \[ N \ge k - \log_2(1 - \frac{1}{2^m}) = k+m -\log_2(2^m-1) \]

For an integer quantizer width \(m\geq 1\), \[ k < k - \log_2(1 - \frac{1}{2^m}) \leq k + 1 \] The minimum integer \(N\) satisfying this bound is \[ N_{\min}=\left\lceil k-\log_2(1-2^{-m})\right\rceil=k+1. \]

In the above Temes's slides, \(N = m_1+m_2\) and \(m=m_1\), we have \[ 2^k \leq 2^{m_1+m_2}\cdot (1-\frac{1}{2^{m_1}}) = 2^{m_1+m_2} - 2^{m_2} \]

Thus, this bound requires one guard bit beyond the \(k\)-bit input width, independent of \(m\). For a single-bit quantizer (\(m=1\)), the guard bit is the adder carry-out.

DSM Order & Output Range

7.4.1 Delta-Sigma Modulator [https://iic-jku.github.io/radio-frequency-integrated-circuits/rfic.html#sec-pll-delta-sigma]

image-20260307120539781

image-20260307120745402

Fractional-N PLL

S. Pamarti, J. Welz and I. Galton, "Statistics of the Quantization Noise in 1-Bit Dithered Single-Quantizer Digital Delta–Sigma Modulators," in IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 54, no. 3, pp. 492-503, March 2007 [https://ispg.ucsd.edu/wordpress/wp-content/uploads/2017/05/2007-TCASI-S.-Pamarti-Statistics-of-the-Quantization-Noise-in-1-Bit-Dithered-Single-Quantizer-Digital-Delta-Sigma-Modulators.pdf]

—. "LSB Dithering in MASH Delta–Sigma D/A Converters," in IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 54, no. 4, pp. 779-790, April 2007 [https://sci-hub.se/10.1109/TCSI.2006.888780]

—. CICC 2020 ES2-2: Basics of Closed- and Open-Loop Fractional Frequency Synthesis [https://youtu.be/t1TY-D95CY8]

Ian Galton. Delta-Sigma Fractional-N Phase-Locked Loops [https://ispg.ucsd.edu/wordpress/wp-content/uploads/2022/10/fnpll_ieee_tutorial_2003_corrected.pdf]

—. ISSCC 2010 SC3: Fractional-N PLLs

—. “Delta-Sigma Fractional-N Phase-Locked Loops.” (2003)

Mike Shuo-Wei Chen, ISSCC 2020 T6: Digital Fractional-N Phase Locked Loop Design

image-20250824103717743

image-20250824103933652

Accumulated Quantization Error (AQE)

image-20250824221530772 \[ (N+\alpha)T_{PLL} - \tau[n-1] +\tau[n] = (N+y[n])T_{PLL} \]

i.e. \[ \tau[n] = \tau[n-1] + (y[n] - \alpha)T_{PLL} \]

where \(\tau[n] = t_{v_{DIV}} - t_{v_{DIV}, desired}\)

image-20250824221741018


Y. Zhang et al., "A Fractional- N PLL With Space–Time Averaging for Quantization Noise Reduction," in IEEE Journal of Solid-State Circuits, vol. 55, no. 3, pp. 602-614, March 2020, [pdf]

image-20260319212257566

image-20260319212741334


X. Wang and M. P. Kennedy, "Unified Analysis of Digital Δ-Σ Modulators (DDSMs) for Fractional-N Frequency Synthesis—Introducing the PASS Family of DDSMs Featuring Independent Shaping of the Probability Density and Spectral Envelope," in IEEE Transactions on Circuits and Systems I: Regular Papers [link]

X. Wang and M. P. Kennedy, "Performance Limits of Fractional-N Digital PLLs with Mid-Rise TDCs," 2023 18th Conference on Ph.D Research in Microelectronics and Electronics (PRIME), Valencia, Spain, 2023 [link]

image-20260319213514456

\(\Delta\Sigma\) Noise in PLL

image-20250824162417584

image-20250824183123922

image-20250824210526248


image-20251014070517171

ddsm_fracpll_zoh.drawio

\[\begin{align} S_\phi(f) &= \frac{1}{12F_{ref}}|1-z^{-1}|^{2L}\cdot \left|\frac{2\pi z_{-1}}{1-z^{-1}}\right|^2\cdot \frac{1}{T_{ref}^2} T_{ref}^2 \\ &= \frac{1}{12F_{ref}} |1-z^{-1}|^{2L-2} 4\pi^2 \end{align}\]

with \(|1-z^{-1}| = |2\sin\frac{\pi f}{F_{ref}}|\)

\[ S_\phi(f) = \frac{1}{12F_{ref}} \cdot \left|2\sin\frac{\pi f}{F_{ref}}\right|^{2(L-1)}\cdot 4\pi^2 = \frac{\pi^2}{3F_{ref}} \cdot \left|2\sin\frac{\pi f}{F_{ref}}\right|^{2(L-1)} \]



Jri Lee,【【鳌中堂笔记·抢先体验版】 锁相环08】[bilibili link]

image-20260607215611364

image-20260607215728273

image-20260607215746424

image-20260607215804072image-20260607215824057


俞思辰, Analog and Digital PLL Phase Noise Model [https://bbs.eetop.cn/thread-996183-1-1.html]

image-20260619134758155

Frequency & Time-Domian Model for Q-noise

metroidman, fractional N量化噪声对系统相位噪声的影响 两种分析方法 LTI频域法和时域采样DFT法 [link]

LTI Frequency domain model & analysis

image-20260505134611228

image-20260505104140230

fcw: Frequency Control Word

image-20260505132857159

note

\(z=e^{j2\pi f \color{red}T_\text{ref}}\) — model's time tick is reference clock period

\(\frac{\Phi}{N}(z)\) — relationship between \(\Phi\) and \(N\)

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
% --- System Parameters ---
fref = 40e6;
fcw = 360.123;
kvco = 2 * pi * 300e6;

% Components
icp = 60e-6; C0 = 40e-12;
R1 = 14000; C1 = 360e-12;
R2 = 1000; C2 = 20e-12;

% --- Frequency Vector ---
f = logspace(2, 9, 1000);
s = 1i * 2 * pi * f;

% --- Loop Filter Transfer Function ---
num_lf = s .* R1 .* C1 + 1;
den_lf = (s.^3 .* R1 .* R2 .* C0 .* C1 .* C2 + ...
s.^2 .* (R1.*C1.*C0 + R1.*C1.*C2 + R2.*C2.*C0 + R2.*C2.*C1) + ...
s .* (C0 + C1 + C2));
loopfilter = num_lf ./ den_lf;

% --- Loop Gain and Noise Transfer Function ---
loopgain = (icp / (2*pi)) .* loopfilter .* (kvco ./ s) .* (1 / fcw);
hfra = (loopgain ./ (1 + loopgain)) .* 2*pi./(exp(s./fref) - 1) .* (1 - exp(-s./fref)).^3;

% --- Spectral Density calculation ---
sfra = 10 * log10((1 / (12 * fref)) .* abs(hfra).^2);

% --- Plot ---
semilogx(f, sfra, LineWidth=2);
ylim([-250, -100]); yticks(-250:10:-100);
grid on; xlabel('Frequency (Hz)'); ylabel('dB');
title('Quantization Noise Effects', FontSize=14);

image-20260505161445944



Time domain model & DFT analysis

image-20260508010742912

image-20260505141430979

Round in In[24] is redundant and likely unnecessary for the logic to function

\(\phi\) and phi is frequency (cycles per second) instead of angular frequency (radians per second)

image-20260507004159940

image-20260505134433533

\(\Delta\Sigma\) DAC

LPF (RC Filter)

Neil Robertson, Model a Sigma-Delta DAC Plus RC Filter [https://www.dsprelated.com/showarticle/1642.php]

Sigma-delta digital-to-analog converters (SD DAC’s) are often used for discrete-time signals with sample rate much higher than their bandwidth

  • Because of the high sample rate relative to signal bandwidth, a very simple DAC reconstruction filter (Analog lowpass filter) suffices, often just a one-pole RC lowpass

image-20250616000829208

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
R= 4.7e3;                 % ohms resistor value
C= .01e-6; % F capacitor value
fs= 1e6; % Hz DAC sample rate
% input signal
x= [zeros(1,20) .9*ones(1,200) .1*ones(1,200)];
% find output y of SD DAC and output y_filt of RC filter
[y,y_filt]= sd_dacRC(x,R,C,fs);

t = linspace(0,length(x)-1, length(x))*1/fs*1e3;
subplot(3,1,1)
plot(t, x, '.'); title('x'); grid on
subplot(3,1,2)
plot(t, y, '.'); title('y'); grid on
subplot(3,1,3)
plot(t, y_filt); title('y_{filt}'); xlabel('t(ms)'); grid on

image-20250621223451691


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
% https://www.dsprelated.com/showarticle/1642.php
% Neil Robertson, Model a Sigma-Delta DAC Plus RC Filter

% function [y,y_filt] = sd_dacRC(x,R,C,fs) 2/5/24 Neil Robertson
% 1-bit sigma-delta DAC with RC filter
% Model does not include a zero-order hold.
%
% x = input signal vector, 0 <= x < 1
% R = series resistor value, Ohms. Normally R > 1000 for 3.3 V logic.
% C = shunt capacitor value, Farads
% fs = sample frequency, Hz
% y = DAC output signal vector, y(n) = 0 or 1
% y_filt = RC filter output signal vector
%
function [y,y_filt] = sd_dacRC(x,R,C,fs)
N= length(x);
x= fix(x*2^16)/2^16; % quantize x to 16 bits
%I 1-bit Sigma-delta DAC
s= [x(1) zeros(1,N-1)];
for n= 2:N
u= x(n) + s(n-1);
s(n)= mod(u,1); % sum
y(n)= fix(u); % carry
end

%II One-pole RC filter model
% Matched z-Transform https://ocw.mit.edu/courses/2-161-signal-processing-continuous-and-discrete-fall-2008/cc00ac6d468dc9dcf2238fc1d1a194d4_lecture_19.pdf
Ts= 1/fs;
Wc= 1/(R*C); % rad -3 dB frequency
fc= Wc/(2*pi); % Hz -3 dB frequency
a1= -exp(-Wc*Ts);
b0= 1 + a1; % numerator coefficient
a= [1 a1]; % denominator coeffs
y_filt= filter(b0,a,y); % filter the DAC's output signal y

ZOH (Zero-Order Hold Models)

Neil Robertson, DAC Zero-Order Hold Models [https://www.dsprelated.com/showarticle/1627.php]

image-20250628204404959

The last D2C is in human vision, which connect discrete time \(y(m)\) with line, implicitly

image-20250628203216965

Sinc Corrector

Neil Robertson, Design a DAC sinx/x Corrector [https://www.dsprelated.com/showarticle/1191.php]

Dan Boschen. how to make CIC compensation filter [https://dsp.stackexchange.com/a/31596/59253]

—. Core Building Blocks for Software Defined Radio (SDR): DDC, DUC, NCO) [https://lnkd.in/p/e2MtC9QK]

Equalizing Techniques Flatten DAC Frequency Response [https://www.analog.com/en/resources/technical-articles/equalizing-techniques-flatten-dac-frequency-response.html]

aka. Inverse Sinc Compensation

TODO 📅

img

OSR & NS

maximum output signal 22kHz

image-20250906195627446

\[SNR = 16\times 6.02 + 1.76 = 98.08\]

image-20250906200230380


image-20250906205517957

1
2
3
4
5
6
7
8
9
10
11
12
OSR = 5.65e6/(2*22e3);
Nin = 16;
Nout = 1;

SNR_in = 6.02*Nin + 1.76;

SNR_ds = 6.02*Nout + 1.76 - 10*log10(pi^4/5) + 50*log10(OSR);

QN_in = 1/10^(SNR_in/10);
QN_ds = 1/10^(SNR_ds/10);

SNR_out = 10*log10(1/(QN_in + QN_ds));

image-20250906205622949


Y. Liu, J. Gao and X. Yang, "24-bit low-power low-cost digital audio sigma-delta DAC," in Tsinghua Science and Technology, vol. 16, no. 1, pp. 74-82, Feb. 2011 [https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=6077939]

image-20250922224650348

1
2
3
4
5
6
7
8
9
10
11
12
13
14
snr_if = 144;
snr_ds = 135;
snr_ana = 95;

n_if = 1/10^(snr_if/10);
n_ds = 1/10^(snr_ds/10);
n_ana = 1/10^(snr_ana/10);

snr_tot = 10*log10(1/(n_if + n_ds + n_ana))

%
% snr_tot =
%
% 94.9995

MASH 1-1-1

J. W. M. Rogers, F. F. Dai, M. S. Cavin and D. G. Rahn, "A multiband /spl Delta//spl Sigma/ fractional-N frequency synthesizer for a MIMO WLAN transceiver RFIC," in IEEE Journal of Solid-State Circuits, vol. 40, no. 3, pp. 678-689, March 2005 [https://sci-hub.se/10.1109/JSSC.2005.843604]

image-20260904225009193


(a) a fractional accumulator, and (b) a triple-loop \(\Delta\Sigma\) accumulator for \(N(z) = 100 + 1/32\)

\(n=5\)

image-20250927091310965

image-20250926205608397

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
import numpy as np
import matplotlib.pyplot as plt
import scipy.fft as fft
import scipy.signal.windows as windows

def acc_nbit(din, nbit=5, ncycles=2**10):
mod = 2**nbit
acc = 0
eq = 0
colist = []
eqlist = []
for i in range(ncycles):
acc = din[i] + eq
eq = acc % mod
#print(acc, eq)
co_tmp = int(acc >= mod)
colist.append(co_tmp)
eqlist.append(eq)
return colist, eqlist

Ncyl = 2**16
cin1 = [1]*Ncyl

c1,eq1 = acc_nbit(cin1, ncycles=Ncyl)
cin2 = [0,*eq1[:-1]]
#cin2 = eq1

c2,eq2 = acc_nbit(cin2, ncycles=Ncyl)
cin3 = [0,*eq2[:-1]]
#cin3 = eq2

c3,eq3 = acc_nbit(cin3, ncycles=Ncyl)

ctot = []

for i in range(2, Ncyl):
# C1(z) + (1 − z^−1)C2(z) + (1 − z^−1)^2 C3(z)
ctot_cur = c1[i] + c2[i]-c2[i-1] + c3[i]-2*c3[i-1] + c3[i-2]
ctot.append(ctot_cur)

print(sum(c1)/len(c1)) # 0.03125
print(sum(ctot)/len(ctot)) # 0.03128147221289712

plt.figure(figsize=(20,8))
plt.subplot(1,2,1)
plt.plot(c1[:200], 'o-', label='c1')
plt.legend(loc='upper left'); plt.grid(True)
plt.subplot(1,2,2)
plt.plot(ctot[:200], 'o-', label='ctot')
plt.legend(loc='upper left'); plt.grid(True)


Ntot = int(2**np.floor(np.log2(len(ctot))))
c1_4fft = np.array(c1[:Ntot])
ctot_4fft = np.array(ctot[:Ntot])
whann = windows.hann(Ntot)
Y_c1 = abs(fft.rfft(c1_4fft*whann))/sum(whann)
Y_ctot = abs(fft.rfft(ctot_4fft*whann))/sum(whann)

print(Y_c1[0]) # 0.031250000002717625
print(Y_ctot[0]) # 0.031249999999526525

plt.figure(figsize=(20,8))
plt.subplot(2, 1, 1)
_, stemlines, _ = plt.stem(Y_c1, markerfmt=" ", label='c1')
plt.setp(stemlines, 'linewidth', 4)
plt.ylim([0,0.04]); plt.grid(True); plt.legend(loc='upper left')
plt.subplot(2, 1, 2)
_, stemlines, _ = plt.stem(Y_ctot, markerfmt=" ", label='ctot')
plt.setp(stemlines, 'linewidth', 4)
plt.ylim([0,0.04]); plt.grid(True); plt.legend(loc='upper left')

plt.show()

Harald Pretl, Radio-Frequency Integrated Circuits. 7.4 Fractional-N PLL [note] [MASH Modulator (3rd Order) code]

image-20260307140247849

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
# Stage 1: 1st order modulator with input signal
self.integrator1 += input_value
y1 = 1 if self.integrator1 >= 1.0 else 0
e1 = self.integrator1 - y1 # Quantization error
self.integrator1 = e1 # Store error for next iteration

# Stage 2: 1st order modulator fed with quantization error from stage 1
self.integrator2 += e1
y2 = 1 if self.integrator2 >= 1.0 else 0
e2 = self.integrator2 - y2
self.integrator2 = e2

# Stage 3: 1st order modulator fed with quantization error from stage 2
self.integrator3 += e2
y3 = 1 if self.integrator3 >= 1.0 else 0
e3 = self.integrator3 - y3
self.integrator3 = e3

# Digital noise cancellation logic for MASH 1-1-1
# Output = Y1 + (1-z^-1)*Y2 + (1-z^-1)^2*Y3
# Expanding (1-z^-1)^2 = 1 - 2*z^-1 + z^-2:
# Output = Y1 + Y2 - Y2[z^-1] + Y3 - 2*Y3[z^-1] + Y3[z^-2]

combined = y1 + (y2 - self.y2_prev) + (y3 - 2*self.y3_prev + self.y3_prev2)
1
2
3
4
5
6
7
for i in range(length):
dither = rng.uniform(-dither_amplitude, dither_amplitude) if dither_amplitude > 0 else 0.0
combined, y1, y2, y3 = self.step(input_value + dither)
combined_output[i] = combined
y1_output[i] = y1
y2_output[i] = y2
y3_output[i] = y3
1
2
3
4
5
6
7
# Plot 2: Frequency spectrum (with dither)
ax2 = plt.subplot(1, 2, 2)
N = len(mash_combined_with_dither)
fft_freq = np.fft.fftfreq(N)
pos_freq = fft_freq >= 0
fft_no = np.fft.fft(mash_combined_with_dither)
psd_no = 20 * np.log10(np.abs(fft_no) / N + 1e-12)

fig-mash-dither


metroidman, 用Simulink Excel Mathematica三种不同工具从零搭建3阶ΣΔ调制器并进行时域和频率分析 [link]

Simulink

image-20260506224056912

Excel

image-20260505164717508

Mathematica

image-20260507002107990

The code fcwit = Table[fcwi[i], {i, 9999}]; is the command that actually runs the simulation for a set duration.

Here is the breakdown of what is happening:

  • Table[..., {i, 9999}]: This creates a list by repeating an operation 9,999 times. It acts like a for loop in other programming languages.
  • fcwi[i]: This calls the function you defined earlier. For every value of i from 1 to 9,999, it calculates the instantaneous integer division ratio produced by the MASH modulator.
  • fcwit = ...: It stores all 9,999 results into a single long list (an array) named fcwit.
  • ; (Semicolon): This is important—it suppresses the output. Without it, Mathematica would print all 9,999 numbers on your screen, which would be a huge mess!

image-20260906142413731

For each first-order stage,

\[ \begin{aligned} y_1 &=z^{-1}x+(1-z^{-1})q_1\\ y_2 &=-z^{-1}q_1+(1-z^{-1})q_2\\ y_3 &=-z^{-1}q_2+(1-z^{-1})q_3 \end{aligned} \]

The error-cancellation network is

\[ y=z^{-2}y_1 +z^{-1}(1-z^{-1})y_2 +(1-z^{-1})^2y_3 \]

Substitute:

\[ \begin{aligned} y ={}&z^{-2}\left[z^{-1}x+(1-z^{-1})q_1\right] \\ &+z^{-1}(1-z^{-1}) \left[-z^{-1}q_1+(1-z^{-1})q_2\right]\\ &+(1-z^{-1})^2 \left[-z^{-1}q_2+(1-z^{-1})q_3\right] \end{aligned} \]

Now \(q_1\) cancels:

\[ z^{-2}(1-z^{-1})q_1 -z^{-2}(1-z^{-1})q_1=0 \]

And \(q_2\) cancels:

\[ z^{-1}(1-z^{-1})^2q_2 -z^{-1}(1-z^{-1})^2q_2=0 \]

What remains is

\[ \boxed{ y=z^{-3}x+(1-z^{-1})^3\textcolor{red}{q_3} } \]

Only the last stage's quantization error survives — that is the defining property of a MASH.

image-20260904224324472

  • Fig. 3.10 style (delaying integrators): delays are mandatory, \(H_1=z^{-2}\) minimum
  • non-delaying accumulators style (STF = 1): no delays needed

So, in short:

\[ \boxed{\text{The delays are necessary in Fig. 3.10, but not universally necessary for MASH 1-1-1}} \]

They compensate for the one-cycle STF delay introduced by each \(\frac{z^{-1}}{1-z^{-1}}\) stage.

Realization First-order accumulator/integrator Cancellation
Fig. 3.10 \(\displaystyle \frac{\textcolor{red}{z^{-1}}}{1-z^{-1}}\) \(\displaystyle z^{-2}Y_1+z^{-1}(1-z^{-1})Y_2+(1-z^{-1})^2Y_3\)
Fig. 9.18/9.21 \(\displaystyle \frac{1}{1-z^{-1}}\) / carry-based timing \(\displaystyle C_1+(1-z^{-1})C_2+(1-z^{-1})^2C_3\)

image-20260904225009193

From Eq. (9.47),

\[ N_{\text{frac}}[k] = C_1[k] +(1-z^{-1})C_2[k] +(1-z^{-1})^2 C_3[k] \]

or

\[ N_{\text{frac}}[k] = C_1[k] +\big(C_2[k]-C_2[k-1]\big) +\big(C_3[k]-2C_3[k-1]+C_3[k-2]\big) \]

Since each carry is one bit,

\[ C_i[k]\in\{0,1\} \]

Therefore,

\[ C_1\in[0,1],\qquad (1-z^{-1})C_2\in[-1,1] \]

and

\[ (1-z^{-1})^2C_3\in[-2,2] \]

So the worst-case sum is

\[ \boxed{-3\le N_{\text{frac}}\le 4} \]

A 3-bit two's-complement number only represents

\[ \boxed{-4,\ldots,+3} \]

so it cannot represent \(+4\). Therefore that implementation uses 4 bits:

\[ \boxed{\text{signed }[-3,+4]\Rightarrow 4\text{ bits}} \]

whereas Fig. 3.14 uses

\[ \boxed{\text{8 encoded levels}\Rightarrow 3\text{ bits}} \]

So the distinction is:

\[ \boxed{ \begin{array}{ll} 3\text{ bits} & \text{enough to encode the 8 possible levels with special coding},\\[2mm] 4\text{ bits} & \text{needed for straightforward signed two's-complement arithmetic.} \end{array}} \]

So there is no fundamental disagreement: \[ \boxed{ \begin{array}{c} \text{Fig. 9.21: signed arithmetic representation} \rightarrow 4\text{ bits}\\[2mm] \text{Fig. 3.14: encoded divider-selection word} \rightarrow 3\text{ bits} \end{array}} \]

The important fact is that a MASH 1-1-1 only needs to select 8 divider levels; therefore the final divider control can indeed be implemented with 3 physical bits.

reference

Michael Peter Kennedy. scv-cas 2014: Digital Delta-Sigma Modulators [pdf,recording]

—, Recent advances in the analysis, design and optimization of Digital Delta-Sigma Modulators [pdf]

Kaveh Hosseini and Peter Kennedy. 2006 Hardware Efficient Maximum Sequence Length Digital MASH Delta Sigma Modulator [pdf]

Jason Sachs. Return of the Delta-Sigma Modulators, Part 1: Modulation [https://www.dsprelated.com/showarticle/1517/return-of-the-delta-sigma-modulators-part-1-modulation]


Neil Robertson, Modeling a Continuous-Time System with Matlab [https://www.dsprelated.com/showarticle/1055.php]

—, “A Simplified Matlab Function for Power Spectral Density”, DSPRelated.com, March, 2020, [https://www.dsprelated.com/showarticle/1333.php]

Rick Lyons. How Discrete Signal Interpolation Improves D/A Conversion [https://www.dsprelated.com/showarticle/167.php]

Dan Boschen. sigma delta modulator for DAC [https://dsp.stackexchange.com/a/88357/59253]

Woogeun Rhee. ISCAS 2019 Mini Tutorials: Single-Bit Delta-Sigma Modulation Techniques for Robust Wireless Systems [https://youtu.be/OEyTM4-_OyA]

—, 2001 Phd Thesis: Multi-Bit Delta -Sigma Modulation Technique for Fractional-N Frequency Synthesizers [https://www.ime.tsinghua.edu.cn/Thesis_rhee.pdf]


Pavan, Shanthi, Richard Schreier, and Gabor Temes. (2016) 2016. Understanding Delta-Sigma Data Converters. 2nd ed. Wiley.


John Rogers, Calvin Plett, and Foster Dai. 2006. Integrated Circuit Design for High-Speed Frequency Synthesis (Artech House Microwave Library). Artech House, Inc., USA.

K. Hosseini and M. P. Kennedy, Minimizing Spurious Tones in Digital Delta-Sigma Modulators (Analog Circuits and Signal Processing). New York, NY, USA: Springer, 2011.

Rhee, W. (2020). Phase-locked frequency generation and clocking : architectures and circuits for modern wireless and wireline systems. The Institution of Engineering and Technology

Lacaita, Andrea Leonardo, Salvatore Levantino, and Carlo Samori. Integrated frequency synthesizers for wireless systems. Cambridge University Press, 2007.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
Delta-Sigma Modulators

├─ Analog ΔΣ Modulators
│ │
│ ├─ Discrete-Time Analog ΔΣ Modulator, DT ΔΣM
│ │ ├─ Switched-capacitor / switched-current loop filter
│ │ ├─ Input is sampled before or inside loop filter
│ │ └─ Very common in ΔΣ ADCs
│ │
│ └─ Continuous-Time Analog ΔΣ Modulator, CT ΔΣM
│ ├─ Continuous-time RC / gm-C / active-RC loop filter
│ ├─ Feedback DAC is continuous-time
│ ├─ Quantizer is usually clocked → synchronous CT ΔΣM
│ └─ Quantizer/comparator may be event-driven → asynchronous CT ΔΣM

└─ Digital ΔΣ Modulators, DDSM

├─ Single-quantizer DDSM
│ ├─ Output-feedback form
│ └─ Error-feedback form, EFM

└─ MASH DDSM
└─ Multi-stage noise-shaping modulator

image-20250903210531360


image-20250611074830238

"Quantizers" and "truncators", "integrators" and "accumulators" are used in delta-sigma ADCs and DACs, respectively

P. Kiss, J. Arias and Dandan Li, "Stable high-order delta-sigma DACS," 2003 IEEE International Symposium on Circuits and Systems (ISCAS), Bangkok, 2003 [https://www.ele.uva.es/~jesus/analog/tcasi2003.pdf]

Oversampling

David Johns and Ken Martin. Oversampling Converters [https://www.eecg.toronto.edu/~johns/ece1371/slides/14_oversampling.pdf]

image-20260601223915205


Over Sampling

Nyquist sampling theorem @signal: no aliasing, signal remain the same

noise folding @noise: same total noise power spread over a wider frequency

[https://dsp.stackexchange.com/a/40261/59253]


image-20250629215830077

Noise Shaping

image-20250629232343017

image-20250629232453811

1
2
3
4
5
6
7
8
9
10
11
[h1, w1] = freqz([1 -1], 1);
[h2, w2] = freqz([1 -2 1], 1);

plot(w1/2/pi, abs(h1), LineWidth=3)
hold on
plot(w2/2/pi, abs(h2), LineWidth=3)
grid on
legend('MOD1', 'MOD2')
xlabel('fs')
ylabel('mag')
title('NTF of MOD1 & MOD2')

image-20250824151828263

SQNR improvement

In general, for an \(l\)th order modulator with \(\text{NTF}(z) = (1 − z^{−1})^l\), the SQNR increases by \((6l + 3)\) dB for every doubling of the OSR, which provides \(l+0.5\) extra bits resolution

without the delta-sigma loop

image-20250823220900699

\(10\log (2) \approx 3\)dB

first order delta-sigma modulator

image-20250823220842529

\(30\log (2) \approx 9\)dB

second order delta-sigma modulator

image-20250823220922480

\(50\log (2) \approx 15\)dB


image-20250823224500839

1
2
3
4
5
6
7
8
9
10
11
12
13
14
OSR= linspace(1,16,16);

SQNR_ovonly_delta = 10*log10(OSR);
SQNR_1st_delta = -10*log10(pi^2/3) + 30*log10(OSR);
SQNR_2st_delta = -10*log10(pi^4/5) + 50*log10(OSR);

plot(OSR, SQNR_ovonly_delta,'ro-', LineWidth=4);
hold on
plot(OSR, SQNR_1st_delta,'bo-', LineWidth=4);
plot(OSR, SQNR_2st_delta,'mo-', LineWidth=4);
grid on; grid minor;
xlim([1 16]); ylim([-20 50]);
xlabel('OSR', FontSize=16); ylabel('\DeltaSQNR (dB)', FontSize=16);
legend('Oversampling Only', '1st \Delta\Sigma', '2nd \Delta\Sigma', fontsize=16)

TI. ADC12EU050 Continuous-Time Sigma-Delta ADCs [https://www.ti.com/lit/an/snaa098/snaa098.pdf]

image-20250906192735041

where \(N\) is the number of bits in the output, \(M\) is known as the over-sampling ratio, \(L\) is loop orders

Quantizer Bits & ENOB

without the delta-sigma loop

image-20260601202545209

image-20250921132712308

image-20250921102250022

image-20250921124756085

High-Order \(\Delta\Sigma\) Modulators

image-20250921133840404

image-20250921134001793

image-20250921134051906

image-20250921134312753

image-20250629215715378


The greater the number of quantizer levels, the smaller quantization error

image-20250824081318669

Performance Metrics

image-20260503165509578

  • signal-to-noise ratio (SNR)
  • dynamic range (DR)
  • signal-to-(noise + distortion) ratio (SNDR)

image-20260503165804824

DR by "SNR Max" Definition (\(\Delta\Sigma\) Specific)

image-20260503172843146

Quantizer overload

M. Neitola, "Lee's Rule Extended," in IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 64, no. 4, pp. 382-386, April 2017

image-20250905062939783



Maximum Stable Amplitude (MSA)

image-20260503133732822

image-20260503140323450

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
% Schreier Delta-Sigma Toolbox required
OSR = 64;
order = 3;
nlev = 2;
H_inf = 1.5;

ntf = synthesizeNTF(order, OSR, 1, H_inf);

N = 2^14;
fB = floor(N/(2*OSR)); % last in-band bin index (0-based)
fin = round(fB/3); % in-band test tone
amps = -80:2:0;
snr = zeros(size(amps));

w = ds_hann(N);
nb = 1; % Hann: 2*nb+1 = 3 signal bins

for k = 1:length(amps)
A = 10^(amps(k)/20);
u = A*sin(2*pi*fin/N*(0:N-1));
v = simulateDSM(u, ntf, nlev);
spec = fft(v .* w) / (sum(w)/2);

inband = spec(1:fB+1); % <-- KEY: only in-band bins
snr(k) = calculateSNR(inband, fin, nb);
end

plot(amps, snr,'-o'); grid on;
xlabel('Input amplitude (dBFS)');
ylabel('SNR (dB)');
title(sprintf('Order=%d, OSR=%d, %d-lev, ||NTF||_\\infty=%.1f',...
order, OSR, nlev, H_inf));

\(\Delta \Sigma\) vs. \(\Delta\) modulation

  • \(\Delta \Sigma\) modulators, and other noise-shaping modulators, change the spectrum of the noise but leave the signal unchanged

  • \(\Delta\) modulators and other signal-predicting modulators shape the spectrum of the modulated signal but leave the quantization noise unchanged at the receiver

output vs. error-feedback

The error-feedback architecture is problematic for analog implementation, since it is sensitive to variations of its parameters (subtractor realization)

image-20260601204357195


ADC

image-20250618203604863

image-20250618203636417


DAC

P. Kiss, J. Arias and Dandan Li, "Stable high-order delta-sigma DACS," 2003 IEEE International Symposium on Circuits and Systems (ISCAS), Bangkok, 2003 [https://www.ele.uva.es/~jesus/analog/tcasi2003.pdf]

image-20250617223537672


output-feedback

img

[https://www.linkedin.com/posts/danboschen_signalprocessing-dsp-pythonforengineers-activity-7345777588746788866-SprG?utm_source=share&utm_medium=member_desktop&rcm=ACoAAD-cuiIBDJ62eh9q3qTSSdslYXr-XMd8TGw]

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
// https://github.com/hamsternz/second_order_sigma_delta_DAC

`timescale 1ns / 1ps
module second_order_dac(
input wire i_clk,
input wire i_res,
input wire i_ce,
input wire [15:0] i_func,
output wire o_DAC
);

reg this_bit;

reg [19:0] DAC_acc_1st;
reg [19:0] DAC_acc_2nd;
reg [19:0] i_func_extended;

assign o_DAC = this_bit;

always @(*)
i_func_extended = {i_func[15],i_func[15],i_func[15],i_func[15],i_func};

always @(posedge i_clk or negedge i_res)
begin
if (i_res==0)
begin
DAC_acc_1st<=16'd0;
DAC_acc_2nd<=16'd0;
this_bit = 1'b0;
end
else if(i_ce == 1'b1)
begin
if(this_bit == 1'b1)
begin
DAC_acc_1st = DAC_acc_1st + i_func_extended - (2**15);
DAC_acc_2nd = DAC_acc_2nd + DAC_acc_1st - (2**15);
end
else
begin
DAC_acc_1st = DAC_acc_1st + i_func_extended + (2**15);
DAC_acc_2nd = DAC_acc_2nd + DAC_acc_1st + (2**15);
end
// When the high bit is set (a negative value) we need to output a 0 and when it is clear we need to output a 1.
this_bit = ~DAC_acc_2nd[19];
end
end
endmodule

Time and Frequency Domain

image-20250627193435726

\(M \gt N\)

[https://web.engr.oregonstate.edu/~temes/ece627/Lecture_Notes/Intro_to_Delta_Sigma_Data_Converters.pdf]


Chun-Hsien Su ( 蘇純賢). Fundamentals of Sigma-Delta Data Converters,July, 2006 [pdf]

image-20250809235244362

image-20250809235311542



ADC

image-20250611234653738

image-20250612000925089

hackaday. Tearing Into Delta Sigma ADC’s [https://hackaday.com/2016/07/07/tearing-into-delta-sigma-adcs-part-1/]


image-20250617234727838



DAC

an interpolation filter effectively up-samples its low-rate input and lowpass-filters the resulting high-rate data to produce a high-rate output devoid of images

image-20250612000423191

P.E. Allen -CMOS Analog Circuit Design: Lecture 39 – Oversampling ADCs – Part I (6/26/14) [https://aicdesign.org/wp-content/uploads/2018/08/lecture39-140626.pdf]

P.E. Allen -CMOS Analog Circuit Design: Lecture 40 – Oversampling ADCs – Part II (7/17/15) [https://aicdesign.org/wp-content/uploads/2018/08/lecture40-150717.pdf]


image-20250720201944707

David Johns and Ken Martin. Oversampling Converters [https://www.eecg.toronto.edu/~johns/ece1371/slides/14_oversampling.pdf]


image-20250627194351778

[https://web.engr.oregonstate.edu/~temes/ece627/Lecture_Notes/Intro_to_Delta_Sigma_Data_Converters.pdf]

No delay-free loops

Any such physically feasible device will take a finite time to operate – in other words, the quantized output will only be available a small time after the quantizer has "looked" at the input - insert a one-sample delay

image-20250617231014547

there cannot be a "delay free loop" is a common idea in sequential digital state machine design


image-20241128232040924

Both integrator and quantizer are delay free

NTF realizability criterion: No delay-free loops in the modulator

image-20241128233022231

linear settling & GBW of amplifier

TODO 📅

Switched capacitor has been the common realization technique of discrete-time (DT) modulators, and in order to achieve a linear settling, the sampling frequency used in these converters needs to be significantly lower than the gain bandwidth product (GBW) of the amplifiers.

MOD1 & MOD2

MOD1: first-order noise-shaped converter (\(\Delta\Sigma\) modulator)

MOD2: second-order noise-shaped converter (\(\Delta\Sigma\) modulator)



MOD1

image-20241005120659945 \[ V(z) = U(z) +(1-z^{-1})E(z) \]

  • A binary DAC (and hence a binary modulator) is inherently linear
  • With a CT loop filter, MOD1 has inherent anti-alising

image-20241005202024498 \[\begin{align} v[1] &= u - (0) + e[1] \\ v[2] &= 2u - (v[1]) + e[2] \\ v[3] &= 3u - (v[1]+v[2]) + e[3] \\ v[4] &= 4u - (v[1]+v[2]+v[3]) + e[4] \end{align}\]

That is \[ v[n] = nu - \sum_{k=1}^{n-1}v[k] + e[n] \] Therefore, we have \(v[n-1] = (n-1)u - \sum_{k=1}^{n-2}v[k] + e[n-1]\), then \[\begin{align} v[n] &= nu - \sum_{k=1}^{n-1}v[k] + e[n] \\ &= u + \left((n-1)u - \sum_{k=1}^{n-2}v[k]\right) - v[n-1] + e[n] \\ &= u + v[n-1] - e[n-1] -v[n-1] + e[n] \\ &= u + e[n] - e[n-1] \end{align}\]


image-20250524215712688

Dout, the low frequency component of ADC out is same with Vin



MOD2

[https://web.engr.oregonstate.edu/~temes/ece627/Lecture_Notes/2nd_Higher_Order.pdf]

image-20241005160203074



MOD1 with DC Excitation

TODO 📅

Mismatch Shaping

image-20241112220458335

Data-Weighted Averaging (DWA)

image-20241113000942025 \[\begin{align} \sum_{i=0}^{n}v[i] + e_\text{DAC}[n] &= y[n] \\ \sum_{i=0}^{n-1}v[i] + e_\text{DAC}[n-1] &= y[n-1] \end{align}\]

and we have \(w[n] = y[n] - y[n-1]\), then \[ w[n] = v[n] + e_\text{DAC}[n] - e_\text{DAC}[n-1] \] i.e. \[ W = V + (1-z^{-1})e_\text{DAC} \]

Element Rotation:

image-20241112233059745

[http://individual.utoronto.ca/schreier/lectures/12-2.pdf], [http://individual.utoronto.ca/trevorcaldwell/course/Mismatch.pdf]

integrator leakage

When the integrator includes leakage (\(\alpha\))

\[ x[n-1] + \alpha y[n-1] = y[n] \]

then, \[ \frac{Y}{X} = \frac{z^{_1}}{1-\alpha z^{-1}} \]

Schreier Delta-Sigma Toolbox

Richard Schreier (2026). Delta Sigma Toolbox [https://www.mathworks.com/matlabcentral/fileexchange/19-delta-sigma-toolbox]

TODO 📅

synthesizeNTF



simulateDSM

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
function [v,xn,xmax,y] = simulateDSM(u,arg2,nlev,x0)
%[v,xn,xmax,y] = simulateDSM(u,ABCD,nlev=2,x0=0)
% or
%[v,xn,xmax,y] = simulateDSM(u,ntf,nlev=2,x0=0)
%
%Compute the output of a general delta-sigma modulator with input u,
%a structure described by ABCD, an initial state x0 (default zero) and
%a quantizer with a number of levels specified by nlev.
%Multiple quantizers are implied by making nlev an array,
%and multiple inputs are implied by the number of rows in u.
%
%Alternatively, the modulator may be described by an NTF.
%The NTF is zpk object. (The STF is assumed to be 1.)
%The structure that is simulated is the block-diagional structure used by
%zp2ss.m.


calculateSNR

1
2
3
4
5
6
7
8
9
10
11
12
function snr = calculateSNR(hwfft,f,nsig)

signalBins = [f-nsig+1:f+nsig+1];
s = norm(hwfft(signalBins));

noiseBins = 1:length(hwfft);
noiseBins(signalBins) = [];
n = norm(hwfft(noiseBins));

snr = dbv(s/n);

end

image-20260503174009854

reference

Pavan, Shanthi, Richard Schreier, and Gabor Temes. (2016). Understanding Delta-Sigma Data Converters. 2nd ed. Wiley.

Norsworthy, Steven R., Richard Schreier, Gábor C. Temes and Ieee Circuits. “Delta-sigma data converters : theory, design, and simulation.” (1997).

Horowitz, P., & Hill, W. (2015). The art of electronics (3rd ed.). Cambridge University Press.

John Rogers, Calvin Plett, and Foster Dai. 2006. Integrated Circuit Design for High-Speed Frequency Synthesis (Artech House Microwave Library). Artech House, Inc., USA.

Razavi B. Analysis and Design of Data Converters. Cambridge University Press; 2025.


R. Schreier, ISSCC2006 tutorial: Understanding Delta-Sigma Data Converters

Shanthi Pavan, ISSCC2013 T5: Simulation Techniques in Data Converter Design [https://www.nishanchettri.com/isscc-slides/2013%20ISSCC/TUTORIALS/ISSCC2013Visuals-T5.pdf]

Bruce A. Wooley , 2012, "The Evolution of Oversampling Analog-to-Digital Converters" [https://r6.ieee.org/scv-sscs/wp-content/uploads/sites/80/2012/06/Oversampling-Wooley_SCV-ver2.pdf]

Venkatesh Srinivasan, ISSCC 2019 T5: Noise Shaping in Data Converters

B. Razavi, "The Delta-Sigma Modulator [A Circuit for All Seasons]," IEEE Solid-State Circuits Magazine, Volume. 8, Issue. 20, pp. 10-15, Spring 2016. [http://www.seas.ucla.edu/brweb/papers/Journals/BRSpring16DeltaSigma.pdf]

P. M. Aziz, H. V. Sorensen and J. vn der Spiegel, "An overview of sigma-delta converters," in IEEE Signal Processing Magazine, vol. 13, no. 1, pp. 61-84, Jan. 1996 [https://sci-hub.st/10.1109/79.482138]


Richard E. Schreier, ECE 1371 Advanced Analog Circuits - 2015 [http://individual.utoronto.ca/schreier/ece1371-2015.html]

Gabor C. Temes. ECE 627-Oversampled Delta-Sigma Data Converters [https://classes.engr.oregonstate.edu/eecs/spring2017/ece627/lecturenotes.html]

Joshua Reiss. Understanding sigma delta modulation: the solved and unsolved issues

[https://www.eecs.qmul.ac.uk/~josh/documents/2008/Reiss-JAES-UnderstandingSigmaDeltaModulation-SolvedandUnsolvedIssues.pdf]

V. Medina, P. Rombouts and L. Hernandez-Corporales, "A Different View of Sigma-Delta Modulators Under the Lens of Pulse Frequency Modulation [Feature]," in IEEE Circuits and Systems Magazine, vol. 24, no. 2, pp. 80-97, Secondquarter 2024

Carsten Wulff , Oversampling and Sigma-Delta ADCs [https://analogicus.com/aic2026/oversampling_and_sigma-delta_adcs]

PDM Microphones and Sigma-Delta A/D Conversion [https://tomverbeure.github.io/2020/10/04/PDM-Microphones-and-Sigma-Delta-Conversion.html]

image-20260802151919963

image-20260802152509229

Noise Analysis

image-20250526201936387


image-20250526195323660


sampling (amplification) phase

image-20250526195656447

Noise Simulation

PSS + Pnoise Method

Comparator Output SNR during sampling region and decision region go up

Comparator Output SNR during regeneration region is constant, where noise is critical

image-20250526221529514

image-20241109163928889



Ashish Patni , Sampled(Jitter) noisetype in Pnoise/Hbnoise analysis[https://community.cadence.com/cfs-file/__key/communityserver-discussions-components-files/38/Sampled_2800_Jitter_2900_-noisetype-in-Pnoise_5F00_1.pdf]

by Edge Crossing

image-20260801002320031

by Sampled Phase

image-20260801002609577

image-20260801002643868

Transient Noise Method

Noise Fmax sets the bandwidth of the random noise sources that are injected at each time point in the transient analysis


image-20241109154249513

We can identify the RMS noise value easily by looking at 15.9% or 84.1% of CDF (\(1\sigma\)), the input-referred noise in the RMS is 0.9mV

image-20241109160311684

Thus, if \(V_S\) is chosen so as to reduce the probability of zeros to 16%, then \(V_S = 1\sigma\), which is also the total root-mean square (rms) noise referred to the input.

Comparison of two methods

image-20250526225952590

here, fundamental frequency = fclk; integrated noise (0 ~ 0.5fclk)

image-20250526230126010

E. Gillen, G. Panchanan, B. Lawton and D. O'Hare, "Comparison of transient and PNOISE simulation techniques for the design of a dynamic comparator," 2022 33rd Irish Signals and Systems Conference (ISSC), Cork, Ireland, 2022, pp. 1-5

Chenguang Yang, "Comparator Design for High Speed ADC" [https://lup.lub.lu.se/luur/download?func=downloadFile&recordOId=9164380&fileOId=9164388]

J. Conrad, J. Kauffman, S. Wilhelmstatter, R. Asthana, V. Belagiannis and M. Ortmanns, "Confidence Estimation and Boosting for Dynamic-Comparator Transient-Noise Analysis," 2024 22nd IEEE Interregional NEWCAS Conference (NEWCAS), Sherbrooke, QC, Canada, 2024, pp. 1-5

There are some ambiguity in formula in ADC Verification Rapid Adoption Kit (RAK)(Product Version: IC 6.1.8, SPECTRE 18.1 March, 2019)

  • Transient Noise Analysis: \(\sqrt{2}\sigma\), why ratio \(\sqrt{2}\) ???
  • PSS+Pnoise: why two fundamental tones fclk/2 ???

Common-Mode (Vcmi) Variation Effects

image-20240925225059596

image-20240925225823184


image-20250527202331008


Zhaokai Liu. Time-interleaved SAR ADC Design Using Berkeley Analog Generator [https://www2.eecs.berkeley.edu/Pubs/TechRpts/2020/EECS-2020-109.pdf]

image-20250609224554118


L. Kull et al., "A 3.1 mW 8b 1.2 GS/s Single-Channel Asynchronous SAR ADC With Alternate Comparators for Enhanced Speed in 32 nm Digital SOI CMOS," in IEEE Journal of Solid-State Circuits, vol. 48, no. 12, pp. 3049-3058, Dec. 2013 [https://sci-hub.jp/10.1109/JSSC.2013.2279571]

P. Nuzzo, F. De Bernardinis, P. Terreni and G. Van der Plas, "Noise Analysis of Regenerative Comparators for Reconfigurable ADC Architectures," in IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 55, no. 6, pp. 1441-1454, July 2008 [https://sci-hub.jp/10.1109/TCSI.2008.917991]

image-20260906141852047

offset simulation

T. Caldwell. ECE 1371S Advanced Analog Circuits [http://individual.utoronto.ca/trevorcaldwell/course/comparators.pdf]

Eric Chang. EECS240-s18 Discussion 9


image-20241109092310123

Graupner, Achim & Sobe, Udo. (2007). Offset-Simulation of Comparators. [https://designers-guide.org/analysis/comparator.pdf]

1
2
3
4
Comment on "Offset-Simulation of Comparators"

If the input referred offset follows a normal distribution than it is sufficient to apply a single offset voltage to calculate the offset voltage.
See details in Razavi, B., The StrongARM Latch [A Circuit for All Seasons], IEEE Solid-State Circuits Magazine, Volume:7, Issue: 2, Spring 2015

Omran, Hesham. (2019). Fast and accurate technique for comparator offset voltage simulation. Microelectronics Journal. 89. 10.1016/j.mejo.2019.05.004.

Matthews, Thomas W. and Perry L. Heedley. “A simulation method for accurately determining DC and dynamic offsets in comparators.” 48th Midwest Symposium on Circuits and Systems, 2005. (2005): 1815-1818 Vol. 2. [https://athena.ecs.csus.edu/~pheedley/MSDL/MSDL_DOTB_cmp_test_bench_MWSCAS05.pdf]

Hysteresis

P. Bruschi: Notes on Mixed Signal Design [https://docenti.ing.unipi.it/~a008309/mat_stud/MIXED/2023/Slides_pdf/18_Comparators__1_Dei.pdf]

TODO 📅

image-20260802151532829



A simple comparator based on the 4-transistor hysteresis cell

image-20260806223447008

Kickback

Paolo Bruschi , Design of Mixed Signal Circuits and Systems [https://docenti.ing.unipi.it/~a008309/mat_stud/MIXED/2023/Slides_pdf/19_Comparators_2_Dei.pdf]

CC Chen, Why Sampler Kickback Matters in SerDes? [https://youtu.be/LIr0fqBk3Gg]

image-20260802160529593

image-20260802160628231

image-20260802161953860


Kickback noise trades with the dimensions of the input transistors and hence with the offset voltage

  • affects the comparator's own decision
  • corrupts the input voltage while it is sensed by other circuits

image-20241110004944542

Tetsuya Iizuka,VLSI2021_Workshop3 "Nyquist A/D Converter Design in Four Days"

Figueiredo, Pedro & Vital, João. (2006). Kickback noise reduction techniques for CMOS latched comparators. Circuits and Systems II: Express Briefs, IEEE Transactions on. 53. 541 - 545. 10.1109/TCSII.2006.875308. [https://sci-hub.se/10.1109/TCSII.2006.875308]

P. M. Figueiredo and J. C. Vital, "Low kickback noise techniques for CMOS latched comparators," 2004 IEEE International Symposium on Circuits and Systems (ISCAS), Vancouver, BC, Canada, 2004, pp. I-537 [https://sci-hub.se/10.1109/ISCAS.2004.1328250]

Lei, Ka Meng & Mak, Pui-In & Martins, R.P.. (2013). Systematic analysis and cancellation of kickback noise in a dynamic latched comparator. Analog Integrated Circuits and Signal Processing. 77. 277-284. 10.1007/s10470-013-0156-1. [https://rto.um.edu.mo/wp-content/uploads/docs/ruimartins_cv/publications/journalpapers/57.pdf]

O. M. Ívarsson, "Comparator Kickback Reduction Techniques for High-Speed ADCs," Dissertation, 2024. [https://liu.diva-portal.org/smash/get/diva2:1872476/FULLTEXT01.pdf]


Current mirrors are used between stages to reduce charge kick back from the logic level swing of the latch onto the small comparator input capacitors

Mike Shuo-Wei Chen and R. W. Brodersen, "A 6-bit 600-MS/s 5.3-mW Asynchronous ADC in 0.13-μm CMOS," in IEEE Journal of Solid-State Circuits, vol. 41, no. 12, pp. 2669-2680, Dec. 2006 [pdf, slides]

K. Bult and A. Buchwald, "An embedded 240-mW 10-b 50-MS/s CMOS ADC in 1-mm/sup 2/," in IEEE Journal of Solid-State Circuits, vol. 32, no. 12, pp. 1887-1895, Dec. 1997 [https://sci-hub.st/10.1109/4.643647]

image-20260802160729730

CMOS Latch

TODO 📅

image-20241215162321832 \[ V_{o,fb}^+ - V_{o,fb}^- = \frac{g_m}{sC_L}(V_o^+ - V_o^-) = A(s)\cdot(V_o^+ - V_o^-) \]

We have \[ A(s)\cdot (V_{i} + V_o) = V_o \]

that is \[ V_o = \frac{A(s)}{1-A(s)}V_{i} = \frac{1}{s - g_m/C_L}\cdot \frac{g_mV_i}{C_L} \]

therefore \[ V_o(t) = \frac{g_mV_i}{C_L}\cdot\exp\left({\frac{g_m}{C_L}t}\right) = V_o(t=0)\cdot\exp\left({\frac{g_m}{C_L}t}\right) \] image-20241215173645188

Asad Abidi, ISSCC 2023: Circuit Insights "The CMOS Latch" [https://youtu.be/sVe3VUTNb4Q]

Metastability

TODO 📅

If the comparator can not generate a well-defined logical output in half of the clock period, we say the circuit is "metastable"

image-20241215162430509

Mathematical Preliminaries

Relating \(\Phi\) and erf

Error Function (Erf) of the standard Normal distribution \[ \text{Erf}(x) = \frac{2}{\sqrt{\pi}}\int_0^x e^{-t^2} \mathrm{d}t. \] Cumulative Distribution Function (CDF) of the standard Normal distribution \[ \Phi(x) = \frac{1}{\sqrt{2\pi}}\int_{-\infty}^x e^{-z^2/2} \mathrm{d}z. \]

Figure

\[\begin{align} \Phi(x) &= \frac{\text{Erf}(x/\sqrt{2})+1}{2}. \\ \Phi(x\sqrt{2}) &= \frac{\text{Erf}(x) + 1}{2} \end{align}\]

Considering the mean and standard deviation \[ \Phi(x,\mu,\sigma)=\frac{1}{2}\left( 1+\text{Erf} \left( \frac{x-\mu}{\sigma\sqrt{2}} \right)\right) \]


image-20241109135425126

John D. Cook. Relating Φ and erf [https://www.johndcook.com/erf_and_normal_cdf.pdf]

reference

Xu, H. (2018). Mixed-Signal Circuit Design Driven by Analysis: ADCs, Comparators, and PLLs. UCLA. ProQuest ID: Xu_ucla_0031D_17380. Merritt ID: ark:/13030/m5f52m8x. Retrieved from [https://escholarship.org/uc/item/88h8b5t3]

A. Abidi and H. Xu, "Understanding the Regenerative Comparator Circuit," Proceedings of the IEEE 2014 Custom Integrated Circuits Conference, San Jose, CA, 2014, pp. 1-8. [https://picture.iczhiku.com/resource/ieee/WHiYwoUjPHwZPXmv.pdf]

T. Sepke, P. Holloway, C. G. Sodini and H. -S. Lee, "Noise Analysis for Comparator-Based Circuits," in IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 56, no. 3, pp. 541-553, March 2009 [https://dspace.mit.edu/bitstream/handle/1721.1/61660/Speke-2009-Noise%20Analysis%20for%20Comparator-Based%20Circuits.pdf]

Sepke, Todd. "Comparator design and analysis for comparator-based switched-capacitor circuits." (2006). [https://dspace.mit.edu/handle/1721.1/38925]

P. Nuzzo, F. De Bernardinis, P. Terreni and G. Van der Plas, "Noise Analysis of Regenerative Comparators for Reconfigurable ADC Architectures," in IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 55, no. 6, pp. 1441-1454, July 2008 [https://picture.iczhiku.com/resource/eetop/SYirpPPPaAQzsNXn.pdf]


J. Kim, B. S. Leibowitz, J. Ren and C. J. Madden, "Simulation and Analysis of Random Decision Errors in Clocked Comparators," in IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 56, no. 8, pp. 1844-1857, Aug. 2009, doi: 10.1109/TCSI.2009.2028449. URL:https://people.engr.tamu.edu/spalermo/ecen689/simulation_analysis_clocked_comparators_kim_tcas1_2009.pdf

J. Kim, B. S. Leibowitz and M. Jeeradit, "Impulse sensitivity function analysis of periodic circuits," 2008 IEEE/ACM International Conference on Computer-Aided Design, 2008, pp. 386-391, doi: 10.1109/ICCAD.2008.4681602. [https://websrv.cecs.uci.edu/~papers/iccad08/PDFs/Papers/05C.2.pdf]

Jaeha Kim, Lecture 12. Aperture and Noise Analysis of Clocked Comparators URL:https://ocw.snu.ac.kr/sites/default/files/NOTE/7038.pdf

Sam Palermo. ECEN720: High-Speed Links Circuits and Systems Spring 2023 Lecture 6: RX Circuits [https://people.engr.tamu.edu/spalermo/ecen689/lecture6_ee720_rx_circuits.pdf]


Y. Luo, A. Jain, J. Wagner and M. Ortmanns, "Input Referred Comparator Noise in SAR ADCs," in IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 66, no. 5, pp. 718-722, May 2019. [https://sci-hub.se/10.1109/TCSII.2019.2909429]

X. Tang et al., "An Energy-Efficient Comparator With Dynamic Floating Inverter Amplifier," in IEEE Journal of Solid-State Circuits, vol. 55, no. 4, pp. 1011-1022, April 2020 [https://sci-hub.se/10.1109/JSSC.2019.2960485]

Chen, Long & Sanyal, Arindam & Ma, Ji & Xiyuan, Tang & Sun, Nan. (2016). Comparator Common-Mode Variation Effects Analysis and its Application in SAR ADCs. 10.1109/ISCAS.2016.7538972. [https://labs.engineering.asu.edu/mixedsignals/wp-content/uploads/sites/58/2017/08/ISCAS_comp_long_2016.pdf]

V. Stojanovic, and V. G. Oklobdzija, "Comparative Analysis of Master–Slave Latches and Flip-Flops for High-Performance and Low-Power Systems," IEEE J. Solid-State Circuits, vol. 34, pp. 536–548, April 1999. [https://www.ece.ucdavis.edu/~vojin/CLASSES/EEC280/Web-page/papers/Clocking/Vlada-Latches-JoSSC-Apr-1999.pdf]

C. Mangelsdorf, "Metastability: Deeply misunderstood [Shop Talk: What You Didn’t Learn in School]," in IEEE Solid-State Circuits Magazine, vol. 16, no. 2, pp. 8-15, Spring 2024

Rabuske, Taimur & Fernandes, Jorge. (2014). Noise-aware simulation-based sizing and optimization of clocked comparators. Analog Integr. Circuits Signal Process.. 81. 723-728. 10.1007/s10470-014-0428-4. [https://sci-hub.se/10.1007/s10470-014-0428-4]

Rabuske, Taimur & Fernandes, Jorge. (2016). Charge-Sharing SAR ADCs for Low-Voltage Low-Power Applications. 10.1007/978-3-319-39624-8.


Masaya Miyahara, Yusuke Asada, Daehwa Paik and Akira Matsuzawa, "A low-noise self-calibrating dynamic comparator for high-speed ADCs," 2008 IEEE Asian Solid-State Circuits Conference, Fukuoka, Japan, 2008 [slides, paper]

Art Schaldenbrand, Senior Product Manager, Keeping Things Quiet: A New Methodology for Dynamic Comparator Noise Analysis URL:https://www.cadence.com/content/dam/cadence-www/global/en_US/videos/tools/custom-_ic_analog_rf_design/NoiseAnalyisposting201612Chalk%20Talk.pdf


B. Razavi, "The Design of a Comparator [The Analog Mind]," IEEE Solid-State Circuits Magazine, Volume. 12, Issue. 4, pp. 8-14, Fall 2020. [https://www.seas.ucla.edu/brweb/papers/Journals/BR_SSCM_4_2020.pdf]

—, "The StrongARM Latch [A Circuit for All Seasons]," IEEE Solid-State Circuits Magazine, Issue. 2, pp. 12-17, Spring 2015. [https://www.seas.ucla.edu/brweb/papers/Journals/BR_Magzine4.pdf]

B. Murmann. ISSCC 2011 Tutorial: Noise Analysis in Switched Capacitor Circuits [slides, transcription]

—, "Thermal Noise in Track-and-Hold Circuits: Analysis and Simulation Techniques," IEEE Solid-State Circuits Magazine, vol. 4, no. 2, pp. 46-54, June 2012 [https://sci-hub.se/10.1109/MSSC.2012.2192190]

X. Huang. Thermal noise analysis of switched-capacitor amplifier [theory, simulation]

CHUNG-CHUN (CC) CHEN. Why A Dedicated Noise Analysis for A Strong-arm Latch / Comparator? [https://youtu.be/S5GnvFxuxUA]

—. Why Transient Noise (Trannoise) Analysis for A Strong-arm Latch / Comparator? [https://youtu.be/gpQggSM9_PE]

—. Why A Periodic Steady-State (PSS), Periodic Noise (Pnoise), and Hand Calculation for A Sampler? [https://youtu.be/lGqCfg5R-rY]

Tony Chan Carusone,. 28 Comparator Specs and Characterization [https://youtu.be/mRfWM1bpr3k]

Prof. Seung-Tak Ryu (KAIST) "Advanced ADC Design Techniques" Online Course (2022) : Dynamic Latch [https://youtu.be/zE1ZdG_XzWk]

IC宇宙成长记. 动态比较器噪声仿真 [link]

Raised Cosine

Equations for the Raised Cosine and Square-Root Raised Cosine Shapes [https://engineering.purdue.edu/~ee538/SquareRootRaisedCosine.pdf]

Pulse Shaping Filter [https://wirelesspi.com/pulse-shaping-filter/]

image-20260415222452201

Feature Raised Cosine (RC) Root Raised Cosine (RRC)
ISI Property Satisfies Nyquist ISI criterion (zero crossings at \(t = \pm nT\)) Does not satisfy ISI criterion on its own
Zero Crossings Crosses zero at every integer multiple of \(T\) Zero crossings are not periodic at \(T\)
Usage Resulting pulse after the whole system Used at both transmitter and receiver (matched filter)
Decay Rate Faster decay in the time domain Slower decay compared to RC
Peak Value Normalized to 1 at \(t=0\) Often normalized so that \(\int |h(t)|^2 dt = 1\)

image-20260415222534835


Why Root Raised Cosine (RRC) Used at both transmitter and receiver ?

image-20260415223127685

Toeplitz matrix

Robert M. Gray, Toeplitz and Circulant Matrices: A review [https://ee.stanford.edu/~gray/toeplitz.pdf]

toeplitz Toeplitz matrix, [https://www.mathworks.com/help/matlab/ref/toeplitz.html]

image-20260314123213083


ZFS

image-20260314125127698

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
h = [0.01 -0.02 0.05 -0.1 0.2 1 0.15 -0.15 0.05 -0.02 0.005];
[val, idx] = max(h);

htc = h(idx-2:idx+2)';

H1 = [1 0.2 -0.1 0.05 -0.02;
0.15 1 0.2 -0.1 0.05;
-0.15 0.15 1 0.2 -0.1;
0.05 -0.15 0.15 1 0.2;
-0.02 0.05 -0.15 0.15 1];

c = [1 0.15 -0.15 0.05 -0.02];
r = fliplr([-0.02 0.05 -0.1 0.2 1]);
T = toeplitz(c, r);

isequal(H1, T) % logical 1

inv(T)
%
% ans =
%
% 1.0774 -0.2682 0.1932 -0.1314 0.0806
% -0.2266 1.1272 -0.2983 0.2034 -0.1314
% 0.2326 -0.2737 1.1517 -0.2983 0.1932
% -0.1405 0.2516 -0.2737 1.1272 -0.2682
% 0.0888 -0.1405 0.2326 -0.2266 1.0774

MMSE

image-20260314115828173

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
h=[0.004, 0.0010, 0.0023, 0.0052, 0.0812, 0.3437, 0.1775, 0.0917, 0.0526,...
0.0360, 0.0224, 0.0162, 0.0152, 0.0097, 0.0090, 0.0067];

k = length(h);
n = 3;
l = 1;
m2 = 5;
m1 = 1;

H = zeros([k+n+l-2, n+l-1]);
H(1:end-2,1) = h;
H(2:end-1,2) = h;
H(3:end,3) = h;

c = zeros(length(h)+2, 1);
c(1:end-2) = h;
r = zeros(3, 1);
r(1) = h(1);

T = toeplitz(c, r);

isequal(H, T) % logical 1

transpose(toeplitz(c,r)) is same with toeplitz(r,c)

1
isequal(transpose(toeplitz(c, r)), toeplitz(r, c)) % logical 1

V. Stojanovic, "Channel-Limited High-Speed Links: Modeling, Analysis and Design," PhD. Thesis, Stanford University, Sep. 2004. [pdf]

image-20260314134616818

image-20260314134258739

Bandpass Modulation

image-20260308134006414

Pulse Amplitude Modulation (PAM)

David A. Johns, ECE1392H - Integrated Circuits for Digital Communications - Fall 2001 [System Overview]

image-20260302223217156

image-20260302223247382

\(S_m\) Google AI mode [https://share.google/aimode/BzYr2logpVTVs83LQ]

1
2
3
4
5
6
snr_mpam = @(m,simga) 10*log10((4^m-1)/simga^2/3);

sigma = 0.1547;

SNR_m2 = snr_mpam(2, sigma); % 23.1999
SNR_m3 = snr_mpam(3, sigma); % 29.4324

Lecture 3, Tuesday January 13th 2026 - Modulation Types (PAM/QAM) [https://cioffi-group.stanford.edu/ee379a/Lectures/L3.pdf]

image-20260308110418448


image-20260308110557392

Carrier & Symbol Synchronization

image-20260308143452122

\(\Delta\tau \lt \pm \frac{1}{100} T\) don't ensure \(\Delta \phi \ll 2\pi\) due to \(T \gg \frac{1}{f_c}\)

image-20260308144246973

Carrier Synchronization

image-20260308094928314

image-20260308095105635


[https://ndl.ethernet.edu.et/bitstream/123456789/87843/14/LECT_13%2614.Synchronization.pdf]

image-20260308101114543

image-20260308101312037

Symbol Synchronization

image-20260308150119546

[https://www.ieee802.org/3/dm/public/1125/cordaro_3dm_01_1125.pdf]

image-20260308160850433


Mathuranathan, Symbol Timing Recovery for QPSK (digital modulations) [https://www.gaussianwaves.com/2013/11/symbol-timing-recovery-for-qpsk-digital-modulations/]

Qasim Chaudhari. Early-Late Bit Synchronizer in Digital Communication [https://wirelesspi.com/early-late-bit-synchronizer-in-digital-communication/]

Igor Freire. Symbol Timing Synchronization: A Tutorial [blog, code]

BPSK synchronization Matlab

But the problem here is: "How does the receiver know the ideal sampling instants?". The solution is "someone has to supply those ideal sampling instants". A symbol time recovery circuit is used for this purpose.

Synchronization in receiver with timing recovery, matched filter for QPSK

Early/Late Symbol Recovery algorithm

  • non-decision-directed timing estimator exploits the symmetry properties of the signal

Early late synchronization

  1. If the Early Sample = Late Sample : The peak occurs at the on-time sampling instant \(T\). No adjustment in the timing is needed.
  2. If |Early Sample| > |Late Sample| : Late timing, the sampling time is offset so that the next symbol is sampled \(T-\delta/2\) seconds after the current sampling time.
  3. If |Early Sample| < |Late Sample| : Early timing, the sampling time is offset so that the next symbol is sampled \(T+\delta/2\) seconds after the current sampling time.

David Johns. ECE1392H - Integrated Circuits for Digital Communications - Fall 2001: [Timing Recovery]

Dither in Quantized Zero Crossing Detection (QZCD) (so-called 'Bang Bang' Phase Detector)

image-20260303212351804

Mueller and Muller Timing Synchronization

K. Mueller and M. Muller, "Timing Recovery in Digital Synchronous Data Receivers," in IEEE Transactions on Communications, vol. 24, no. 5, pp. 516-531, May 1976 [pdf]

Qasim Chaudhari. Mueller and Muller Timing Synchronization Algorithm [https://wirelesspi.com/mueller-and-muller-timing-synchronization-algorithm/]

Eduardo Fuentetaja. "Analysis of the M&M Clock Recovery Algorithm" [https://edfuentetaja.github.io/sdr/m_m_analysis/]

C.-P. Tzeng, D. Hodges and D. Messerschmitt, "Timing Recovery in Digital Subscriber Loops Using Baud-Rate Sampling," in IEEE Journal on Selected Areas in Communications, vol. 4, no. 8, pp. 1302-1311, November 1986 [pdf]

H. Meyr, M. Moeneclaey, and S. A. Fechtel. "Digital Communication Receivers: Synchronization, Channel Estimation, and Signal Processing." Wiley [pdf]

T. Musah and A. Namachivayam, "Robust Timing Error Detection for Multilevel Baud-Rate CDR," in IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 69, no. 10, pp. 3927-3939, Oct. 2022 [https://sci-hub.jp/10.1109/TCSI.2022.3191740]

Fulvio Spagna, CICC2018 Clock and Data Recovery Systems [pdf]

TODO 📅

Intersymbol Interference (ISI)

L.W. Couch, Digital and Analog Communication Systems, 8th Edition, Pearson, 2013. [pdf]

image-20260226224415849

image-20260226225158225

Nyquist discovered three different methods for pulse shaping that could be used to eliminate ISI

  • Nyquist's First Method (Zero ISI): physically unrealizable (i.e., the impulse response would be noncausal and of infinite duration), inaccurate sync will cause ISI

    image-20260301165125997

  • Nyquist's second method: allows some ISI to be introduced in a controlled way

  • Nyquist's third method: area under the \(h_e(t)\) pulse within the desired symbol interval, \(T_s\), is not zero, but the areas under \(h_e(t)\) in adjacent symbol intervals are zero

Nyquist Criterion & Pulses

David A. Johns, ECE1392H - Integrated Circuits for Digital Communications - Fall 2001 [System Overview]

image-20260301175835124

image-20260301171631609

image-20260301165454919

Matched-Filter (MF)

David A. Johns, ECE1392H - Integrated Circuits for Digital Communications - Fall 2001 [System Overview]

image-20260301175451088

image-20260301175553715


image-20260301175653355

Noise Enhancement in Linear Equalizers

John M. Cioffi, Lecture 13, Thursday February 19th 2026 - Intersymbol Interference, MMSE, and SNR [https://cioffi-group.stanford.edu/ee379a/Lectures/L13.pdf]

—, Lecture 14, Tuesday February 24th 2026 - Linear Equalizers [https://cioffi-group.stanford.edu/ee379a/Lectures/L14.pdf]

image-20260226223722288

image-20260226223806023

Shannon–Hartley theorem

image-20260226231916346

image-20260226225540962


David A. Johns, ECE1392H - Integrated Circuits for Digital Communications - Fall 2001 [Introduction]

image-20260301174746547

image-20260301174712835

LMS & its Quantized-Error Algorithms

Bruno Lima, Adaptive filtering in Python Implementations based on Adaptive Filtering: Algorithms and Practical Implementation (Paulo S. R. Diniz). [https://github.com/BruninLima/PydaptiveFiltering]

image-20260401210526151

\[\begin{align} x_k &= [x[k], x[k-1], \ldots, x[k-M]]^T \in \mathbb{C}^{M+1}\\ y[k] &= w^H[k] x_k, \qquad e[k] = d[k] - y[k], \end{align}\]



LMS algorithm

image-20260317224545818 \[ w[k+1] = w[k] + \mu\, e^*[k] \, x_k. \]

1
2
3
4
if w_init is not None:
self.w: np.ndarray = np.asarray(w_init, dtype=self._dtype)
else:
self.w = np.zeros(self.filter_order + 1, dtype=self._dtype)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
x: np.ndarray = np.asarray(input_signal, dtype=complex).ravel()
d: np.ndarray = np.asarray(desired_signal, dtype=complex).ravel()

n_samples: int = int(x.size)
m: int = int(self.filter_order)

outputs: np.ndarray = np.zeros(n_samples, dtype=complex)
errors: np.ndarray = np.zeros(n_samples, dtype=complex)

x_padded: np.ndarray = np.zeros(n_samples + m, dtype=complex)
x_padded[m:] = x

for k in range(n_samples):
x_k: np.ndarray = x_padded[k : k + m + 1][::-1]

y_k: complex = complex(np.vdot(self.w, x_k))
outputs[k] = y_k

e_k: complex = d[k] - y_k
errors[k] = e_k

self.w = self.w + self.step_size * np.conj(e_k) * x_k


Sign-Data Algorithm \[ w[k+1] = w[k] + 2\mu\, e^*[k] \, \operatorname{sign}(x_k) \]

1
2
3
4
5
6
7
8
9
10
11
12
for k in range(n_samples):
x_k = x_padded[k : k + m + 1][::-1]

y_k = complex(np.vdot(self.w, x_k))
outputs[k] = y_k

e_k = d[k] - y_k
errors[k] = e_k

sign_xk = np.sign(x_k)

self.w = self.w + (2.0 * self.step_size) * np.conj(e_k) * sign_xk


sign–sign algorithm

image-20260317230938532

reference

Proakis, John G., and Masoud Salehi. Digital Communications. 5th ed. McGraw-Hill, 2008. [pdf]

Sklar, Bernard. Digital communications: fundamentals and applications. Pearson, 2021.

Ling, F. (2017). Synchronization in Digital Communication Systems. Cambridge: Cambridge University Press.

Barry, John R., Edward A. Lee, and David G. Messerschmitt. Digital communication. Springer, 2003.

Qasim Chaudhari, Wireless Communications From the Ground Up – An SDR Perspective

John M. Cioffi, [Chapter 3 - Equalization], [Chapter 6 - Fundamentals of Synchronization]

Sen M. Kuo. Real-Time Digital Signal Processing: Fundamentals, Implementations and Applications, 3rd Edition. John Wiley & Sons 2013

Stankovic, Ljubisa. (2015). Digital Signal Processing with Selected Topics.


Paulo S. R. Diniz, Adaptive Filtering: Algorithms and Practical Implementation, 5th edition [pdf], [matlab], [python]

B. Farhang-Boroujeny (2013), Adaptive Filters: Theory and Applications (2nd ed.). John Wiley & Sons, Inc.

Simon O. Haykin (2014), "Adaptive Filter Theory" Prentice-Hall, Inc. 5rd edition


A. Chan Carusone and D. A. Johns, "Analog Filter Adaptation Using a Dithered Linear Search Algorithm," IEEE Int. Symp. Circuits and Syst., May 2002. [PDF], [Slides]

—, Ph. D. Thesis, "Digital Algorithms for Analog Adaptive Filters", Feb. 2002. [http://www.eecg.utoronto.ca/~tcc/thesis.pdf]

—, "Analog Adaptive Filters," tutorial at the IEEE Int. Symp. Circuits and Syst., Bangkok, Thailand, May 2003. [http://www.eecg.utoronto.ca/~tcc/iscas03_tutorial.pdf]

—, 2022 Optimization Tools for Future Wireline Transceivers [https://www.ieeetoronto.ca/wp-content/uploads/2022/12/UofT-Future-of-Wireline-Workshop-2022.pdf]

David Johns, "Integrated Circuits for Digital Communications" [https://www.eecg.toronto.edu/~johns/nobots/courses/ece1392/slides.pdf]


Chris Li, mmse_dfe [https://github.com/ChrisZonghaoLi/mmse_dfe]

ScottXjw, equalizer-code-FFE-DFE-VolterraFFEandDFE [https://github.com/ScottXjw/equalizer-code-FFE-DFE-VolterraFFEandDFE]


Qasim Chaudhari. Maximum Likelihood Estimation of Clock Offset [https://wirelesspi.com/maximum-likelihood-estimation-of-clock-offset/]

—. Channel Estimation in Wireless Communication. [https://wirelesspi.com/channel-estimation-in-wireless-communication/]

—. Phase Locked Loop (PLL) in a Software Defined Radio (SDR) [https://wirelesspi.com/phase-locked-loop-pll-in-a-software-defined-radio-sdr/]

—. Phase Locked Loop (PLL) for Symbol Timing Recovery [https://wirelesspi.com/phase-locked-loop-pll-for-symbol-timing-recovery/]

—. How Decision Feedback Equalizers (DFE) Work [https://wirelesspi.com/how-decision-feedback-equalizers-dfe-work/]

—. Maximum Likelihood Sequence Estimation (MLSE Equalizer) [https://wirelesspi.com/maximum-likelihood-sequence-estimation-mlse-equalizer/]

—. Gardner Timing Error Detector: A Non-Data-Aided Version of Zero-Crossing Timing Error Detectors [https://wirelesspi.com/gardner-timing-error-detector-a-non-data-aided-version-of-zero-crossing-timing-error-detectors/]

—. Digital Filter and Square Timing Recovery [https://wirelesspi.com/digital-filter-and-square-timing-recovery/]

—. What is a Symbol Timing Offset and How It Distorts the Rx Signal [https://wirelesspi.com/what-is-a-symbol-timing-offset-and-how-it-distorts-the-rx-signal/]

—. How Excess Bandwidth Governs Timing Recovery in Digital Communication Systems [https://wirelesspi.com/how-excess-bandwidth-governs-timing-recovery-in-digital-communication-systems/]

—. How Automatic Gain Control (AGC) Works [https://wirelesspi.com/how-automatic-gain-control-agc-works/]

discrete-time frequency: \(\hat{\omega}=\omega T_s\), units are radians per sample


Below diagram show the windowing effect and sampling

NinDFT.drawio

For general window function, we know \(W(e^{j\hat{\omega}})=\frac{1}{T_s}W_c(j\frac{\hat\omega}{T_s})\),

\[ \frac{W_c(j\frac{\hat{\omega}}{T_s})X_c(j\frac{\hat{\omega}}{T_s})}{T_s}\cdot \frac{1}{2\pi} = \frac{T_sW(e^{j\hat{\omega}})X_c(j\frac{\hat\omega}{T_s})}{T_s}\cdot \frac{1}{2\pi}=W(e^{j\hat{\omega}})X_c(j\frac{\hat\omega}{T_s})\cdot \frac{1}{2\pi} \overset{\hat{\omega}=0}{\Longrightarrow} \sum_{n=-N_w}^{+N_w}w[n] \cdot X_c(j\omega)\cdot \frac{1}{2\pi} \]

e.g. \(\frac{W_c(j\omega|\omega=0)}{T_s} = N\) for Rectangular Window, shown in above figure

A finite length sequence can be considered to be an infinite length sequence multiplied by a "Rectangular Window". Also called a "Boxcar Window"

warmup

Continuous-time signals \(x_c(t)\) Discrete-time signals \(x[n]\)
Aperiodic signals Continuous Fourier transform Discrete-time Fourier transform
Periodic signals Fourier series Discrete Fourier transform

Continuous Time Fourier Series (CTFS)

\[\begin{align} a_k &= \frac{1}{T}\int_T x(t)e^{-jk(2\pi/T)) t}dt \\ x(t) &= \sum_{k=-\infty}^{+\infty}a_ke^{jk(2\pi/T) t} \end{align}\]


Let the periodic waveform \(w(t)\), with period \(T_0=2\pi/\omega_0\), have the complex Fourier series \[ w(t)=\sum_{\ell=-\infty}^{\infty}W[\ell]e^{j\ell\omega_0t}. \] We want the Fourier coefficients of \[ w(t)\sin(\omega_0t) \quad\text{and}\quad w(t)\cos(\omega_0t). \]

Multiplication by \(\sin(\omega_0t)\)

Use \[ \sin(\omega_0t) = \frac{e^{j\omega_0t}-e^{-j\omega_0t}}{2j}. \] Then \[ \begin{aligned} w(t)\sin(\omega_0t) &= \left(\sum_{\ell=-\infty}^{\infty} W[\ell]e^{j\ell\omega_0t}\right) \frac{e^{j\omega_0t}-e^{-j\omega_0t}}{2j} \\[4pt] &= \frac{1}{2j} \sum_{\ell=-\infty}^{\infty} W[\ell] \left[ e^{j(\ell+1)\omega_0t} - e^{j(\ell-1)\omega_0t} \right]. \end{aligned} \] Now collect the coefficient multiplying \(e^{jk\omega_0t}\).

For the first term, \[ k=\ell+1 \quad\Longrightarrow\quad \ell=k-1, \] so its coefficient is \(W[k-1]\).

For the second term, \[ k=\ell-1 \quad\Longrightarrow\quad \ell=k+1, \] so its coefficient is \(W[k+1]\).

Therefore, \[ \boxed{ w(t)\sin(\omega_0t) = \sum_{k=-\infty}^{\infty} \frac{W[k-1]-W[k+1]}{2j} e^{jk\omega_0t} } \] and the Fourier coefficient is \[ \color{blue}\boxed{ \left[w(t)\sin(\omega_0t)\right]_k = \frac{W[k-1]-W[k+1]}{2j}. } \]


Multiplication by \(\cos(\omega_0t)\)

Use \[ \cos(\omega_0t) = \frac{e^{j\omega_0t}+e^{-j\omega_0t}}{2}. \] Then \[ \begin{aligned} w(t)\cos(\omega_0t) &= \left(\sum_{\ell=-\infty}^{\infty} W[\ell]e^{j\ell\omega_0t}\right) \frac{e^{j\omega_0t}+e^{-j\omega_0t}}{2} \\[4pt] &= \frac{1}{2} \sum_{\ell=-\infty}^{\infty} W[\ell] \left[ e^{j(\ell+1)\omega_0t} + e^{j(\ell-1)\omega_0t} \right]. \end{aligned} \] Collecting the coefficient of \(e^{jk\omega_0t}\), \[ \boxed{ w(t)\cos(\omega_0t) = \sum_{k=-\infty}^{\infty} \frac{W[k-1]+W[k+1]}{2} e^{jk\omega_0t}. } \] Therefore, \[ \color{blue}\boxed{ \left[w(t)\cos(\omega_0t)\right]_k = \frac{W[k-1]+W[k+1]}{2}. } \]

Continuous-Time Fourier transform (CTFT)

\[\begin{align} X(j\omega) &=\int_{-\infty}^{+\infty}x(t)e^{-j\omega t}dt \\ x(t)&= \frac{1}{2\pi}\int_{-\infty}^{+\infty}X(j\omega)e^{j\omega t}d\omega \end{align}\]

[https://www.rose-hulman.edu/class/ee/yoder/ece380/Handouts/Fourier%20Transform%20Tables%20w.pdf]

image-20240831104459715


Fourier Xform of Periodic Functions [https://lpsa.swarthmore.edu/Fourier/Xforms/FXPeriodic.html]

Fourier Transform of Fourier Series Representation \[ \boxed{x_T(t) = \sum_{n=-\infty}^{+\infty} c_n e^{j n \omega_0 t}\qquad X_T(\omega) = 2\pi \sum_{n=-\infty}^{+\infty} c_n \delta(\omega - n \omega_0)} \]

Discrete-Time Fourier Transform (DTFT)

\[\begin{align} X(e^{j\hat{\omega}}) &=\sum_{n=-\infty}^{+\infty}x[n]e^{-j\hat{\omega} n} \\ x[n] &= \frac{1}{2\pi}\int_{2\pi}X(e^{j\hat{\omega}})e^{j\hat{\omega} n}d\hat{\omega} \end{align}\]

DTFT is defined for infinitely long signals as well as finite-length signal

DTFT is continuous in the frequency domain

We could verify that is the correct inverse DTFT relation by substituting the definition of the DTFT and rearranging terms


image-20240831152155093

Discrete-Time Fourier Series (DTFS)

TODO 📅

Discrete Fourier Series (DFS)

TODO 📅

Discrete Fourier Transform (DFT)

Two steps are needed to change the DTFT sum into a computable form:

  1. the continuous frequency variable \(\hat{\omega}\) must be sampled
  2. the limits on the DTFT sum must be finite

\[\begin{align} X[k] &= \sum_{n=0}^{N-1}x[n]e^{-j(2\pi/N)kn}\space\space\space k=0,1,...,N-1 \\ x[n] &= \frac{1}{N}\sum_{k=0}^{N-1}X[k]e^{j(2\pi/N)kn} \space\space\space n=0,1,...,N-1 \end{align}\]

Part of the proof is given by the following step:

image-20240830222204470


DFT \(X[k]\) is a sampled version of the DTFT \(X(e^{j\hat{\omega}})\), with the \(k\)-th sampled digital frequency, \(\hat{\omega}_k = \frac{2\pi k}{N}\) \[ \boxed{X[k] = X(e^{j\hat{\omega}})\bigg|_{\hat{\omega}=\hat{\omega}_k}, \qquad \hat{\omega}_k = \frac{2\pi k}{N}, \qquad k=0,1,\dots,N-1} \]

DTFT vs DFT

Schuller, Gerald. 2026. Multirate Signal Processing with Examples in Python. Cham: Springer Nature Switzerland.

image-20260627081612130

impulse train

CTFT:

image-20240830224755336

image-20240911221811991

using time-sampling property

impulse_train.drawio


DTFT:

Given \(x[n]=\sum_{k=-\infty}^{\infty}\delta(n-k)\)

\[\begin{align} X(e^{j\hat{\omega}}) &= X_s(j\frac{\hat{\omega}}{T}) \\ &= \frac{2\pi}{T}\sum_{k=-\infty}^{\infty}\delta(\frac{\hat{\omega}}{T}-\frac{2\pi k}{T}) \\ &= \frac{2\pi}{T}\sum_{k=-\infty}^{\infty}T\delta(\hat{\omega}-2\pi k) \\ &= 2\pi\sum_{k=-\infty}^{\infty}\delta(\hat{\omega}-2\pi k) \end{align}\]

[http://courses.ece.ubc.ca/359/notes/notes_part1_set4.pdf]


Fourier series of impulse train

image-20241106232432131

Dirac delta (impulse) function

image-20241013174738030

image-20241013174801954

[https://bingweb.binghamton.edu/~suzuki/Math-Physics/LN-7_Dirac_delta_function.pdf]

Topic 3 The \(\delta\)-function & convolution. Impulse response & Transfer function [https://www.robots.ox.ac.uk/~dwm/Courses/2TF_2011/2TF-N3.pdf]

image-20241122231208806


impulse scaling

\[ \delta(\alpha t)= \frac{1}{\alpha}\delta( t) \]

where \(\alpha\) is scaling ratio

doublet functions

image-20260711000834823

Multiplication

aka Modulation or Windowing Theorem

CTFT: \[ x_1(t)x_2(t)\overset{FT}{\longrightarrow}\frac{1}{2\pi}X_1(\omega)*X_2(\omega) \]


DTFT:

image-20240909215833750

Duality

image-20240921181908992

image-20240921182105935

Conjugate Symmetry

image-20240921181015717

image-20240921181258063

Parseval's Relation

CTFS

with \(f(x) = \sum_{n=-\infty}^{\infty} c_n e^{j \frac{2n\pi x}{T}}\)

\[ \frac{1}{T} \int_{0}^{T} \vert{}f(x)\vert{}^2 \, dx = \sum_{n=-\infty}^{\infty} \vert{}c_n\vert{}^2 \]


CTFT:

image-20240830230835764


DTFT:

image-20230516022936168


DFT:

image-20241214002405992

image-20241214002606672


[https://cioffi-group.stanford.edu/doc/book/chap3.pdf]

image-20260227013005040

Eigenfunctions & frequency response

Complex exponentials are eigenfunctions of LTI systems, that is,

continuous time: \(e^{j\omega t}\to H(j\omega)e^{j\omega t}\)

discrete time: \(e^{j\hat{\omega}n} \to H(e^{j\hat{\omega}})e^{j\hat{\omega}n}\)

where \(H(j\omega)\), \(H(e^{j\hat{\omega}})\) is frequency response of continuous-time systems and discrete-time systems, which is the function of \(\omega\) and \(\hat{\omega}\) \[\begin{align} H(j\omega) &= \int_{-\infty}^{+\infty}h(t)e^{-j\omega t}dt \\ \\ H(e^{j\hat{\omega}}) &= \sum_{n=-\infty}^{+\infty}h[n]e^{-j\hat{\omega} n} \end{align}\]

The frequency response of discrete-time LTI systems is always a periodic function of the frequency variable \(\hat{\omega}\) with period \(2\pi\)

Sampling Theorem

time-sampling theorem: applies to bandlimited signals

spectral sampling theorem: applies to timelimited signals

Aliasing

image-20260425112955664

Given below sequence \[ X[n] =A e^{j\omega T_s n} \]

  1. \(kf_s + \Delta f\)

\[\begin{align} x[n] &= Ae^{j\left( kf_s+\Delta f \right)2\pi T_sn} + Ae^{j\left( -kf_s-\Delta f \right)2\pi T_sn} \\ &= Ae^{j\Delta f\cdot 2\pi T_sn} + Ae^{-j\Delta f\cdot 2\pi T_sn} \end{align}\]

  1. \(kf_s - \Delta f\)

\[\begin{align} x[n] &= Ae^{j\left( kf_s-\Delta f \right)2\pi T_sn} + Ae^{j\left( -kf_s+\Delta f \right)2\pi T_sn} \\ &= Ae^{-j\Delta f\cdot 2\pi T_sn} + Ae^{j\Delta f\cdot 2\pi T_sn} \end{align}\]

complex signal

\[\begin{align} A e^{j(\omega_s + \Delta \omega) T_s n} &= A e^{j(k\omega_s + \Delta \omega) T_s n} \\ A e^{j(\omega_s - \Delta \omega) T_s n} &= A e^{j(k\omega_s - \Delta \omega) T_s n} \end{align}\]

sampling_aliasing.drawio


image-20260425112858854

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
from itertools import product

def samplealiasing(fsig, fs=1):
fdisp = None
N = 0

while True:
for signN, signFsig in product([-1, 1], [-1, 1]):
fdisp_n = signN*N*fs + signFsig*fsig
if fdisp_n >= 0 and fdisp_n < fs/2:
fdisp = fdisp_n
print(f"{fsig:.4f} is indistinguishable from {fdisp:.4f}, which is {'+' if signN>0 else '-'}{N} {'+' if signFsig>0 else '-'} {fsig:.4f}")
return fdisp
N += 1
if N > 100:
break
return None

for i in range(1,6):
samplealiasing(0.3125*i)

# 0.3125 is indistinguishable from 0.3125, which is -0 + 0.3125
# 0.6250 is indistinguishable from 0.3750, which is +1 - 0.6250
# 0.9375 is indistinguishable from 0.0625, which is +1 - 0.9375
# 1.2500 is indistinguishable from 0.2500, which is -1 + 1.2500
# 1.5625 is indistinguishable from 0.4375, which is +2 - 1.5625

another method inspired by [https://github.com/bmurmann/MEAD2026/blob/main/tb_boot_bottom_4.ipynb]

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
# inspired by https://github.com/bmurmann/MEAD2026/blob/main/tb_boot_bottom_4.ipynb

def samplealiasing(fsig, fs=1):
fdisp = None
fsig_wrap = fsig % fs
if fsig_wrap > fs/2:
fdisp = fs - fsig_wrap
else:
fdisp = fsig_wrap
print(f"{fsig:.4f} is indistinguishable from {fdisp:.4f}")

return fdisp

for i in range(1,6):
samplealiasing(0.3125*i)


# 0.3125 is indistinguishable from 0.3125
# 0.6250 is indistinguishable from 0.3750
# 0.9375 is indistinguishable from 0.0625
# 1.2500 is indistinguishable from 0.2500
# 1.5625 is indistinguishable from 0.4375

CTFS & CTFT

Fourier transform of a periodic signal with Fourier series coefficients \(\{a_k\}\) can be interpreted as a train of impulses occurring at the harmonically related frequencies and for which the area of the impulse at the \(k\)th harmonic frequency \(k\omega_0\) is \(2\pi\) times the \(k\)th Fourier series coefficient \(a_k\)

image-20240830225453601

inverse CTFT & inverse DTFT

time domain frequency domain
inverse CTFT \(\delta(t)\) \(\int_{\infty}d\omega\)
inverse DTFT \(\delta[n]\) \(\int_{2\pi}d\hat{\omega}\)

inverse CTFT shall integral from \(-\infty\) to \(+\infty\) to obtain \(\delta(t)\) in time domain, e.g., \(x_s(t)\) impulse train

Fourier Transform Symmetry

Lance Williams, CS 530: Geometric and Probabilistic Methods in Computer Science "Fourier Transform Symmetries" [https://www.cs.unm.edu/~williams/cs530/symmetry.pdf]

\(f(t)\) \(\mathcal{F}(s) = \int_{-\infty}^{\infty} f(t)e^{-j2\pi st} \, dt\)
odd odd
even even
real odd imaginary
real even real

image-20260709210717751

image-20260709210954471

image-20260709211059380

Half Wave Symmetry

ECEN 2633 Chapter 16: Fourier Series [http://www.jazapka.people.ysu.edu/ECEN%202633%20Chapter%2016.pdf]

image-20260426112440854


[Google AI Mode]

image-20260426111928680

Poisson summation formula

metroidman, fractional N量化噪声对系统相位噪声的影响 两种分析方法 LTI频域法和时域采样DFT法 [link]

image-20260505132033131


image-20260523111503056

  • symmetric "samples ↔︎ samples" version
  • periodization version

Let's prove the symmetric "samples ↔︎ samples" formula

image-20260523111602106

image-20260523111632471

angular frequency \(\omega\) vs Hz-frequency \(f\)

Multiplication property

image-20260606211927725

sinc function & unit rectangular pulse

image-20241002143413907

image-20250628181534951

where \(W\) is sampling frequency in Hz

sinc.drawio

image-20241002143219224


sinc function is square integrable but not absolutely integrable

periodic pulse function

Some Comments about the Pulse Function [https://lpsa.swarthmore.edu/Fourier/Series/ExFS.html#PulseUncertainty]

Fourier Transform of a Periodic Signal Described by a Fourier Series [https://lpsa.swarthmore.edu/Fourier/Xforms/FXPeriodic.html##section7]

Consider the periodic pulse function \(x_T(t) = \Pi_T \left( \frac{t}{T_p} \right)\)

Pi5(t_2)

Fourier Series Coefficients is \[ c_n = \frac{T_p}{T} \operatorname{sinc} \left( \frac{n T_p}{T} \right) \] The Fourier Transform of the function is \[ X_T(\omega) = \sum_{n=-\infty}^{+\infty} c_n 2\pi \delta(\omega - n\omega_0) \]

spectral sampling

image-20240831185532202

spectral sampling by \(\omega_0\), and \(\frac{2\pi}{\omega_0} \gt \tau\) \[ X_{n\omega_0}(\omega) = \sum_{n=-\infty}^{\infty}X(n\omega_0)\delta(\omega - n\omega_0) \] Periodic repetition of \(x(t)\) is \[ x_{n\omega_0}(t) = \frac{1}{\omega_0}\sum_{n=-\infty}^{\infty}x(t -n\frac{2\pi}{\omega_0})=\frac{T_0}{2\pi}\sum_{n=-\infty}^{\infty}x(t -nT_0) \]

Then, if \(x_{T_0} (t)\), a periodic signal formed by repeating \(x(t)\) every \(T_0\) seconds (\(T_0 \gt \tau\)​), its CTFT is \[ X_{T_0}(\omega) = \frac{2\pi}{T_0} \cdot X_{n\omega_0}(\omega) = \frac{2\pi}{T_0}\sum_{n=-\infty}^{\infty}X(n\omega_0)\delta(\omega - n\omega_0) \] Then \(x_{T_0} (t)\) can be expressed with inverse CTFT as \[\begin{align} x_{T_0} (t) &= \frac{1}{2\pi}\int_{-\infty}^{\infty}X_{T_0}(\omega)e^{j\omega t}d\omega \\ &= \frac{1}{T_0}\sum_{n=-\infty}^{\infty}X(n\omega_0)e^{jn\omega_0 t} =\sum_{n=-\infty}^{\infty}\frac{1}{T_0}X(n\omega_0)e^{jn\omega_0 t} \end{align}\]

i.e. the coefficients of the Fourier series for \(x_{T_0} (t)\) is \(D_n =\frac{1}{T_0}X(n\omega_0)\)

image-20240831190258683

alternative method by direct Fourier series

image-20240831193912709

Why DFT ?

We can use DFT to compute DTFT samples and CTFT samples

image-20240831201335531

\[ \overline{x}(t) = \sum_{n=0}^{N_0-1}x(nT)\delta(t-nT) \] applying the Fourier transform yieds \[ \overline{X}(\omega) = \sum_{n=0}^{N_0-1}x[n]e^{-jn\omega T} \] But \(\overline{X}(\omega)\), the Fourier transform of \(\overline{x}(t)\) is \(X(\omega)/T\), assuming negligible aliasing. Hence, \[ X(\omega) = T\overline{X}(\omega) = T\sum_{n=0}^{N_0-1}x[n]e^{-jn\omega T} \] and \[ X(k\omega_0) = T\sum_{n=0}^{N_0-1}x[n]e^{-jn k\omega_0 T} \] with \(\hat{\omega}_0 = \omega_0 T\) \[ X(k\omega_0) = T\sum_{n=0}^{N_0-1}x[n]e^{-jn k\hat{\omega}_0} \] i.e. the relationship between CTFT and DFT is \(X(k\omega_0) = T\cdot X[k]\), DFT is a tool for computing the samples of CTFT

C/D

Sampling with a periodic impulse train, followed by conversion to a discrete-time sequence

image-20240901155629500

image-20240830231619897

The periodic impulse train is \[ s(t) = \sum_{n=-\infty}^{\infty}\delta(t-nT) \] \(x_s(t)\) can be expressed as \[ x_s(t) = \sum_{n=-\infty}^{\infty}x_c(nT)\delta(t-nT) \] i.e., the size (area) of the impulse at sample time \(nT\) is equal to the value of the continuous-time signal at that time.

\(x_s(t)\)​ is, in a sense, a continuous-time signal (specifically, an impulse train)

samples of \(x_c(t)\) are represented by finite numbers in \(x[n]\) rather than as the areas of impulses, as with \(x_s(t)\)

Frequency-Domain Representation of Sampling

The relationship between the Fourier transforms of the input and the output of the impulse train modulator \[ X_s(j\omega) = \frac{1}{T}\sum_{k=-\infty}^{\infty}X_c(j(\omega -k\omega_s)) \] where \(\omega_s\) is the sampling frequency in radians/s


\(X(e^{j\hat{\omega}})\), the discrete-time Fourier transform (DTFT) of the sequence \(x[n]\), in terms of \(X_s(j\omega)\) and \(X_c(j\omega)\)

continuous-time Fourier transform discrete-time Fourier transform
\(x_s(t) = \sum_{n=-\infty}^{\infty}x_c(nT)\delta(t-nT)\) \(x[n]=x_c(nT)\)
\(X_s(j\omega)=\sum_{n=-\infty}^{\infty}x_c(nT)e^{-j\omega Tn}\) \(X(e^{j\hat{\omega}})=\sum_{n=-\infty}^{\infty}x_c(nT)e^{-j\hat{\omega} n}\)

\[ X(e^{j\omega T}) = \frac{1}{T}\sum_{k=-\infty}^{\infty}X_c(j(\omega-k\omega_s)) \] or equivalently, \[ X(e^{j\hat{\omega}}) = \frac{1}{T}\sum_{k=-\infty}^{\infty}X_c(j(\frac{\hat{\omega}}{T}-\frac{2\pi k}{T})) \]

\(X(e^{j\hat{\omega}})\) is a frequency-scaled version of \(X_s(j\omega)\) with the frequency scaling specified by \(\hat{\omega} =\omega T\)

Ref. 9.5 DTFT connection with the CTFT

image-20240831154638540

Here, \(\Omega = \omega T\)

The factor \(\frac{1}{T}\) in \(X(e^{j\hat{\omega}})\) is misleading, actually \(x[n]\) is not scaled by \(\frac{1}{T}\) once taking \(\hat{\omega}\) variable of integration into account \[\begin{align} x_r[n] &= \frac{1}{2\pi} \int_{2\pi}X(e^{j\hat{\omega}})e^{j\hat{\omega} n}d\hat{\omega} \\ &= \frac{1}{2\pi}\int_{2\pi}\frac{1}{T}\sum_{k=-\infty}^{+\infty}X_c \left[ j\left(\frac{\hat{\omega}}{T} - \frac{2\pi k}{T}\right)\right] e^{j\hat{\omega} n}d\hat{\omega} \\ &\approx \frac{1}{2\pi}\frac{1}{T}\int_{2\pi}X_c (\frac{\hat{\omega}}{T} ) e^{j\hat{\omega} n} d\hat{\omega} \\ &=\frac{1}{2\pi} \frac{1}{T}\int_{2\pi} \left[ \int_{\infty}X_c(\Phi)\delta (\Phi - \frac{\hat{\omega}}{T} )d\Phi \right] e^{j\hat{\omega} n} d\hat{\omega} \\ &=\frac{1}{2\pi} \frac{1}{T} \int_{\infty}X_c(\Phi)d\Phi \int_{2\pi}\delta (\Phi - \frac{\hat{\omega}}{T} )e^{j\hat{\omega} n} d\hat{\omega} \\ &=\frac{1}{2\pi} \frac{1}{T} \int_{\infty}X_c(\Phi)d\Phi \int_{2\pi}T\cdot \delta (\Phi T - \hat{\omega} )e^{j\hat{\omega} n} d\hat{\omega} \\ &=\frac{1}{2\pi} \int_{\infty}X_c(\Phi) e^{j\Phi T n}d\Phi \end{align}\]

That is \[\begin{align} x_r[n] &= \frac{1}{2\pi}\int_{2\pi} \frac{1}{T}X_c (\frac{\hat{\omega}}{T} ) e^{j\hat{\omega} n} d\hat{\omega} \\ &= \frac{1}{2\pi} \int_{\infty}X_c(\omega) e^{j\omega T n}d\omega \tag{31} \end{align}\]

assuming Nyquist–Shannon sampling theorem is met

\[\begin{align} x_r[n] &= \frac{1}{2\pi} \int_{\infty}X_c(\omega) e^{j\omega T n}d\omega \\ &= \frac{1}{2\pi} \int_{\infty}X_c(\omega) e^{j\omega t_n}d\omega \\ &= x_c(t_n) \end{align}\]

where \(t_n = T n\), then \(x_r[n] = x_c(nT)\)


Assuming \(x_c(t) = \cos(\omega_0 t)\), \(x_s(t)= \sum_{n=-\infty}^{\infty}x_c(nT)\delta(t-nT)\) and \(x[n]=x_c(nT)\), that is \[\begin{align} x_c(t) & = \cos(\omega_0 t) \\ x_s(t) &= \sum_{n=-\infty}^{\infty}\cos(\omega_0 nT)\delta(t-nT) \\ x[n] &= \cos(\omega_0 nT) \end{align}\]

  • \(X_c(j\omega)\), the Fourier Transform of \(x_c(t)\) \[ X_c(j\omega) = \pi[\delta(\omega - \omega_0) + \delta(\omega + \omega_0)] \]

  • \(X(e^{j\hat{\omega}})\), the the discrete-time Fourier transform (DTFT) of the sequence \(x[n]\) \[ X(e^{j\hat{\omega}}) =\sum_{k=-\infty}^{+\infty}\pi[\delta(\hat{\omega} - \hat{\omega}_0-2\pi k) + \delta(\hat{\omega} + \hat{\omega}_0-2\pi k)] \]

  • \(X_s(j\omega)\), the Fourier Transform of \(x_s(t)\) \[ X_s(j\omega)= \frac{1}{T}\sum_{k=-\infty}^{+\infty}\pi[\delta(\omega - \omega_0-k\omega_s) + \delta(\omega + \omega_0-k\omega_s)] \]

Express \(X(e^{j\hat{\omega}})\) in terms of \(X_s(j\omega)\) and \(X_c(j\omega)\) \[ X(e^{j\hat{\omega}}) = \frac{1}{T}\sum_{k=-\infty}^{+\infty}\pi[\delta(\frac{\hat{\omega}}{T} - \omega_0-k\omega_s) + \delta(\frac{\hat{\omega}}{T} + \omega_0-k\omega_s)] \] Inverse \(X(e^{j\hat{\omega}})\) \[\begin{align} x_r[n] &= \frac{1}{2\pi} \int_{2\pi}X(e^{j\hat{\omega}}) e^{j\hat{\omega} n} d\hat{\omega} \\ &= \frac{1}{2\pi}\int_{2\pi} \pi[\delta(\frac{\hat{\omega}}{T} - \omega_0) + \delta(\frac{\hat{\omega}}{T} + \omega_0)]e^{j\hat{\omega} n} d\frac{\hat{\omega}}{T} \\ &= \frac{1}{2\pi}\int_{2\pi} \pi[\delta(\frac{\hat{\omega}}{T} - \omega_0)e^{j\hat{\omega}_0 n} + \delta(\frac{\hat{\omega}}{T} + \omega_0)e^{-j\hat{\omega}_0 n}] d\frac{\hat{\omega}}{T} \\ &= \frac{1}{2}[ e^{j\hat{\omega}_0 n}\int_{2\pi} [\delta(\frac{\hat{\omega}}{T} - \omega_0)d\frac{\hat{\omega}}{T} + e^{-j\hat{\omega}_0 n}\int_{2\pi} [\delta(\frac{\hat{\omega}}{T} + \omega_0)d\frac{\hat{\omega}}{T}] \\ &= \frac{1}{2}[ e^{j\hat{\omega}_0 n} + e^{-j\hat{\omega}_0 n} ] \\ &= \cos(\hat{\omega}_0 n) \end{align}\]

or follow EQ.(31)

\[\begin{align} x_r[n] &= \frac{1}{2\pi} \int_{\infty}X_c(\omega) e^{j\omega T n}d\omega \\ &= \frac{1}{2\pi} \int_{\infty} \pi[\delta(\omega - \omega_0) + \delta(\omega + \omega_0)]e^{j\omega T n}d\omega \\ &= \frac{1}{2}(e^{j\omega_0 T n}+e^{-j\omega_0 T n}) \\ &= \cos(\hat{\omega}_0 n) \end{align}\]

where \(\hat{\omega}_0 = \omega_0 T\)

impulse train sampling & impulse sequence

image-20250910204320327

image-20250910204428950

if \(x_c(t) = e^{j\Omega_0t}\), thus \(X_c (j\Omega) = A\delta(\Omega - \Omega_0)\)

Then \[ X_s (j\Omega) = \frac{A}{T_s}\sum_k \delta(\Omega -\Omega_0 - k\Omega_s) \]

DTFT of \(x[n]\) \[\begin{align} X(e^{j\omega}) &= \frac{1}{T_s} \sum_k X_c\left[j(\frac{\omega}{T_s}-\frac{2\pi k}{T_s})\right] \\ &= \frac{A}{T_s} \sum_k \delta(\frac{\omega}{T_s} -\Omega_0- \frac{2\pi k}{T_s}) \\ &= A \sum_k \delta(\omega -\omega_0 - 2\pi k) \end{align}\]

yield \[ x[n] = A e^{j\omega_0 n} = A e^{j\Omega_0 nT_s} \]

1
2
3
4
5
6
7
8
9
import numpy as np
x = np.linspace(0,1,10000)
y = np.cos(2*np.pi*1*x)
rms = np.sqrt(np.power(y, 2).sum()/x.size)
print(rms)
print(1/2**0.5)

# 0.7071421356417675
# 0.7071067811865475

Example 4.1 impulse scaling \(\delta(\omega/T)=T\delta(\omega)\)

\[ \int \delta(\frac{\omega}{T})d\omega = \int T \delta(\omega)d\omega = \int T\delta(\frac{\omega}{T})d\frac{\omega}{T} = T \]

D/C

image-20240831161852787

image-20240831162625943

image-20240831162559492

image-20241024220244992

Zero Padding

Balu Santhanam. ECE-539: Digital Signal Processing: Zero padding and Resolution [http://ece-research.unm.edu/bsanthan/ece539/zero_pad.pdf]

David Castro PiñolDavid Castro Piñol. 𝗭𝗲𝗿𝗼 𝗣𝗮𝗱𝗱𝗶𝗻𝗴 𝗗𝗼𝗲𝘀𝗻’𝘁 𝗜𝗺𝗽𝗿𝗼𝘃𝗲 𝗦𝗽𝗲𝗰𝘁𝗿𝗮𝗹 𝗥𝗲𝘀𝗼𝗹𝘂𝘁𝗶𝗼𝗻 [link]

Zero padding improves frequency grid resolution, not spectral resolution

A smoother spectrum is not more information — it is better interpolation of the same information.

To truly improve spectral resolution, you must observe the signal longer (increase N).

chart, histogram

Gotcha

A remarkable fact of linear systems is that the complex exponentials are eigenfunctions of a linear system, as the system output to these inputs equals the input multiplied by a constant factor.

  • Both amplitude and phase may change
  • but the frequency does not change

For an input \(x(t)\), we can determine the output through the use of the convolution integral, so that with \(x(t) = e^{st}\) \[\begin{align} y(t) &= \int_{-\infty}^{+\infty}h(\tau)x(t-\tau)d\tau \\ &= \int_{-\infty}^{+\infty} h(\tau) e^{s(t-\tau)}d\tau \\ &= e^{st}\int_{-\infty}^{+\infty} h(\tau) e^{-s\tau}d\tau \\ &= e^{st}H(s) \end{align}\]

Take the input signal to be a complex exponential of the form \(x(t)=Ae^{j\phi}e^{j\omega t}\)

\[\begin{align} y(t) &= h(t)*x(t) \\ &= H(j\omega)Ae^{j\phi}e^{j\omega t} \end{align}\]

The frequency response at \(-\omega\) is the complex conjugate of the frequency response at \(+\omega\), given \(h(t)\) is real

\[\begin{align} H^*(t) &= \left(\int_{-\infty}^{+\infty}h(t)e^{-j\omega t}dt\right)^* \\ &= \int_{-\infty}^{+\infty}h^*(t)e^{+j\omega t}dt \\ &= \int_{-\infty}^{+\infty}h(t)e^{-j(-\omega t)}dt \\ &= H(-j\omega) \end{align}\]

The real cosine signal is actually composed of two complex exponential signals: one with positive frequency and the other with negative \[ cos(\omega t + \phi) = \frac{e^{j(\omega t + \phi)} + e^{-j(\omega t + \phi)}}{2} \]

The sinusoidal response is the sum of the complex-exponential response at the positive frequency \(\omega\) and the response at the corresponding negative frequency \(-\omega\) because of LTI systems's superposition property

  • input: \[\begin{align} x(t) &= A cos(\omega t + \phi) \\ &= \frac{1}{2}Ae^{\phi}e^{\omega t} + \frac{1}{2}Ae^{-\phi}e^{-\omega t} \end{align}\]

  • output with \(H(j\omega)=Ge^{j\theta}\): \[\begin{align} y(t) &= H(j\omega)\frac{1}{2}Ae^{\phi}e^{\omega t} + H(-j\omega)\frac{1}{2}Ae^{-\phi}e^{-\omega t} \\ &= Ge^{j\theta}\frac{1}{2}Ae^{\phi}e^{\omega t} + Ge^{-j\theta}\frac{1}{2}Ae^{-\phi}e^{-\omega t} \\ &= GAcos(\omega t + \phi + \theta) \end{align}\]

Its phase shift is \(\theta\) and gain is \(G\), which is same with \(H(j\omega)\).

reference

Alan V Oppenheim, Ronald W. Schafer. Discrete-Time Signal Processing, 3rd edition [pdf]

B.P. Lathi, Roger Green. Linear Systems and Signals (The Oxford Series in Electrical and Computer Engineering) 3rd Edition [pdf]

Alan V. Oppenheim, Alan S. Willsky, and S. Hamid Nawab. 1996. Signals & systems (2nd ed.) [pdf]

James H. McClellan, Ronald Schafer, and Mark Yoder. 2015. DSP First (2nd. ed.). Prentice Hall Press, USA

0%