Coding gain

Coding gain

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

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 \rho \le 2 [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 error probability per bit Pb(E) is defined as the difference in dB between the Eb / 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 (2×2)-QAM (i.e. no coding). The nominal coding gain γc(A) is defined as

\gamma_c(A) = {d^2_\min(A) \over 4E_b}.

This definition is normalized so that γc(A) = 1 for 2-PAM or (2×2)-QAM. If the average number 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) > 1, the effective coding gain γeff(A) is less than the nominal coding gain γc(A) by an amount which depends on the steepness of the Pb(E) vs. Eb / N0 curve at the target Pb(E). This curve can be plotted using the union bound estimate (UBE)

P_b(E) \approx K_b(A)Q\sqrt(2\gamma_c(A)E_b/N_0),

where Q(\cdot) 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 P_b(E) \approx 10^{-5} for Reed-Muller codes of length n \le 64:

Code ρ γc γc (dB) Kb γeff (dB)
[8,7,2] 1.75 7/4 2.43 4 2.0
[8,4,4] 1.0 2 3.01 4 2.6
[16,15,2] 1.88 15/8 2.73 8 2.1
[16,11,4] 1.38 11/4 4.39 13 3.7
[16,5,8] 0.63 5/2 3.98 6 3.5
[32,31,2] 1.94 31/16 2.87 16 2.1
[32,26,4] 1.63 13/4 5.12 48 4.0
[32,16,8] 1.00 4 6.02 39 4.9
[32,6,16] 0.37 3 4.77 10 4.2
[64,63,2] 1.97 63/32 2.94 32 1.9
[64,57,4] 1.78 57/16 5.52 183 4.0
[64,42,8] 1.31 21/4 7.20 266 5.6
[64,22,16] 0.69 11/2 7.40 118 6.0
[64,7,32] 0.22 7/2 5.44 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 (M×M)-QAM (i.e. no coding). The nominal coding gain γc(A) is defined as

\gamma_c(A) = {(2^\rho - 1)d^2_\min (A) \over 6E_s}.

This definition is normalized so that γc(A) = 1 for M-PAM or (M×M)-QAM. The UBE becomes

P_s(E) \approx K_s(A)Q\sqrt(3\gamma_c(A)SNR_{norm}),

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

Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Coding Gain — Dieser Artikel wurde auf der Qualitätssicherungsseite des Portals Mathematik eingetragen. Dies geschieht, um die Qualität der Artikel aus dem Themengebiet Mathematik auf ein akzeptables Niveau zu bringen. Dabei werden Artikel gelöscht, die nicht… …   Deutsch Wikipedia

  • Coding theory — is the study of the properties of codes and their fitness for a specific application. Codes are used for data compression, cryptography, error correction and more recently also for network coding. Codes are studied by various scientific… …   Wikipedia

  • List of algebraic coding theory topics — This is a list of algebraic coding theory topics. ARQ[disambiguation needed  ] Adler 32 BCH code BCJR algorithm Berger code Berlekamp Massey algo …   Wikipedia

  • Advanced Video Coding — H.264 Pour les articles homonymes, voir AVC. H.264, ou MPEG 4 AVC (Advanced Video Coding), est une norme de codage vidéo développée conjointement par l UIT T Q.6/SG16 Video Coding Experts Group (VCEG) ainsi que l ISO/CEI Moving Picture Experts… …   Wikipédia en Français

  • Advanced Audio Coding — AAC redirects here. For other uses, see AAC (disambiguation). Advanced Audio Codings iTunes standard AAC file icon Filename extension .m4a, .m4b, .m4p, .m4v, .m4r, .3gp, .mp4, .aac Internet media type audio/aac, audio/aacp, au …   Wikipedia

  • Network coding — is a technique where, instead of simply relaying the packets of information they receive, the nodes of a network will take several packets and combine them together for transmission. This can be used to attain the maximum possible information… …   Wikipedia

  • Context-adaptive binary arithmetic coding — ou CABAC que l on peut traduire par codage arithmétique binaire à contexte adaptatif est un type de codeur entropique utilisé dans la norme de compression vidéo H.264 ou MPEG 4 AVC. Il s agit d un codeur arithmétique dont la compression est dite… …   Wikipédia en Français

  • Dirty paper coding — In telecommunications, dirty paper coding (DPC) is a technique for efficient transmission of digital data through a channel subjected to some interference known to the transmitter. The technique consists of precoding the data in order to cancel… …   Wikipedia

  • Audio Lossless Coding — MPEG 4 Audio Lossless Coding, auch bekannt unter MPEG 4 ALS, ist eine Erweiterung zum MPEG 4 Audio Standard um verlustfreie Audiodatenkompression zu ermöglichen. Die Entwicklung dieser Erweiterung wurde im Dezember 2005 abgeschlossen.… …   Deutsch Wikipedia

  • Replay Gain — (aus dem Englischen: Wiedergabe Verstärkung) ist ein Standard, der beschreibt, wie digitale Audiodateien auf eine gemeinsame wahrgenommene Lautstärke angehoben werden, ohne die in der Datei gespeicherten eigentlichen Audiodaten anzutasten. Der… …   Deutsch Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”