Answers are grounded in this paper and cite their sources.
The computation of the pairwise error probability (PEP) for coded digital communications in the presence of fading is often performed by using the Chernoff upper bound, which is simple to evaluate but rather loose. Exact evaluation of the PEP is possible in principle by computing the residues of a complex function, but this may be complicated in practice. In the Letter the authors derive two approximations to the PEP. The first one, based on saddle-point integration, is simple to compute and generally tighter than the Chernoff bound. The second one, based on Gauss–Chebyshev quadrature rules, is both easy to use and computationally stable, and approximates the true value of PEP within any degree of accuracy.
No takes yet. Share an insight, caveat, or question.
Biglieri et al. (1995) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: