<?xml version="1.0" encoding="utf-8" standalone="no"?>
<!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:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="Module.2004-02-19.1952">
  <name>Introduction</name>
  <metadata>
  <md:version>1.5</md:version>
  <md:created>2004/02/19 08:19:52 US/Central</md:created>
  <md:revised>2004/02/28 06:08:49.810 US/Central</md:revised>
  <md:authorlist>
    <md:author id="aaz">
      <md:firstname>Behnaam</md:firstname>
      
      <md:surname>Aazhang</md:surname>
      <md:email>aaz@ece.rice.edu</md:email>
    </md:author>
    <md:author id="Anders">
      <md:firstname>Anders</md:firstname>
      
      <md:surname>Gjendemsjo</md:surname>
      <md:email>gjendems@NO-SPAM.tele.ntnu.no</md:email>
    </md:author>
  </md:authorlist>

  <md:maintainerlist>
    <md:maintainer id="Anders">
      <md:firstname>Anders</md:firstname>
      
      <md:surname>Gjendemsjo</md:surname>
      <md:email>gjendems@NO-SPAM.tele.ntnu.no</md:email>
    </md:maintainer>
  </md:maintainerlist>
  
  <md:keywordlist>
    <md:keyword>Introduction</md:keyword>
    <md:keyword>Information</md:keyword>
    <md:keyword>Statistics</md:keyword>
  </md:keywordlist>

  <md:abstract>Introduction to Information and Entropy</md:abstract>
</metadata>

  <content>
    <para id="p0">
      In this and the following modules the basic concepts of information
      theory will be introduced. For simplicity we assume that the signals
      are time discrete. Time discrete signals often arise from sampling a time
      continous signal. The assumption of time discrete signal is valid because
      we will only be looking at <cnxn target="f2" document="m11443">bandlimited signals</cnxn>.
      (Which can, <cnxn target="s4" document="m11419">as we know</cnxn>, 
      be perfectly reconstructed).
    </para>

    <para id="p1">
      In treating time discrete signal and their information content we have
      to distinguish between two types of signals: 
      <list id="l1">
	<item>signals have amplitude levels belonging to
	a <emphasis>finite</emphasis> set</item> 

	<item>signals that have amplitudes
	taken from the real line</item>
      </list>
      In the first case we can measure the information content in terms 
      of <cnxn document="m11839">entropy</cnxn>, while in the second case the entropy
      is infinte and we must resort to characterise the source by means of 
      <cnxn document="m11840">differential entropy</cnxn>. 
    </para>
    <section id="s1">
      <name>Examples of information sources</name>
      <para id="s1p1">
      The signals treated are mainly of a stochastic nature, i.e. the signal
      is unknown to us. 

      Since the signal is not known to the destination
      (because of it's stochastic nature), it is then best
      modeled as a random process, discrete-time or continuous time.
      Examples of information sources that we model as random processes are:
    </para>

    <para id="s0p2">
      <list id="list1" type="bulleted">
	<item>Digital data source (e.g. a text) can be modeled as a 
	  random process.
	</item>
	<item>
	  Video signals can be modeled as a random
	  process.  Such signals are mainly bandlimited to
	  around 5 MHz (the value depends on the standards used to
	  raster the frames of image).
	</item>
	<item>
	  Audio signals can be modeled as a random
	  process.  Speech is typically between 300 Hz and
	  3400 Hz, see <cnxn target="f1"/>.
	</item>
      </list>
      <figure id="f1">
	<media type="image/png" src="voiceband.png"/>
	<caption>Power spectral density plot of speech</caption>
      </figure>
    </para>
    <para id="para3">
      Video and speech are analog information signals are bandlimited.  Therefore, if
      sampled faster than two times the highest fequency component, they can be reconstructed
      from their sample values.
    </para>

    <example id="example1">
      <para id="para4">
	A speech signal with bandwidth of 3100 Hz can be sampled at
	the rate of 6.2 KHz.  If the samples are quantized with a 8
	level quantizer then the speech signal can be represented with
	a binary sequence with bit rate
	<equation id="eq01">
	  <m:math display="block">
	    <m:apply>
	      <m:eq/>
              <m:apply>
                <m:times/>
		<m:cn>6200</m:cn>
		<m:apply>
		  <m:log/>
		  <m:logbase>
		    <m:cn>2</m:cn>
		  </m:logbase>
		  <m:cn>8</m:cn>
		</m:apply>
              </m:apply>
              <m:apply>
                <m:times/>
		<m:cn>18600</m:cn>
		<m:ci> bits/sec</m:ci>
              </m:apply>
	    </m:apply>
	  </m:math>
	</equation>
      </para>
      
      <figure id="f2">
	<media type="image/png" src="voicesamp.png"/>
	<caption>Analog speech signal sampled and quantised</caption>
      </figure>
      
      <para id="exa1p1">
	The sampled real values can be quantized to create a discrete-time
	discrete-valued random process.
      </para>
    </example>
    </section>
    <section id="s2">
      <name>The Core of Information theory</name>
      <para id="s2p1">
      The key observation from the discussion above is
      that for a reveiver the signals are <emphasis>unknown</emphasis>.
      It is exact this uncertainty that enables the signal
      to transmit information. This is the core of information theory:
      
      <note type="Information transfer">
	Information transfer happens when the receiver is
	unable to know or predict at message before it is
	received.	
      </note>
      </para>
    </section>

    <section id="s3">
      <name>Some statistics</name>
      <para id="s3p1">
	Here we present some statistics with the intent of
	reviewing a few basic concepts and to introduce the notation.
      </para>
      <para id="s3p2">
	Let X be a <emphasis>stochastic</emphasis> variable. Let
	<m:math>
	  <m:apply>
	    <m:eq/>
	    <m:ci>X</m:ci>
	    <m:ci><m:msub><m:mi>x</m:mi><m:mi>i</m:mi></m:msub></m:ci>
	  </m:apply>
	</m:math> and
	<m:math>
	  <m:apply>
	    <m:eq/>
	    <m:ci>X</m:ci>
	    <m:ci><m:msub><m:mi>x</m:mi><m:mi>j</m:mi></m:msub></m:ci>
	  </m:apply>
	</m:math> denote two outcomes of X.
      </para>
      <para id="s3p3">
	<list id="l2">
	  <item>
	<emphasis>Dependent</emphasis> outcomes implies:
	<m:math>
	  <m:apply>
	    <m:eq/>
	    <m:apply>
	      <m:csymbol definitionURL="http://cnx.rice.edu/cd/cnxmath.ocd#probability"/>
	      <m:apply>
		<m:eq/>
		<m:ci>X</m:ci>
		<m:ci><m:msub><m:mi>x</m:mi><m:mi>i</m:mi></m:msub></m:ci>
	      </m:apply>
	      <m:apply>
		<m:eq/>
		<m:ci>X</m:ci>
		<m:ci><m:msub><m:mi>x</m:mi><m:mi>j</m:mi></m:msub></m:ci>
	      </m:apply>
	    </m:apply>
	    <m:apply>
	      <m:times/>
	      <m:apply>
		<m:csymbol definitionURL="http://cnx.rice.edu/cd/cnxmath.ocd#probability"/>
		<m:apply>
		  <m:eq/>
		  <m:ci>X</m:ci>
		  <m:ci><m:msub><m:mi>x</m:mi><m:mi>i</m:mi></m:msub></m:ci>
		</m:apply>
	      </m:apply>
	      <m:apply>
		<m:csymbol definitionURL="http://cnx.rice.edu/cd/cnxmath.ocd#probability"/>
		<m:condition>
		  <m:ci><m:msub><m:mi>x</m:mi><m:mi>i</m:mi></m:msub></m:ci>
		</m:condition>
		<m:apply>
		  <m:eq/>
		  <m:ci>X</m:ci>
		  <m:ci><m:msub><m:mi>x</m:mi><m:mi>j</m:mi></m:msub></m:ci>
		</m:apply>
	      </m:apply>
	    </m:apply>
	    <m:apply>
	      <m:times/>
	      <m:apply>
		<m:csymbol definitionURL="http://cnx.rice.edu/cd/cnxmath.ocd#probability"/>
		<m:apply>
		  <m:eq/>
		  <m:ci>X</m:ci>
		  <m:ci><m:msub><m:mi>x</m:mi><m:mi>j</m:mi></m:msub></m:ci>
		</m:apply>
	      </m:apply>
	      <m:apply>
		<m:csymbol definitionURL="http://cnx.rice.edu/cd/cnxmath.ocd#probability"/>
		<m:condition>
		  <m:ci><m:msub><m:mi>x</m:mi><m:mi>j</m:mi></m:msub></m:ci>
		</m:condition>
		<m:apply>
		  <m:eq/>
		  <m:ci>X</m:ci>
		  <m:ci><m:msub><m:mi>x</m:mi><m:mi>i</m:mi></m:msub></m:ci>
		</m:apply>
	    </m:apply>
	  </m:apply><!--slutt likhetstegn-->
	  </m:apply>
	</m:math>
	  </item>
	  <item>
	    <emphasis>Independent</emphasis> outcomes implies
	    <m:math>
	      <m:apply>
		<m:eq/>
		<m:apply>
		  <m:csymbol definitionURL="http://cnx.rice.edu/cd/cnxmath.ocd#probability"/>
		  <m:apply>
		    <m:eq/>
		    <m:ci>X</m:ci>
		    <m:ci><m:msub><m:mi>x</m:mi><m:mi>i</m:mi></m:msub></m:ci>
		  </m:apply>
		  <m:apply>
		    <m:eq/>
		    <m:ci>X</m:ci>
		    <m:ci><m:msub><m:mi>x</m:mi><m:mi>j</m:mi></m:msub></m:ci>
		  </m:apply>
		</m:apply>
		<m:apply>
		  <m:times/>
		  <m:apply>
		    <m:csymbol definitionURL="http://cnx.rice.edu/cd/cnxmath.ocd#probability"/>
		    <m:apply>
		      <m:eq/>
		      <m:ci>X</m:ci>
		      <m:ci><m:msub><m:mi>x</m:mi><m:mi>i</m:mi></m:msub></m:ci>
		    </m:apply>		    
		  </m:apply>
		  <m:apply>
		    <m:csymbol definitionURL="http://cnx.rice.edu/cd/cnxmath.ocd#probability"/>
		    <m:apply>
		      <m:eq/>
		      <m:ci>X</m:ci>
		      <m:ci><m:msub><m:mi>x</m:mi><m:mi>j</m:mi></m:msub></m:ci>
		    </m:apply>		    
		  </m:apply>
		</m:apply>
		</m:apply>
	    </m:math>		
	  </item>
	  <item>
	    Bayes' rule:
	  <m:math>
	    <m:apply>
	      <m:eq/>

	      <m:apply>
		<m:csymbol definitionURL="http://cnx.rice.edu/cd/cnxmath.ocd#probability"/>
		<m:condition>
		  <m:ci><m:msub><m:mi>x</m:mi><m:mi>i</m:mi></m:msub></m:ci>
		</m:condition>
		<m:apply>
		  <m:eq/>
		  <m:ci>X</m:ci>
		  <m:ci><m:msub><m:mi>x</m:mi><m:mi>j</m:mi></m:msub></m:ci>
		</m:apply>
	      </m:apply>

	      <m:apply>
		<m:divide/>
		<m:apply>
		  <m:times/>

		  <m:apply>
		    <m:csymbol definitionURL="http://cnx.rice.edu/cd/cnxmath.ocd#probability"/>
		    <m:condition>
		      <m:ci><m:msub><m:mi>x</m:mi><m:mi>j</m:mi></m:msub></m:ci>
		    </m:condition>
		    <m:apply>
		      <m:eq/>
		      <m:ci>X</m:ci>
		      <m:ci><m:msub><m:mi>x</m:mi><m:mi>i</m:mi></m:msub></m:ci>
		    </m:apply>
		  </m:apply>

		  <m:apply>
		    <m:csymbol definitionURL="http://cnx.rice.edu/cd/cnxmath.ocd#probability"/>
		    <m:apply>
		      <m:eq/>
		      <m:ci>X</m:ci>
		      <m:ci><m:msub><m:mi>x</m:mi><m:mi>j</m:mi></m:msub></m:ci>
		    </m:apply>
		  </m:apply>
		</m:apply>
		<m:apply>
		  <m:csymbol definitionURL="http://cnx.rice.edu/cd/cnxmath.ocd#probability"/>
		  <m:apply>
		      <m:eq/>
		      <m:ci>X</m:ci>
		      <m:ci><m:msub><m:mi>x</m:mi><m:mi>i</m:mi></m:msub></m:ci>
		    </m:apply>
		</m:apply>
	      </m:apply>
	    </m:apply>
	  </m:math>
	</item>
	  </list>
	More about basic probability theory and a derivation of Bayes' 
	rule can be found <cnxn document="m11245">here</cnxn>.
      </para>
    </section>

  </content>

</document>
