Prerequisites & Notation

Before You Begin

This chapter generalizes the binary detection theory of Chapter 1 and the Gaussian-noise detection theory of Chapter 2 to MM hypotheses. The reader should be comfortable with the likelihood ratio test, the Neyman-Pearson viewpoint, and the matched-filter sufficient statistic before proceeding.

  • MAP and ML decision rules for binary hypothesis testing(Review ch01)

    Self-check: Can you write the MAP rule as a log-likelihood-ratio test with threshold depending on the priors?

  • The Q-function and Gaussian tail integrals(Review ch01)

    Self-check: Can you express P(X>a)P(X > a) for X∼N(ΞΌ,Οƒ2)X \sim \mathcal{N}(\mu,\sigma^2) in terms of Q(β‹…)Q(\cdot)?

  • Matched filter and correlator receivers for known signals in AWGN(Review ch02)

    Self-check: Why is ∫y(t)s(t) dt\int y(t) s(t)\,dt a sufficient statistic when Z(t)Z(t) is white Gaussian?

  • KL divergence and its role as the expected log-likelihood ratio(Review ch01)

    Self-check: State the two non-negativity properties: D(fβˆ₯g)β‰₯0D(f\|g)\geq 0 and D=0β€…β€ŠβŸΊβ€…β€Šf=gD=0 \iff f=g a.e.

  • Linear algebra: inner products, orthonormal bases, Gram-Schmidt procedure

    Self-check: Can you orthonormalize three linearly independent vectors in R4\mathbb{R}^4 by hand?

  • Moment generating function (MGF) of a random variable

    Self-check: What is the MGF of an exponential random variable with mean Ξ³Λ‰\bar\gamma?

  • Complex baseband representation and symbol energy

    Self-check: Given a constellation X\mathcal{X}, what is the average symbol energy EsE_s?

Notation for This Chapter

Symbols introduced or used in a specialized sense in this chapter. Symbols with \ntn\ntn{} tokens follow the book-wide defaults; see the front-matter notation table for the canonical definitions.

SymbolMeaningIntroduced
MMNumber of hypotheses / constellation pointss01
Hm\mathcal{H}_mThe mm-th hypothesis, m∈{0,1,…,Mβˆ’1}m \in \{0,1,\ldots,M-1\}s01
Ο€m\pi_mPrior probability of hypothesis Hm\mathcal{H}_ms01
X={x0,…,xMβˆ’1}\mathcal{X} = \{\mathbf{x}_0,\ldots,\mathbf{x}_{M-1}\}Signal constellation (set of signal-space points)s02
Rm\mathcal{R}_mDecision region for hypothesis Hm\mathcal{H}_ms01
ggDecision rule, g(y)∈{0,…,Mβˆ’1}g(\mathbf{y}) \in \{0,\ldots,M-1\}s01
NNDimension of signal space after Gram-Schmidt (N≀MN \leq M)s02
dm,jd_{m,j}Euclidean distance βˆ₯xmβˆ’xjβˆ₯\|\mathbf{x}_m - \mathbf{x}_j\|s02
dmin⁑d_{\min}Minimum pairwise distance of the constellations03
Q(β‹…)Q(\cdot)Gaussian tail probabilitys03
P(m→j)P(m \to j)Pairwise error probability: prob. of deciding jj given mm sents03
MΞ³(s)M_\gamma(s)MGF of the instantaneous SNR Ξ³\gammas04
D(fβˆ₯g)D(f\|g)KL divergence between densities ff and ggs05
Dmin⁑D_{\min}Minimum pairwise KL divergence between hypothesis distributionss05
SNR=Es/N0\text{SNR} = E_s/N_0Symbol SNRs03