5.8 The Gap Approximation
The next sections discuss the so-called gap approximation applied to PAM and QAM.
5.8.1 The PAM 6-dB rule: each extra bit requires 6 dB

An interesting relation obtained from Eq. (5.8) is
| (5.17) |
Figure 5.16 a) presents a graph of Eq. (5.17) when varying for and . It indicates that, when is sufficiently high, each additional bit (from 4 to 5 bits, for example) requires an increase of 6 dB in SNR if one desires to maintain the . Another way of observing this fact is to assume that and obtain
which can be expressed as or .
Figure 5.16 b) indicates how varies with , which was allowed to assume non-integer values. Because and the separation among symbols is kept constant, the parcel is constant and, in this case, approximately 0.36. Hence, tends to as increases.
It is important to understand that, in spite of Eq. (5.17) looking like the “capacity” equation, this expression does not say anything about probability of error nor if this number of bits is below or above the capacity (Eq. (4.53), repeated here for convenience) of a discrete-time AWGN channel.
We are interested in understanding the gap approximation for uncoded PAM and QAM:
| (5.18) |
This approximation is widely used and the reason is the following task: say one has an estimated SNR (or, equivalently, and ) and wishes to find to operate at a given . In other words, some function is needed.
In this situation, one does not know , or that allows to achieve the target . Hence, Eq. (5.17) cannot be used. The capacity
only tells the theoretical (assuming the possibility of infinite delay and complexity) maximum value of , but does not indicate the probability of error when using an uncoded PAM and QAM (or any other code). However, one can use expressions for that take into account SNR and . In the following paragraph, PAM is assumed, but a similar reasoning applies to QAM.
For PAM, one has
However, because (and, equivalently, ) cannot be expressed in closed form, it is not possible to find an “inverse” . Two alternatives are to plot the expression for or even find numerically. More commonly, one adopts the “gap approximation” that (in this case) consists in ignoring the term and adopt:
| (5.19) |
Figure 5.17 illustrates the approximation for dB, where it can be seen how the discarded term varies with .

Figure 5.18 is similar to Figure 5.17 but adopts dB. Note that the gap approximation improves when the SNR increases.

Assuming the gap approximation of Eq. (5.19), to find that corresponds to the desired , one can now simply isolate :
and write
where
| (5.20) |
is the gap for PAM in linear scale.
5.8.2 The QAM 3-dB rule: each extra bit requires 3 dB
An expression can be derived for the number of bits per dimension of a SQ QAM:
In this case, , and such that for QAM. This expression is similar to Eq. (5.17).
For square QAM, one has
| (5.21) |
In this case, the gap approximation is based on the assumption that
| (5.22) |
which allows to write
and, alternatively
where
| (5.23) |
is the gap for square QAM.
In summary, the actual supportable bit rate at a given error rate for uncoded QAM and PAM is given by the channel capacity for a modified SNR, which is the “capacity” SNR divided by the so-called SNR gap. The notion of a “gap” is more appropriate when the SNR is given in dB, since the SNR gap is then a fixed additive term for a given error rate:
Note from Eq. (5.20) and Eq. (5.23) that the gap is independent of the number of bits , (and so independent of for -QAM). It purely depends on the error rate.
Listing 5.8 was used to obtain Table 5.2.
1Pe = [2e-5 1e-5 2e-6 1e-6 2e-7 1e-7 2e-8 1e-8 2e-9 1e-9]; 2argQ_qam = qfuncinv(Pe/4); %QAM 3gap_linear_qam = (argQ_qam.^2)/3; 4gap_db_qam = 10*log10(gap_linear_qam); 5argQ_pam = qfuncinv(Pe/2); %PAM 6gap_linear_pam = (argQ_pam.^2)/3; 7gap_db_pam = 10*log10(gap_linear_pam);
QAM | PAM
| |||
6.5038 | 8.1317 | 6.0631 | 7.8269 | |
6.9458 | 8.4172 | 6.5038 | 8.1317 | |
7.976 | 9.0179 | 7.5317 | 8.7689 | |
8.4213 | 9.2538 | 7.976 | 9.0179 | |
9.458 | 9.758 | 9.011 | 9.5477 | |
9.9056 | 9.9588 | 9.458 | 9.758 | |
10.9471 | 10.393 | 10.4982 | 10.2111 | |
11.3965 | 10.5677 | 10.9471 | 10.393 | |
12.4416 | 10.9488 | 11.9912 | 10.7886 | |
12.8924 | 11.1033 | 12.4416 | 10.9488 | |
For example, assume a QAM that operates with dB ( in linear scale) and must have a symbol error rate . According to Table 5.2, in this case the gap is , which leads to
Using Eq. (5.22), one obtains as desired. Recalling that the quantities per dimension for QAM are and , the same project can be done evaluating a PAM for each dimension. In this case, and, for PAM, , such that:
and, using Eq. (5.19), . This corresponds to bits and , as expected. Therefore, Eq. (5.18) is valid for both PAM and squared QAM.
Figure 5.19 was obtained with SNR = 10 dB for QAM. The abscissa informs the that was specified and the “correct” graph corresponds to using Eq. (5.21) while the other graph uses Eq. (5.23) to calculate and then using Eq. (5.18). It can be noticed that the number of bits to achieve the specified is underestimated by the gap approximation ( .

Figure 5.19 assumes that given and , the gap approximation is evaluated by comparing the number of bits.

A similar procedure to Figure 5.19 was adopted to generate Figure 5.20 but, in this case, the SNR was decreased to dB. The impact on the accuracy of the gap approximation can be noticed when the SNR decreases, especially for high .