Content deleted Content added
m Bot: Migrating 1 interwiki links, now provided by Wikidata on d:q1105671 |
Added {{More citations needed}} tag |
||
(13 intermediate revisions by 6 users not shown) | |||
Line 1:
{{Multiple issues|
{{No footnotes|date=January 2013}}
{{Cleanup|reason = poor formatting, only a single source, and extremely difficult to read|date = October 2014}}
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).▼
{{More citations needed|date=February 2025}}
}}
▲In [[coding theory]], [[telecommunications engineering]] and other related engineering problems, '''coding gain''' is the measure in the difference between the [[signal
==Example==
If the uncoded [[BPSK]] system in [[AWGN]] environment has a [[
==Power-limited regime==
In the ''power-limited regime'' (where the nominal [[spectral efficiency]] <math>\rho \le 2</math> [b/2D or b/s/Hz], ''i.e.'' the ___domain of binary signaling), the effective coding gain <math>\gamma_\mathrm{eff}(A)</math> of a signal set <math>A</math> at a given target error probability per bit <math>P_b(E)</math> is defined as the difference in dB between the <math>E_b/N_0</math> required to achieve the target <math>P_b(E)</math> with <math>A</math> and the <math>E_b/N_0</math> required to achieve the target <math>P_b(E)</math> with 2-[[Pulse-amplitude modulation|PAM]] or (2×2)-[[Quadrature amplitude modulation|QAM]] (''i.e.'' no coding). The nominal coding gain <math>\gamma_c(A)</math> is defined as
: <math>\gamma_c(A) = \frac{d^2_{\min}(A)
This definition is normalized so that <math>\gamma_c(A) = 1</math> for 2-PAM or (2×2)-QAM. If the average number of nearest neighbors per transmitted bit <math>K_b(A)</math> is equal to one, the effective coding gain <math>\gamma_\mathrm{eff}(A)</math> is approximately equal to the nominal coding gain <math>\gamma_c(A)</math>. However, if <math>K_b(A)>1</math>, the effective coding gain <math>\gamma_\mathrm{eff}(A)</math> is less than the nominal coding gain <math>\gamma_c(A)</math> by an amount which depends on the steepness of the <math>P_b(E)</math> ''vs.'' <math>E_b/N_0</math> curve at the target <math>P_b(E)</math>. This curve can be plotted using the [[union bound]] estimate (UBE)
: <math>P_b(E) \approx K_b(A)Q\
where
For the special case of a binary [[linear block code]] <math>C</math> with parameters <math>(n,k,d)</math>, the nominal spectral efficiency is <math>\rho = 2k/n </math> and the nominal coding gain is
==Example==
The table below lists the nominal spectral efficiency, nominal coding gain and effective coding gain at <math>P_b(E) \approx 10^{-5}</math> for [[
{| class="wikitable"
! Code !! <math>\rho</math> !! <math>\gamma_c</math> !! <math>\gamma_c</math> (dB) !! <math>K_b</math> !! <math>\gamma_\mathrm{eff}</math> (dB)
|-
| [8,7,2] || 1.75 || 7/4 || 2.43 || 4 || 2.0
Line 55 ⟶ 59:
==Bandwidth-limited regime==
In the ''bandwidth-limited regime'' (<math>\rho >
: <math>\gamma_c(A) = {(2^\rho - 1)d^2_{\min} (A) \over 6E_s}.</math>
This definition is normalized so that <math>\gamma_c(A) = 1</math> for M-PAM or (''M''×''M'')-QAM. The UBE becomes
: <math>P_s(E) \approx K_s(A)Q\sqrt
where <math>K_s(A)</math> is the average number of nearest neighbors per two dimensions.
|