Coding gain - Wikipedia, the free encyclopedia

Page 1 of 3

Coding gain
From Wikipedia, the free encyclopedia

In coding theory and related engineering problems, coding gain is the measure in the difference between the signal to noise ratio (SNR) levels between the uncoded system and coded system required to reach the same bit error rate (BER) levels when used with the error correcting code (ECC).

Contents
1 Example 2 Power-limited regime 3 Example 4 Bandwidth-limited regime 5 See also 6 References

Example
If the uncoded BPSK system in AWGN environment has a Bit error rate (BER) of 10 2 at the SNR level 4dB, and the corresponding coded (e.g., BCH) system has the same BER at an SNR level of 2.5dB, then we say the coding gain = 4dB-2.5dB = 1.5dB, due to the code used (in this case BCH).

Power-limited regime
In the power-limited regime (where the nominal spectral efficiency [b/2D or b/s/Hz], i.e. the domain of binary signaling), the effective coding gain eff(A) of a signal set A at a given target

/ N0 required to achieve the target Pb(E) with A and the Eb / N0 required to achieve the target Pb(E) with 2-PAM or (22)-QAM (i.e. no coding). The nominal coding gain c(A) is defined as

error probability per bit Pb(E) is defined as the difference in dB between the Eb

This definition is normalized so that c(A)

= 1 for 2-PAM or (22)-QAM. If the average number > 1, the effective

of nearest neighbors per transmitted bit Kb(A) is equal to one, the effective coding gain eff(A) is approximately equal to the nominal coding gain c(A). However, if Kb(A) the steepness of the Pb(E) vs. Eb coding gain eff(A) is less than the nominal coding gain c(A) by an amount which depends on

/ N0 curve at the target Pb(E). This curve can be plotted

using the union bound estimate (UBE)

http://en.wikipedia.org/wiki/Coding_gain

12/11/2009

Coding gain - Wikipedia, the free encyclopedia

Page 2 of 3

where

denotes the Gaussian probability of error function.

For the special case of a binary linear block code C with parameters (n,k,d), the nominal spectral efficiency is

= 2k / n and the nominal coding gain is kd/n.

Example
The table below lists the nominal spectral efficiency, nominal coding gain and effective coding gain at for Reed-Muller codes of length : Code [8,7,2] [8,4,4]

c c (dB) Kb eff (dB)

2.43 3.01 4 4 8 13 6 16 48 39 10 32 2.0 2.6 2.1 3.7 3.5 2.1 4.0 4.9 4.2 1.9

1.75 7/4 1.0 2

[16,15,2] 1.88 15/8 2.73 [16,11,4] 1.38 11/4 4.39 [16,5,8] 0.63 5/2 3.98 [32,31,2] 1.94 31/16 2.87 [32,26,4] 1.63 13/4 5.12 [32,16,8] 1.00 4 [32,6,16] 0.37 3 6.02 4.77

[64,63,2] 1.97 63/32 2.94 [64,57,4] 1.78 57/16 5.52 [64,42,8] 1.31 21/4 7.20 [64,22,16] 0.69 11/2 7.40 [64,7,32] 0.22 7/2 5.44

183 4.0 266 5.6 118 6.0 18 4.6

Bandwidth-limited regime
In the bandwidth-limited regime (

> 2b / 2D, i.e. the domain of non-binary signaling), the effective coding gain eff(A) of a signal set A at a given target error rate Ps(E) is defined as the

difference in dB between the SNRnorm required to achieve the target Ps(E) with A and the

SNRnorm required to achieve the target Ps(E) with M-PAM or (MM)-QAM (i.e. no coding). The nominal coding gain c(A) is defined as

http://en.wikipedia.org/wiki/Coding_gain

12/11/2009

Coding gain - Wikipedia, the free encyclopedia

Page 3 of 3

This definition is normalized so that c(A)

= 1 for M-PAM or (MM)-QAM. The UBE becomes

where Ks(A) is the average number of nearest neighbors per two dimensions.

See also
Channel capacity Eb/N0

References
MIT OpenCourseWare, 6.451 Principles of Digital Communication II, Lecture Notes sections 5.3, 5.5, 6.3, 6.4 Retrieved from "http://en.wikipedia.org/wiki/Coding_gain" Categories: Coding theory | Error detection and correction This page was last modified on 12 August 2009 at 15:54. Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. See Terms of Use for details. Wikipedia is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.

http://en.wikipedia.org/wiki/Coding_gain

12/11/2009