Chapter Summary

Chapter Summary

Key Points

  • 1.

    From LRT to matched filter. For the binary AWGN problem H1:Y=s+W\mathcal{H}_1: \mathbf{Y} = \mathbf{s} + \mathbf{W} versus H0:Y=W\mathcal{H}_0: \mathbf{Y} = \mathbf{W} with W∼N(0,Οƒ2I)\mathbf{W} \sim \mathcal{N}(\mathbf{0}, \sigma^2\mathbf{I}), the LRT reduces to a threshold test on T(y)=sTyT(\mathbf{y}) = \mathbf{s}^{\mathsf T}\mathbf{y}. This scalar is simultaneously the correlator output and the matched filter output sampled at the optimal time.

  • 2.

    Matched filter maximises SNR. Among all linear filters with fixed norm, h(t)=s(Tβˆ’t)h(t) = s(T-t) maximises the output SNR at t=Tt=T; the maximum output SNR equals 2Es/N02E_s/N_0 and is achieved uniquely up to scaling.

  • 3.

    Exact performance. For the matched-filter receiver Pd=Q(Qβˆ’1(Pf)βˆ’d)P_d = Q(Q^{-1}(P_f) - d) with d=2Es/N0d = \sqrt{2E_s/N_0} the deflection coefficient. For equal priors the minimum error probability is Pe=Q(d/2)P_e = Q(d/2) --- the formula underlying every BPSK/orthogonal-signalling curve.

  • 4.

    GLRT for composite hypotheses. When signal parameters (amplitude, phase, timing) are unknown, replace them by their MLEs under each hypothesis: LG=max⁑θ1f1(y;θ1)/max⁑θ0f0(y;θ0)L_G = \max_{\theta_1} f_1(y;\theta_1)/\max_{\theta_0} f_0(y;\theta_0). The GLRT is not necessarily optimal but is the standard practical construction.

  • 5.

    Colored noise via prewhitening. For W∼N(0,C)\mathbf{W} \sim \mathcal{N}(\mathbf{0}, \mathbf{C}), apply Cβˆ’1/2\mathbf{C}^{-1/2} to observation and signal; the resulting problem is standard AWGN detection, and the test statistic becomes the Mahalanobis inner product sTCβˆ’1y\mathbf{s}^{\mathsf T} \mathbf{C}^{-1} \mathbf{y}. Equivalently, the detection SNR is the Mahalanobis norm sTCβˆ’1s\mathbf{s}^{\mathsf T}\mathbf{C}^{-1}\mathbf{s}.

  • 6.

    Continuous-time view. In L2[0,T]L^2[0,T] the sufficient statistic is ⟨y,s⟩=∫0Ty(t)s(t) dt\langle y, s\rangle = \int_0^T y(t)s(t)\,dt. Gram--Schmidt orthogonalisation reduces MM-ary signalling to detection of a vector in RN\mathbb{R}^N with N≀MN\leq M --- the signal-space representation used throughout digital modulation.

  • 7.

    Sufficiency as structural dimension reduction. The matched-filter output is a sufficient statistic in the Fisher--Neyman sense: the likelihood depends on y\mathbf{y} only through this scalar (or through the basis projections, in MM-ary detection). No optimal receiver needs to keep anything outside the signal subspace.

Looking Ahead

Chapter 3 extends these ideas to MM-ary detection, where the sufficient statistic becomes a vector of projections and the ML decoder is a minimum-Euclidean-distance rule on a constellation. Chapter 4 takes up sequential detection and CFAR, where the number of samples is not fixed in advance. Together Chapters 1--4 constitute the classical detection-theory backbone that Part II will generalise to parameter estimation.