Prerequisites & Notation

Before You Begin

This chapter builds the modern theory and practice of shaping β€” the last dB of the gap to AWGN capacity for a coded modulation system. The foundation from Chapter 4 (Forney-style lattice shaping) and Chapter 9 Section 5 (Probabilistic Amplitude Shaping in 400G optical) is essential: we assume the reader can already state the Ο€e/6β‰ˆ1.53\pi e / 6 \approx 1.53 dB asymptotic shaping bound and has seen the PAS block diagram. Chapter 19 now puts the machinery under the microscope. We derive the Maxwell-Boltzmann distribution from first principles (KKT on a max-entropy Lagrangian), build a constant-composition distribution matcher (CCDM) by arithmetic coding, quantify its short-block rate loss, introduce geometric shaping as the dual option, and conclude with rate-adaptive transmission β€” the operational reason the industry cares. Familiarity with LDPC codes (Telecom Chapter 11), BICM (Chapter 5), and the AWGN-channel capacity formula is assumed.

  • Sphere-shaping gain bound Ξ³s≀πe/6\gamma_s \le \pi e / 6(Review ch04)

    Self-check: Can you state the shaping gain ceiling Ξ³s≀πe/6β‰ˆ1.53\gamma_s \le \pi e / 6 \approx 1.53 dB and explain why it is the asymptotic limit of spherical-vs-cubic second-moment ratio?

  • Probabilistic Amplitude Shaping (PAS) block diagram(Review ch09)

    Self-check: Can you draw the PAS pipeline (info bits β†’\to CCDM β†’\to amplitude bits ++ systematic LDPC β†’\to QAM mapper) and explain why the sign bits can remain uniform while the amplitude bits carry the MB distribution?

  • BICM capacity and Gray-labelling near-optimality(Review ch05)

    Self-check: Can you write CBICM(ΞΌ)=βˆ‘β„“I(Y;Bβ„“)C_{\rm BICM}(\mu) = \sum_\ell I(Y; B_\ell) for a Gray-labelled MM-QAM and state the <0.1< 0.1 dB empirical gap to CCMC_{\rm CM} at high SNR?

  • LDPC codes and systematic-form encoding(Review ch11)

    Self-check: Can you explain what a systematic LDPC code is (information bits appear verbatim in the codeword) and why PAS requires this property?

  • Gaussian maximum-entropy theorem(Review ch09)

    Self-check: Can you prove that among distributions on R\mathbb{R} with variance Οƒ2\sigma^2, the entropy-maximising one is \gauss(0,Οƒ2)\gauss(0, \sigma^2)?

  • Lagrangian optimisation and KKT conditions

    Self-check: Given a concave objective f(p)f(p) on a probability simplex with a linear constraint Ep[g(X)]=E\mathbb{E}_p[g(X)] = E, can you write the Lagrangian and solve βˆ‚L/βˆ‚p(x)=0\partial L / \partial p(x) = 0 for the stationary distribution?

  • Arithmetic coding(Review ch05)

    Self-check: Can you sketch how arithmetic coding maps a binary input stream into a real interval and state why the compression rate approaches the source entropy in the limit of long blocks?

  • Adaptive modulation and coding (AMC) MCS tables(Review ch09)

    Self-check: Can you explain why 5G NR uses 28 discrete MCS indices (staircase) for rate adaptation and what the typical gap between adjacent staircase steps is in bits per symbol?

Notation for This Chapter

Symbols specific to Chapter 19. We follow the Bocherer-Steiner-Schulte convention for PAS and the Forney convention for shaping gain.

SymbolMeaningIntroduced
Ξ»\lambdaMaxwell-Boltzmann shaping parameter, Ξ»>0\lambda > 0. The MB distribution is pΞ»(x)∝exp⁑(βˆ’Ξ»βˆ£x∣2)p_\lambda(x) \propto \exp(-\lambda |x|^2)s01
Z(Ξ»)Z(\lambda)Partition function, Z(Ξ»)=βˆ‘x∈Xexp⁑(βˆ’Ξ»βˆ£x∣2)Z(\lambda) = \sum_{x \in \mathcal{X}} \exp(-\lambda |x|^2)s01
H(X)H(X)Entropy of the constellation input distribution, in bitss01
Ξ³s\gamma_sShaping gain in dB. Ξ³sβ†’Ο€e/6β‰ˆ1.53\gamma_s \to \pi e / 6 \approx 1.53 dB at high SNRs01
RcR_cLDPC code rate. Rc=k/nR_c = k / n where kk information bits produce nn codeword bitss02
RREffective PAS transmission rate in bits per 2D QAM symbol. R=Rclog⁑2M+(Rcβˆ’1)R = R_c \log_2 M + (R_c - 1)s02
RDMR_{\rm DM}Distribution-matcher output rate in bits per amplitude symbol; equals H(A)H(A) minus rate losss03
A\mathcal{A}Amplitude alphabet. For square MM-QAM, A={1,3,…,Mβˆ’1}\mathcal{A} = \{1, 3, \ldots, \sqrt{M}-1\} per in-phase/quadratures02
pA(a)p_A(a)Target distribution on amplitudes. MB-derived: pA(a)∝exp⁑(βˆ’Ξ»a2)p_A(a) \propto \exp(-\lambda a^2)s02
nnCCDM block length (amplitude symbols per shaping block)s03
CCDM\mathrm{CCDM}Constant-composition distribution matcher. Arithmetic-coded invertible bit-to-amplitude mappings03
Ξ·\etaSpectral efficiency in bits/s/Hz. Under PAS, Ξ·\eta is continuous in Ξ»\lambda and RcR_cs05
MMConstellation size (QAM order). Standard values: 1616, 6464, 256256, 10241024s01

Key Takeaway

Shaping is the last dB of the Shannon gap that coding cannot close. Chapter 4 taught us that sphere shaping saves up to Ο€e/6β‰ˆ1.53\pi e / 6 \approx 1.53 dB in the asymptotic, large-dimension limit. Chapter 9 showed the industry implementation via PAS. Chapter 19 completes the theory: the Maxwell-Boltzmann distribution is the optimal finite-alphabet input, the CCDM realises it with O(log⁑n/n)O(\log n / n) rate loss, geometric shaping is the dual of probabilistic shaping and achieves the same asymptotic, and all of it enables rate-adaptive transmission with a single fixed modulation and code β€” the feature that made 400ZR a commercial reality.