<?xml version="1.0" encoding="utf-8" standalone="no"?>
<!DOCTYPE module PUBLIC "-//CNX//DTD CNXML 0.3.5 plus MathML//EN" "http://cnx.rice.edu/cnxml/0.3.5/DTD/cnxml_mathml.dtd">
<module xmlns="http://cnx.rice.edu/cnxml/0.3.5" xmlns:m="http://www.w3.org/1998/Math/MathML" id="m0098" levelmask="0" created="2000-11-08" revised="2001-05-31" version="2.4">

  <name xmlns:m="http://www.w3.org/1998/Math/MathML">Capacity of a Channel</name>

<metadata xmlns:m="http://www.w3.org/1998/Math/MathML">

 
  <authorlist xmlns:m="http://www.w3.org/1998/Math/MathML"> 
    <author xmlns:m="http://www.w3.org/1998/Math/MathML" id="dhj">
      <firstname xmlns:m="http://www.w3.org/1998/Math/MathML">Don</firstname>
      <othername xmlns:m="http://www.w3.org/1998/Math/MathML">H.</othername>
      <surname xmlns:m="http://www.w3.org/1998/Math/MathML">Johnson</surname>
      <email xmlns:m="http://www.w3.org/1998/Math/MathML">dhj@rice.edu</email>
    </author>
  </authorlist> 
  
  <maintainerlist xmlns:m="http://www.w3.org/1998/Math/MathML">
    <maintainer xmlns:m="http://www.w3.org/1998/Math/MathML" id="dhj">
      <firstname xmlns:m="http://www.w3.org/1998/Math/MathML">Don</firstname>
      <othername xmlns:m="http://www.w3.org/1998/Math/MathML">H.</othername>
      <surname xmlns:m="http://www.w3.org/1998/Math/MathML">Johnson</surname>
      <email xmlns:m="http://www.w3.org/1998/Math/MathML">dhj@rice.edu</email>
   </maintainer>
    
    <maintainer xmlns:m="http://www.w3.org/1998/Math/MathML" id="jac3">
      <firstname xmlns:m="http://www.w3.org/1998/Math/MathML">John</firstname>
      <othername xmlns:m="http://www.w3.org/1998/Math/MathML">Austin</othername>
      <surname xmlns:m="http://www.w3.org/1998/Math/MathML">Cottrell</surname>
      <lineage xmlns:m="http://www.w3.org/1998/Math/MathML">III</lineage>
      <email xmlns:m="http://www.w3.org/1998/Math/MathML">jac3@rice.edu</email>
   </maintainer>
  </maintainerlist>
  
  
  <keywordlist xmlns:m="http://www.w3.org/1998/Math/MathML">
    <keyword xmlns:m="http://www.w3.org/1998/Math/MathML">bandlimited</keyword>
    <keyword xmlns:m="http://www.w3.org/1998/Math/MathML">white noise</keyword>
    <keyword xmlns:m="http://www.w3.org/1998/Math/MathML">channel</keyword>
    <keyword xmlns:m="http://www.w3.org/1998/Math/MathML">datarate</keyword>
    <keyword xmlns:m="http://www.w3.org/1998/Math/MathML">capacity</keyword>
    <keyword xmlns:m="http://www.w3.org/1998/Math/MathML">Shannon</keyword>
    <keyword xmlns:m="http://www.w3.org/1998/Math/MathML">signal-to-noise ratio</keyword>
    <keyword xmlns:m="http://www.w3.org/1998/Math/MathML">SNR</keyword>
    <keyword xmlns:m="http://www.w3.org/1998/Math/MathML">error-correcting code</keyword>
    <keyword xmlns:m="http://www.w3.org/1998/Math/MathML">error correction</keyword>
    <keyword xmlns:m="http://www.w3.org/1998/Math/MathML">digital communication</keyword>
    <keyword xmlns:m="http://www.w3.org/1998/Math/MathML">information communication</keyword>
  </keywordlist>

<abstract xmlns:m="http://www.w3.org/1998/Math/MathML">Shannon derived the maximum datarate of a source coder's output that can be transmitted through a bandlimited additive white noise channel with no error.</abstract>
</metadata>
<content xmlns:m="http://www.w3.org/1998/Math/MathML">

  
<para xmlns:m="http://www.w3.org/1998/Math/MathML" id="par1">
   In addition to the <cnxn xmlns:m="http://www.w3.org/1998/Math/MathML" module="0073" strength="4">Noisy Channel Coding Theorem and its converse</cnxn>, Shannon also derived the capacity for a bandlimited (to  
<m:math display="inline"><m:ci>W</m:ci></m:math> Hz)
additive white noise channel. For this case, the signal set is unrestricted, even to the
point that more than one bit can be transmitted each "bit interval." Instead of
constraining channel code efficiency, the revised Noisy Channel Coding Theorem
states that some error-correcting code exists such that as the block length
increases, error-free transmission is possible if the source coder's datarate,  

    <m:math display="inline">
      <m:apply>
	<m:times/>
	<m:apply>
	  <m:mean/>
	  <m:apply>
	    <m:ci type="fn">B</m:ci>
	    <m:ci>A</m:ci>
	  </m:apply>
	</m:apply>
	<m:ci>R</m:ci>
      </m:apply>
    </m:math>, is less than
capacity.

    <equation xmlns:m="http://www.w3.org/1998/Math/MathML" id="eq0001">
      <m:math display="block">
	<m:apply>
	  <m:eq/>
	    <m:ci>C</m:ci>
	    <m:apply>
	      <m:times/>
		<m:ci>W</m:ci>
		<m:apply>
		  <m:log/>
		    <m:logbase>
		    <m:cn>2</m:cn>
		    </m:logbase>
		  <m:apply>
		    <m:plus/>
		    <m:cn>1</m:cn>
		    <m:ci>SNR</m:ci>
		  </m:apply>
		</m:apply>
	    </m:apply>
	</m:apply>
	<m:mtext> bits/s</m:mtext>
      </m:math>
    </equation>
    
This result proscribes the maximum datarate of the source coder's
output that can be transmitted through the bandlimited channel with no
error.
    <!--<annotation type='teacher'>-->
    (The bandwidth restriction arises not so much from channel properties, but from spectral regulation, especially for wireless channels.)
    <!--</annotation>-->
    Shannon's proof of his theorem was very clever, and did not indicate what this code
might be; it has never been found. Codes such as the Hamming code work quite well in
    practice to keep error rates low, but they remain greater than zero. Until the "magic" code
    is found, more important in communication system design is the converse. It states that if
    your data rate exceeds capacity, errors will overwhelm you no matter what channel
    coding you use. For this reason, capacity calculations are made to place limits on
    transmission rates.</para> 
  <exercise xmlns:m="http://www.w3.org/1998/Math/MathML" id="exer1">
    <problem xmlns:m="http://www.w3.org/1998/Math/MathML"><para xmlns:m="http://www.w3.org/1998/Math/MathML" id="prob1">The first definition of capacity applies only for binary symmetric channels, and represents the number of bits/transmission. The second result states capacity more generally, having units of bits/second. How would you convert the first definition's result into units of bits/second?</para>
    </problem>
    <solution xmlns:m="http://www.w3.org/1998/Math/MathML"><para xmlns:m="http://www.w3.org/1998/Math/MathML" id="sol1">
	To convert to bits/second, we divide the capacity stated in bits/transmission by the bit interval
	duration <m:math display="inline"><m:ci>T</m:ci></m:math>.</para>
    </solution>
  </exercise>
  <example xmlns:m="http://www.w3.org/1998/Math/MathML" id="ex01"> <para xmlns:m="http://www.w3.org/1998/Math/MathML" id="par2"> 
 The telephone channel has a bandwidth of 3 kHz and a signal-to-noise ratio exceeding
30 dB (at least they promise this much). The maximum data rate a modem can produce
for this wireline channel and hope that errors will not become rampant is the
capacity.

      <equation xmlns:m="http://www.w3.org/1998/Math/MathML" id="eq0002">
	<m:math display="block">
	  <m:apply>
	    <m:eq/>
	    <m:ci>C</m:ci>
	    <m:apply>
	      <m:times/>
	      <m:cn>3</m:cn>
	      <m:apply>
		<m:power/>
      <m:cn>10</m:cn>
      <m:cn>3</m:cn>
    </m:apply>
      <m:apply>
	<m:log/>
	<m:logbase>
	  <m:cn>2</m:cn>
	</m:logbase>
	<m:apply>
	  <m:plus/>
	  <m:cn>1</m:cn>
	  <m:apply>
	    <m:power/>
	    <m:cn>10</m:cn>
	    <m:cn>3</m:cn>
	  </m:apply>
	</m:apply>
      </m:apply>
    </m:apply>
      <m:apply>
	<m:cn>29.901</m:cn>
	<m:mtext> kbps</m:mtext>
      </m:apply>
    </m:apply>
    </m:math>
    </equation> 
      
Thus, the so-called 33 kbps modems operate right at the capacity limit.
</para></example>
<para xmlns:m="http://www.w3.org/1998/Math/MathML" id="par3">   Note that the data rate allowed by the capacity can exceed the bandwidth when the signal-to-noise
    ratio exceeds   <m:math display="inline"><m:cn>0</m:cn><m:mtext> dB</m:mtext></m:math>.
Our results for BPSK and FSK indicated the bandwidth they require exceeds  

    <m:math display="inline">
      <m:apply>
	<m:divide/>
	  <m:cn>1</m:cn>
	  <m:ci>T</m:ci>
      </m:apply>
    </m:math>.
What kind of signal sets might be used to achieve capacity? Modem signal sets send more than one bit/transmission using a number, one of the most popular of
which is  <emphasis xmlns:m="http://www.w3.org/1998/Math/MathML">multi-level signaling</emphasis>. Here, we can transmit several bits during one
transmission interval by representing bit by some signal's amplitude. For example, two
bits can be sent with a signal set comprised of a sinusoid with amplitudes of  

    <m:math display="inline">
      <m:ci>
	<m:mo>±</m:mo>
	<m:mi>A</m:mi>
      </m:ci>
    </m:math>

 and  

    <m:math display="inline">
      <m:mo>±</m:mo>
      <m:apply>
	<m:divide/>
	<m:ci>
	  <m:mi>A</m:mi>
	</m:ci>
	<m:cn>2</m:cn>
      </m:apply>
    </m:math>.
</para>
    


</content>
</module>
