Loading [MathJax]/jax/output/HTML-CSS/fonts/TeX/fontdata.js

Exercise 1.17: About the Channel Coding Theorem

From LNTwww

Channel capacity  (green)  and code rates  (red dots)  of some established systems

The graph shows the maximum allowable code rate  R<C  according to Shannon's  "channel coding theorem":

  • The green curve indicates the channel capacity  C  for the AWGN channel assuming a binary input signal  ("BPSK").
  • In the  Exercise 1.17Z  a simple approximation is given for this.  With the second abscissa
x=1.6dB+10lgEB/N01dB
results approximately:
C{1e0.4x0forx>0,forx<0.
  • For  R<C,  a code can be found which leads to the error probability  "zero"  for infinitely long blocks  (n)
  • What this code looks like is not determined by the channel coding theorem and does not matter for this exercise.


Drawn into the graph as dots are the characteristics of established coding systems:

  • The dots  XYZ  mark three Hamming codes of different code lengths, namely with  n=7n=15  and  n=31.
  • The coding system  W  is characterized by the parameters  R=0.5  and  10 lgEB/N0=3dB .



Hints:

  • The information theoretical limit  "channel capacity"  refers to the error probability  BER=0.
  • The plotted points of real transmission systems,  on the other hand,  result under the assumption  BER=105.



Questions

1

Which of the points belong to which Hamming code? Note:   The graph was created for  BER=105 .

X  denotes the  (7,4,3) Hamming code.
Y  denotes the  (15,11,3) Hamming code.
Z  denotes the  (31,26,3) Hamming code.

2

In what direction(s) will the points  XY  and  Z  shift if the graph is to be created for  BER=1010 ?

To the left,
to the right,
to the top.

3

To what code rate  Rmax  could you run a system with the same  EB/N0=3 dB  as system  W ?

Rmax = 

4

By what factor  A>1  could the transmit power of system  W  be decreased according to the channel capacity curve with  R=0.5 ?

A = 


Solution

(1)  Correct are  all proposed solutions:

  • From the graph you can already see that the rate of  Z  is greater than the rate of  Y  and the rate of  Y  is greater than the rate of  X.
  • The actual rates of these three systems are  RX=4/7=0.571RY=11/15=0.733,  and RZ=26/31=0.839.
  • In addition,  since the  (31,26,3)  Hamming code   ⇒   code  Z  has the largest code word length  n,  it requires  n  despite a larger code rate  R  for  BER=105  a smaller  EB/N0  than the other two Hamming codes.


(2)  Correct is  the answer 2:

  • For a smaller bit error rate,  one always needs a larger  EB/N0.
  • There is no vertical shift,  because even with  BER=1010  there is no change in the code rates.


(3)  For the logarithmized AWGN parameter  10·lgEB/N0=3 dB,  we obtain the auxiliary quantity  x=1.6+3=4.6.  This gives:

Rmax=C(x=4.6)=1e0.44.6=0.84_.


(4)  Now,  according to the given equation:

1e0.4x=0.5x=ln(0.5)0.4=1.7310lgEB/N0=1.731.6=0.13dB.
  • 10·lgEB/N0  could thus be decreased by  3 dB0.13 dB=2.87 dB,  i.e. by a factor  A=100.287=1.94_.