New exponential bounds and approximations for the computation of error probability in fading channels

By Marco Chiani, Davide Dardari, M. Simon. IEEE Transactions on Wireless Communications, 2003

889 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Improved Inequalities for the Poisson and Binomial Distribution and Upper Tail Quantile Functions (2013, neutral): “[13]:”
Ambient Backscatter Communication Systems: Detection and Performance Analysis (2016, neutral): “(50) The reference [28] gives a simple but good approximation for Q(x) Q(x) ≈ 1 12 e− x2 2 + 1 4 e− 2x2 3 , x > 0.”
Wireless Relay Communications with Unmanned Aerial Vehicles: Performance and Optimization (2011, methodology): “2) SER Upper Bound: In order to reduce the computational burden of evaluating (14), an upper bound for the SER is derived by resorting to the results of [26].”
Privacy via the Johnson-Lindenstrauss Transform (2012, neutral): “The bound (∗) follows from 1− erf(x) ≤ exp(−x2) for x > 0 [8].”
Novel Index Modulation Techniques: A Survey (2019, methodology): “To simplify the expression, the works [107], [108] propose an exponential bound of the Q-function less accurate than (38) in general, which is expressed as”