A simple polynomial approximation to the Gaussian Q-function and its application

Authors:
Yunfei Chen;Norman C. Beaulieu
Affiliations:
School of Engineering, University of Warwick, Coventry, U.K.;Department of Electrical and Computer Engineering, University of Alberta, Edmonton, Alberta, Canada
Venue:
IEEE Communications Letters
Year:
2009

Citing 2
Cited 2

Antennas and Propagation for Wireless Communication Systems

Antennas and Propagation for Wireless Communication Systems
New exponential bounds and approximations for the computation of error probability in fading channels

IEEE Transactions on Wireless Communications

Parallel decentralized network for the detection of unknown signals through wireless nakagami fading channels

EURASIP Journal on Advances in Signal Processing
Evolving the best known approximation to the Q function

Proceedings of the 14th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A simple polynomial approximation to the Gaussian Q-function is proposed, based on the observation that a Gaussian random variable can be well approximated by a sum of uniform random variables. The approximation can be used to obtain accurate explicit approximations to problems that otherwise do not have explicit solutions or approximate explicit solutions. As an example, an explicit expression for the average symbol error rate of M-ary pulse amplitude modulation in lognormal channels is derived using the new approximation, and the approximate symbol error rate is shown to be very close to the exact value.