A Chernoff-type Lower Bound for the Gaussian Q-function
arXiv:1202.6483
Abstract
A lower bound for the Gaussian Q-function is presented in the form of a single exponential function with parametric order and weight. We prove the lower bound by introducing two functions, one related to the Q-function and the other similarly related to the exponential function, and by obtaining inequalities that indicate the sign of the difference of the two functions.
3 pages. This version replaces the bound in v1 with a tighter bound. We give a proof of the tighter bound and defer the discussion
Cited by in corpus (8)
- New inequalities of Mill's ratio and Its Application to The Inverse Q-function Approximation
- Log-Quadratic Bounds for the Gaussian Q-function
- Risk Bounds for Over-parameterized Maximum Margin Classification on Sub-Gaussian Mixtures
- Stochastic Process Bandits: Upper Confidence Bounds Algorithms via Generic Chaining
- Energy Efficiency of Opportunistic Device-to-Device Relaying Under Lognormal Shadowing
- Approximating Mills ratio
- On the Error Exponent of Approximate Sufficient Statistics for M-ary Hypothesis Testing
- Variable-Length Channel Quantizers for Maximum Diversity and Array Gains