Pairwise Error Probability and Diversity

Starting From PEP

Diversity analysis in wireless begins with the pairwise error probability (PEP): the probability that the detector prefers a wrong codeword x^\hat{\mathbf{x}} over the transmitted x\mathbf{x} at a given SNR. The union bound converts PEP into a BER upper bound, and the asymptotic SNR scaling of PEP reveals the diversity order. For OTFS, this line of reasoning culminates in the full-DD-diversity result of Section 2.

The point is that PEP for OTFS depends on the sum βˆ₯HDD Δxβˆ₯2\|\mathbf{H}_{DD}\,\Delta\mathbf{x}\|^2 over all DD cells β€” a quadratic form in the path gains hih_i. The distribution of this quadratic form determines the diversity order. For independent Rayleigh paths, the diversity is the number of resolvable paths.

Definition:

Pairwise Error Probability

For an ML detector with transmit x\mathbf{x} and candidate x^\hat{\mathbf{x}}, the pairwise error probability is PEP(xβ†’x^)β€…β€Š=β€…β€ŠPr⁑ ⁣(βˆ₯yβˆ’HDDx^βˆ₯2≀βˆ₯yβˆ’HDDxβˆ₯2).\mathrm{PEP}(\mathbf{x} \to \hat{\mathbf{x}}) \;=\; \Pr\!\left(\|\mathbf{y} - \mathbf{H}_{DD}\hat{\mathbf{x}}\|^2 \leq \|\mathbf{y} - \mathbf{H}_{DD}\mathbf{x}\|^2\right). Conditioned on the channel realization, the PEP is the Gaussian Q-function: PEP(xβ†’x^∣HDD)β€…β€Š=β€…β€ŠQ ⁣(βˆ₯HDD Δxβˆ₯22 σ2),\mathrm{PEP}(\mathbf{x} \to \hat{\mathbf{x}} | \mathbf{H}_{DD}) \;=\; Q\!\left(\sqrt{\frac{\|\mathbf{H}_{DD}\,\Delta\mathbf{x}\|^2}{2\,\sigma^2}}\right), where Ξ”x=xβˆ’x^\Delta\mathbf{x} = \mathbf{x} - \hat{\mathbf{x}}.

Theorem: Diversity Order from PEP

The diversity order of a detector is the high-SNR scaling exponent of the BER: dβ€…β€Š=β€…β€Šβˆ’lim⁑SNRβ†’βˆžlog⁑ BER(SNR)log⁑ SNR.d \;=\; -\lim_{\mathrm{SNR} \to \infty} \frac{\log\,\mathrm{BER}(\mathrm{SNR})}{\log\,\mathrm{SNR}}. Equivalently, BER∼cβ‹…SNRβˆ’d\mathrm{BER} \sim c \cdot \mathrm{SNR}^{-d} for some constant cc. A detector with diversity dd doubles the SNR gain per 3d3d-dB SNR increase.

Higher dd means the BER drops faster as SNR grows. Single-path Rayleigh: d=1d = 1. PP-path with diversity-reaching detector: d=Pd = P. The detector's ability to exploit all paths is what translates physical diversity into BER gain.

Key Takeaway

Diversity order = rank of the channel action on the error vector. The quadratic form βˆ₯HDD Δxβˆ₯2\|\mathbf{H}_{DD}\,\Delta\mathbf{x}\|^2 is a weighted sum of path gains ∣hi∣2|h_i|^2. If the weights are non-degenerate (no linear dependence), the diversity is PP. For OTFS, this is the generic case β€” the DD channel structure naturally gives non-degenerate weights for any non-zero error vector.

Definition:

Independent Rayleigh Path Gains

We assume the path gains {hi}i=1P\{h_i\}_{i=1}^P are independent and complex Gaussian: hi∼CN(0,∣hi∣avg2),βˆ‘i∣hi∣avg2=1.h_i \sim \mathcal{CN}(0, |h_i|^2_{\text{avg}}), \qquad \sum_i |h_i|^2_{\text{avg}} = 1. Path delays Ο„i\tau_i and Dopplers Ξ½i\nu_i are deterministic (geometry of the physical scene). The randomness is entirely in the complex amplitudes, which model the path's random phase and multipath scattering.

Theorem: PEP Scaling Under Rayleigh Path Gains

Under the independent Rayleigh path gain assumption, the PEP averaged over channel realizations scales as Eh[PEP(xβ†’x^)]β€…β€ŠβˆΌβ€…β€ŠC(x,x^)SNRd(x,x^),\mathbb{E}_{\mathbf{h}}[\mathrm{PEP}(\mathbf{x} \to \hat{\mathbf{x}})] \;\sim\; \frac{C(\mathbf{x}, \hat{\mathbf{x}})}{\mathrm{SNR}^{d(\mathbf{x}, \hat{\mathbf{x}})}}, at high SNR, where d(x,x^)=d(\mathbf{x}, \hat{\mathbf{x}}) = rank of the matrix E(x,x^)=D1/2 A(Ξ”x) D1/2\mathbf{E}(\mathbf{x}, \hat{\mathbf{x}}) = \mathbf{D}^{1/2}\,\mathbf{A}(\Delta\mathbf{x})\,\mathbf{D}^{1/2} with D=diag(∣h1∣avg2,…,∣hP∣avg2)\mathbf{D} = \text{diag}(|h_1|^2_{\text{avg}}, \ldots, |h_P|^2_{\text{avg}}) and A(Ξ”x)\mathbf{A}(\Delta\mathbf{x}) the "error covariance matrix" built from the error vector Ξ”x\Delta\mathbf{x}.

The diversity order of the detector is d=min⁑xβ‰ x^d(x,x^).d = \min_{\mathbf{x} \neq \hat{\mathbf{x}}} d(\mathbf{x}, \hat{\mathbf{x}}).

For a generic error vector Ξ”x\Delta\mathbf{x} (no special structure that would collapse rank), A(Ξ”x)\mathbf{A}(\Delta\mathbf{x}) has full rank PP, giving diversity PP. The minimum over all error pairs gives the worst-case, which is also typically PP except in pathological cases (like Ξ”x\Delta\mathbf{x} being supported on only one DD cell; see exercises).

Example: Error Vector Supported on One DD Cell

An error vector has a single non-zero: Ξ”xDD[β„“0,k0]=1\Delta x_{DD}[\ell_0, k_0] = 1, all other cells zero. The channel has P=2P = 2 paths at (β„“1,k1)(\ell_1, k_1) and (β„“2,k2)(\ell_2, k_2). What is the diversity d(x,x^)d(\mathbf{x}, \hat{\mathbf{x}})?

PEP vs SNR for Different Error Vectors

Plot PEP as a function of SNR for (a) a single-cell error, (b) a two-cell error, and (c) a many-cell error. Observe that all three have slope βˆ’P-P at high SNR β€” diversity is error-vector- independent for generic errors.

Parameters
4
16
16

Different Detectors, Same Diversity?

At first glance it seems puzzling that MMSE has diversity 1 while ML has diversity PP. Both act on the same channel and see the same quadratic form. The resolution: MMSE linearizes and discards off-diagonal terms that encode the path diversity; ML retains the full joint structure.

Concretely, the MMSE per-cell output is Ξ»n,mβˆ—y/∣λn,m∣2\lambda_{n, m}^* y / |\lambda_{n, m}|^2 β€” a single-path Rayleigh-like coefficient. ML minimizes over the joint constellation, exploiting the coupling across cells that the channel creates. This joint treatment is what extracts the diversity.

Message passing (Ch. 8) preserves the joint treatment via iterative marginalization β€” and hence achieves the full PP.