<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE document PUBLIC "-//CNX//DTD CNXML 0.5 plus MathML//EN" "http://cnx.rice.edu/cnxml/0.5/DTD/cnxml_mathml.dtd">
<document xmlns="http://cnx.rice.edu/cnxml" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:bib="http://bibtexml.sf.net/" id="m0548"> 
  
  <name>Error Probability</name>

  <metadata>
  <md:version>2.3</md:version>
  <md:created>2000/08/14</md:created>
  <md:revised>2004/08/09 12:12:32.092 GMT-5</md:revised>
  <md:authorlist>
      <md:author id="dhj">
      <md:firstname>Don</md:firstname>
      
      <md:surname>Johnson</md:surname>
      <md:email>dhj@rice.edu</md:email>
    </md:author>
  </md:authorlist>

  <md:maintainerlist>
    <md:maintainer id="dhj">
      <md:firstname>Don</md:firstname>
      
      <md:surname>Johnson</md:surname>
      <md:email>dhj@rice.edu</md:email>
    </md:maintainer>
    <md:maintainer id="jac3">
      <md:firstname>John</md:firstname>
      <md:othername>Austin</md:othername>
      <md:surname>Cottrell</md:surname>
      <md:email>jac3@rice.edu</md:email>
    </md:maintainer>
  </md:maintainerlist>
  
  <md:keywordlist>
    <md:keyword>error probability</md:keyword>
    <md:keyword>matched filter receiver</md:keyword>
    <md:keyword>digital communication</md:keyword>
    <md:keyword>information communication</md:keyword>
  </md:keywordlist>

  <md:abstract>No matter how large the SNR, no other receiver can provide a smaller probability of error than the matched filter receiver.</md:abstract>
</metadata>
  <content>


    <para id="para1">
      How small should the error probability be?  Out of <m:math display="inline"><m:ci>N</m:ci></m:math> transmitted bits, on
      the average

      <m:math display="inline">
	<m:apply>
	  <m:times/>
	  <m:ci>N</m:ci>
	  <m:ci>
	    <m:msub>
	      <m:mi>p</m:mi>
	      <m:mi>e</m:mi>
	    </m:msub>
	  </m:ci>
	</m:apply>
      </m:math> 
      
      bits will be received in error.  Do note the phrase "on the
      average" here:  Errors occur randomly because of the noise
      introduced by the channel, and we can only predict the
      probability of occurrence.  Since bits are transmitted at a rate
      <m:math display="inline"><m:ci>R</m:ci></m:math>, errors occur
      at an average frequency of

      <m:math display="inline">
	<m:apply>
	  <m:times/>
	  <m:ci>R</m:ci>
	  <m:ci>
	    <m:msub>
	      <m:mi>p</m:mi>
	      <m:mi>e</m:mi>
	    </m:msub>
	  </m:ci>
	</m:apply>
      </m:math> 

      .  Suppose the error probability is an impressively small number
      like

      <m:math display="inline">
	<m:apply>
	  <m:power/>
	  <m:cn>10</m:cn>
	  <m:cn>-6</m:cn>
	</m:apply>
      </m:math>

      .  Data on a computer network like Ethernet is transmitted at a
      rate

      <m:math display="inline">
	<m:apply>
	  <m:eq/>
	  <m:ci>R</m:ci>
	  <m:apply>
	    <m:times/>
	    <m:cn>10</m:cn>
	    <m:ci> Mbps</m:ci>
	  </m:apply>
	</m:apply>
      </m:math>
      
      , which means that errors would occur roughly 100 per second.
      This error rate is very high, requiring a much smaller

      <m:math display="inline">	
	<m:ci>
	  <m:msub>
	    <m:mi>p</m:mi>
	    <m:mi>e</m:mi>
	  </m:msub>
	</m:ci>
      </m:math>

      to achieve a more acceptable average occurrence rate for errors
      occurring.  Because Ethernet is a wireline channel, which means
      the channel noise is small and the attenuation low, obtaining
      very small error probabilities is not difficult.  We do have some
      tricks up our sleeves, however, that can essentially reduce the
      error rate to zero <emphasis>without</emphasis> resorting to
      expending a large amount of energy at the transmitter.  We need
      to understand <term>digital channels</term> and Shannon's Noisy
      Channel Coding theorem.
    </para>

  </content>
</document>
