


Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
An in-depth analysis of the q-function, a mathematical function related to the gaussian distribution. The definition, properties, and numerical computation of the q-function. It also includes useful relations to other functions such as the error function and complementary error function.
Typology: Schemes and Mind Maps
1 / 4
This page cannot be seen from the preview
Don't miss anything!



The Q-function is tail integral of a unit-Gaussian pdf, and is defined as
Q(z) =∆
∫ (^) ∞
z
2 π
e
− 2 x 2 dx.
The Q-function has the following properties:
zlim→∞ Q(z) = 0 lim z→−∞ Q(z) = 1 Q(0) = 1/ 2 Q(−z) = 1 − Q(z).
There are several other common notations used to denote this integral function or a close relative. The Q-function is sometime referred to as the “Gaussian Integral Function” and denoted GIF(z). Other functions which are closely related are the erf(·) (error function) and erfc(·) (complementary error function):
erf(z) ∆ =
∫ (^) z
0
π
e−x
2 dx z ≥ 0
erfc(z) ∆ =
∫ (^) ∞
z
π
e−x
2 dx = 1 − erf(z) z ≥ 0
The Q-function is related to these functions by
Q(z) =
[ 1 − erf
( z √ 2
erfc
( z √ 2
) z ≥ 0.
It is clear that if X(u) is a mean zero, unit variance Gaussian random variable, that
Q(z) = 1 − FX(u)(z).
A useful relation is that if Y (u) is Gaussian with mean m and variance σ^2 , then
Pr {Y (u) > a} = Q
( (^) a − m
σ
) .
The Q-function must be evaluated numerically; there is no closed form solution for the inte- gral. All numerical methods are the result of a trade-off between computational complexity
By George K. Karagiannidis Electrical & Computer Engineering Dept Aristotle University of Thessaloniki
and accuracy. The range for z over which the approximation is valid is also a concern. The numerical approximation which I find most useful is given by^1
Q(z) ≈ (a 1 t + a 2 t^2 + a 3 t^3 + a 4 t^4 + a 5 t^5 )e
−z^2 (^2) z ≥ 0 ,
where
t =
1 + Bz
a 1 = 0. 127414796 a 2 = − 0. 142248368 a 3 = 0. 7107068705 a 4 = − 0. 7265760135 a 5 = 0. 5307027145.
The associated approximation error is guaranteed to be less than 1. 5 × 10 −^7. I have found that this approximation is acceptable for all practical values of z.
Another useful concept is a simple over-bound. This allows a “worst-case” scenario to be quickly evaluated. The most common overbound is
Q(z) ≤
2 πz
e
− 2 z 2 z > 0.
This bound becomes quite “tight” for large z.
The Q-function and the over-bound are plotted in Figures ??-??. The plot of Figure ?? is on a log-scale to emphasize the behavior for large z.
The Q-function is tabulated in Table 1 for z = 0 to 10. The values of z for which Q(z) = 10−k^ for k = 1, 2... 10 are also given.^2
(^1) This is adapted from the erf(·) approximation of equation 7.1.26 in M. Abramowitz and A. Stegun,
Handbook of Mathematical Functions, Dover. Less complex approximations can also be found therein. (^2) The values in Table 1 were calculated using the approximation for z < 4. The values for z ≥ 4 as well
as those in the inverse Q table were taken from Albert Leon-Garcia, Probability and Random Processes for Electrical Engineering, Addison Wesley, 1989.