Prerequisites & Notation

Before You Begin

This chapter builds on the fixed-sample-size detection framework developed in Chapters 1-3. We now relax the assumption that the sample size is fixed in advance and consider detectors that observe the data sequentially, stopping as soon as a decision can be made with sufficient confidence. If any item below feels unfamiliar, revisit the linked chapter before proceeding.

  • Binary hypothesis testing, likelihood ratio test, Neyman-Pearson lemma(Review ch01)

    Self-check: Can you state the Neyman-Pearson lemma and derive the threshold for a target false alarm probability?

  • Log-likelihood ratio and its distribution under each hypothesis(Review ch01)

    Self-check: Can you compute E[β„“(Y)∣H0]\mathbb{E}[\ell(Y) | \mathcal{H}_0] and E[β„“(Y)∣H1]\mathbb{E}[\ell(Y) | \mathcal{H}_1] for a Gaussian shift-in-mean problem?

  • KL divergence and its role as the expected LLR(Review ch01)

    Self-check: Why is E[β„“(Y)∣H1]=D(f1βˆ₯f0)\mathbb{E}[\ell(Y) | \mathcal{H}_1] = D(f_1 \| f_0)?

  • Chernoff bound and error exponents(Review ch02)

    Self-check: Can you sketch the Chernoff exponent eβˆ—e^* as a function of Ξ»\lambda?

  • Stopping times, martingales (light familiarity)

    Self-check: Can you state the optional stopping theorem for bounded stopping times?

  • Q-function and Gaussian tail probabilities(Review ch01)

    Self-check: Can you compute Q(x)Q(x) for x=1,2,3x = 1, 2, 3 to two decimal places?

  • Order statistics of i.i.d. samples

    Self-check: Can you write the distribution of the kk-th order statistic of nn i.i.d. uniforms?

Notation for This Chapter

Symbols introduced or used in a specialized sense in this chapter. We adopt the conventions of Chapter 1 for likelihood ratios, error probabilities, and decision rules.

SymbolMeaningIntroduced
NNStopping time (random number of samples before deciding)s01
β„“(n)\ell^{(n)}Cumulative log-likelihood ratio after nn sampless01
A,BA, BSPRT thresholds (B<0<AB < 0 < A, accept H1\mathcal{H}_1 above AA, H0\mathcal{H}_0 below BB)s01
Ξ±,Ξ²\alpha, \betaTarget Type-I and Type-II error probabilitiess01
Ei[N]\mathbb{E}_i[N]Average sample number (ASN) under Hi\mathcal{H}_is01
SnS_nCUSUM statistic after nn sampless02
Ξ½\nuTrue change-point instants02
Ο„\tauDetection alarm time (stopping rule for change detection)s02
ARL0,ARL1\mathrm{ARL}_0, \mathrm{ARL}_1Average run length under H0\mathcal{H}_0 (false alarm) and H1\mathcal{H}_1 (detection delay)s02
TTCFAR test cell under test (CUT)s03
ZZCFAR reference-window noise estimates03
Ξ±cfar\alpha_{\mathrm{cfar}}CFAR threshold multiplier (Ξ³=Ξ±cfarβ‹…Z\gamma = \alpha_{\mathrm{cfar}} \cdot Z)s03
NrefN_{\mathrm{ref}}Number of reference cells in CFAR windows03
Pf,PdP_f, P_dFalse-alarm and detection probabilitiess01