<?xml version="1.0" encoding="utf-8" standalone="no"?>
<!DOCTYPE document PUBLIC "-//CNX//DTD CNXML 0.5 plus MathML plus QML//EN" "http://cnx.rice.edu/cnxml/0.5/DTD/cnxml_mathml_qml.dtd">
<document xmlns="http://cnx.rice.edu/cnxml" xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:q="http://cnx.rice.edu/qml/1.0" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="chap6">
  
  <name>Problems Dealing with Information Communication</name>
  <metadata>
  <md:version>2.4</md:version>
  <md:created>2001/08/21</md:created>
  <md:revised>2004/09/02 10:30:00 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:maintainerlist>
  
  

  <md:abstract>(Blank Abstract)</md:abstract>
</metadata>

  <content>

    <exercise id="ex6.1">
      <q:item type="text-response" id="item6.1">
        <q:question>
	  <section id="s1">
	    <name>Noise in AM Systems</name>
	    <para id="para6.1">
	      The signal
	  <m:math display="inline">
	    <m:apply>
	      <m:ci type="fn">
		<m:mover><m:mi>s</m:mi><m:mo>_</m:mo></m:mover>
	      </m:ci>
	      <m:ci>t</m:ci>
	    </m:apply>
	  </m:math>
	  emerging from an AM communication system consists of two
	  parts: the message signal
	  
	  <m:math display="inline">
	    <m:apply>
	      <m:ci type="fn">s</m:ci>
	      <m:ci>t</m:ci>
	    </m:apply>
	  </m:math> and additive noise.  The plot shows the message
	  spectrum
	  
	  <m:math display="inline">
	    <m:apply>
	      <m:ci type="fn">S</m:ci>
	      <m:ci>f</m:ci>
	    </m:apply>
	  </m:math> and noise power spectrum
	  
	  <m:math display="inline">
	    <m:apply>
	      <m:ci type="fn">
		<m:msub><m:mi>P</m:mi><m:mi>N</m:mi></m:msub>
	      </m:ci>
	      <m:ci>f</m:ci>
	    </m:apply>
	  </m:math>.  The noise power spectrum lies completely within
	  the signal's band, and has a constant value there of
	  
	  <m:math display="inline">
	    <m:apply>
	      <m:divide/>
	      <m:ci><m:msub><m:mi>N</m:mi><m:mn>0</m:mn></m:msub></m:ci>
	      <m:cn>2</m:cn>
	    </m:apply>
	  </m:math>.
	</para>

	  <figure id="fig1">
	    <media type="image/png" src="spectrum15.png"/>
	  </figure>

	  <list id="list6.1" type="enumerated">
	    <item>
	      What is the message signal's power?  What is the
	      signal-to-noise ratio?
	    </item>
	    <item>
	      Because the power in the message decreases with
	      frequency, the signal-to-noise ratio is not constant
	      within subbands.  What is the signal-to-noise ratio in
	      the upper half of the frequency band?
	    </item>
	    <item>
	      A clever 241 student suggests filtering the message
	      before the transmitter modulates it so that the signal
	      spectrum is <emphasis>balanced</emphasis> (constant)
	      across frequency.  Realizing that this filtering affects
	      the message signal, the student realizes that the
	      receiver must also compensate for the message to arrive
	      intact.  Draw a block diagram of this communication
	      system.  How does this system's signal-to-noise ratio
	      compare with that of the usual AM radio?
	    </item>
	  </list>
	</section></q:question>
	<q:answer><q:response>No answer provided.</q:response></q:answer>
      </q:item>
    </exercise>

    <exercise id="ex6.2">
      <q:item type="text-response" id="item6.2">
        <q:question>
	  <section id="s2">
	    <name>Phase Modulation</name>
	    <para id="para6.2">
	      A message signal
	      
	  <m:math display="inline">
	    <m:apply>
	      <m:ci type="fn">m</m:ci>
	      <m:ci>t</m:ci>
	    </m:apply>
	  </m:math>
	  <term>phase modulates</term> a carrier if the transmitted signal
	  equals
	  
	  <m:math display="block">
	    <m:apply>
	      <m:eq/>
	      <m:apply>
		<m:ci type="fn">x</m:ci>
		<m:ci>t</m:ci>
	      </m:apply>
	      <m:apply>
		<m:times/>
		<m:ci>A</m:ci>
		<m:apply>
		  <m:sin/>
		  <m:apply>
		    <m:plus/>
		    <m:apply>
		      <m:times/>
		      <m:cn>2</m:cn>
		      <m:pi/>
		      <m:ci><m:msub><m:mi>f</m:mi><m:mi>c</m:mi></m:msub></m:ci>
		      <m:ci>t</m:ci>
		    </m:apply>
		    <m:apply>
		      <m:times/>
		      <m:ci><m:msub><m:mi>φ</m:mi><m:mi>d</m:mi></m:msub></m:ci>
		      <m:apply>
			<m:ci type="fn">m</m:ci>
			<m:ci>t</m:ci>
		      </m:apply>
		    </m:apply>
		  </m:apply>
		</m:apply>
	      </m:apply>
	    </m:apply>
	  </m:math>
	  where
	  
	  <m:math display="inline">
	    <m:ci><m:msub><m:mi>φ</m:mi><m:mi>d</m:mi></m:msub></m:ci>
	  </m:math>
	  is known as the phase deviation.  In this problem, the phase
	  deviation is small.  As with all analog modulation schemes,
	  assume that
	  
	  <m:math display="inline">
	    <m:apply>
	      <m:lt/>
	      <m:apply>
		<m:abs/>
		<m:apply>
		  <m:ci type="fn">m</m:ci>
		  <m:ci>t</m:ci>
		</m:apply>
	      </m:apply>
	      <m:cn>1</m:cn>
	    </m:apply>
	  </m:math>
	  , the message is bandlimited to
	  <m:math><m:ci>W</m:ci></m:math> Hz, and the carrier
	  frequency
	  
	  <m:math display="inline">
	    <m:ci><m:msub><m:mi>f</m:mi><m:mi>c</m:mi></m:msub></m:ci></m:math>
	  is much larger than <m:math><m:ci>W</m:ci></m:math>.
	  
	  <list id="list6.2" type="enumerated">
	    <item>What is the transmission bandwidth?</item>
	    <item>Find a receiver for this modulation scheme.</item>
	    <item>What is the signal-to-noise ratio of the
	      received signal?</item>
	  </list>
	  Hint: Use the facts that
	  
	  <m:math display="inline">
	    <m:apply>
	      <m:approx/>
	      <m:apply>
		<m:cos/>
		<m:ci>x</m:ci>
	      </m:apply>
	      <m:cn>1</m:cn>
	    </m:apply>
	  </m:math>
	  and
	  
	  <m:math display="inline">
	    <m:apply>
	      <m:approx/>
	      <m:apply>
		<m:sin/>
		<m:ci>x</m:ci>
	      </m:apply>
	      <m:ci>x</m:ci>
	    </m:apply>
	  </m:math>
	  for small <m:math><m:ci>x</m:ci></m:math>.
	</para>
	</section>
	</q:question>
	<q:answer>
	  <q:response>No answer provided.</q:response>
	</q:answer>
      </q:item>
    </exercise>

    <exercise id="ex6.3">
      <q:item type="text-response" id="item6.3">
        <q:question>
	  <section id="s3">
	    <name>AM Stereo</name>
	    <para id="para6.3">
	      Stereophonic radio transmits two signals simultaneously
	      that correspond to what comes out of the left and right
	      speakers of the receiving radio.  While FM stereo is
	      commonplace, AM stereo is not, but is much simpler to
	      understand and analyze.  An amazing aspect of AM stereo
	      is that both signals are transmitted within the same
	      bandwidth as used to transmit just one.  Assume the left
	      and right signals are bandlimited to
	      <m:math><m:ci>W</m:ci></m:math> Hz.

	  <m:math display="inline">
	    <m:apply>
	      <m:eq/>
	      <m:apply>
		<m:ci type="fn">x</m:ci>
		<m:ci>t</m:ci>
	      </m:apply>
	      <m:apply>
		<m:plus/>
		<m:apply>
		  <m:times/>
		  <m:ci>A</m:ci>
		  <m:apply>
		    <m:plus/>
		    <m:cn>1</m:cn>
		    <m:apply>
		      <m:ci type="fn"><m:msub><m:mi>m</m:mi><m:mi>l</m:mi></m:msub></m:ci> 		      
		      <m:ci>t</m:ci>
		    </m:apply>
		  </m:apply>
		  <m:apply>
		    <m:cos/>
		    <m:apply>
		      <m:times/>
		      <m:cn>2</m:cn>
		      <m:pi/>
		      <m:ci><m:msub><m:mi>f</m:mi><m:mi>c</m:mi></m:msub></m:ci>
		      <m:ci>t</m:ci>
		    </m:apply>
		  </m:apply>
		</m:apply>
		<m:apply>
		  <m:times/>
		  <m:cn>A</m:cn>
		  <m:apply>
		    <m:ci type="fn"><m:msub><m:mi>m</m:mi><m:mi>r</m:mi></m:msub></m:ci>
		    <m:ci>t</m:ci>
		  </m:apply>
		  <m:apply>
		    <m:sin/>
		    <m:apply>
		      <m:times/>
		      <m:cn>2</m:cn>
		      <m:pi/>
		      <m:ci><m:msub><m:mi>f</m:mi><m:mi>c</m:mi></m:msub></m:ci>
		      <m:ci>t</m:ci>
		    </m:apply>
		  </m:apply>
		</m:apply>
	      </m:apply>
	    </m:apply>
	  </m:math>
	  <list id="list6.3" type="enumerated">
	    <item>Find the Fourier transform of
	      
	  <m:math display="inline">
	    <m:apply>
	      <m:ci type="fn">x</m:ci>
	      <m:ci>t</m:ci>
	    </m:apply>
	  </m:math>		  .
	  What is the transmission bandwidth and how does it compare with that
	  of standard AM?
	</item>
	  <item>Let's use a coherent demodulator at the receiver.  The
	    block diagram for this receiver is shown below.  Show that
	    this receiver indeed works: It produces the left and right
	    signals separately.
	  </item>
	  <item>
	    Assume the channel adds white noise to the transmitted
	    signal. Find the signal-to-noise ratio of each signal.
	  </item>
	</list>
	</para>

	  <figure id="fig3">
	    <name>Diagram for part (b)</name>
	    <media type="image/png" src="sys4.png"/>
	  </figure>
	</section></q:question>
	<q:answer><q:response>No answer provided.</q:response></q:answer>
      </q:item>
    </exercise>

    <exercise id="ex6.4">
      <q:item type="text-response" id="item6.4">
        <q:question>
	  <section id="s4">
	    <name>A Novel Communication System</name>
	    <para id="para6.4">
	      A clever system designer claims that the following
	      transmitter has, despite its complexity, advantages over
	      the usual amplitude modulation system.  The message
	      signal
	      
	  <m:math display="inline">
	    <m:apply>
	      <m:ci type="fn">m</m:ci>
	      <m:ci>t</m:ci>
	    </m:apply>
	  </m:math>
	  is bandlimited to <m:math><m:ci>W</m:ci></m:math> Hz, and
	  the carrier frequency
	  
	  <m:math display="inline">
	    <m:ci><m:msub><m:mi>f</m:mi><m:mi>c</m:mi></m:msub></m:ci>
	    <m:mtext>≫</m:mtext>
	    <m:ci>W</m:ci>
	  </m:math>
	  The channel attenuates the transmitted signal
	  
	  <m:math display="inline">
	    <m:apply>
	      <m:ci type="fn">x</m:ci>
	      <m:ci>t</m:ci>
	    </m:apply>
	  </m:math>
	  and adds white noise of spectral height
	  
	  <m:math display="inline">
	    <m:apply>
	      <m:divide/>
	      <m:ci><m:msub><m:mi>N</m:mi><m:mn>0</m:mn></m:msub></m:ci>
	      <m:cn>2</m:cn>
	    </m:apply>
	  </m:math>.
	</para>

	  <figure id="dizznods">
	    <media type="image/png" src="sys5.png"/>
	  </figure>

	  <para id="wutang">
	    The transfer function 

	  <m:math display="inline">
	    <m:apply>
	      <m:ci type="fn">H</m:ci>
	      <m:ci>f</m:ci>
	    </m:apply>
	  </m:math>
	  is given by
	  
	  <m:math display="inline">
	    <m:apply>
	      <m:eq/>
	      <m:apply>
		<m:ci type="fn">m</m:ci>
		<m:ci>t</m:ci>
	      </m:apply>
	      <m:piecewise>
		<m:piece>
		  <m:ci>j</m:ci>
		  <m:apply>
		    <m:lt/>
		    <m:ci>f</m:ci>
		    <m:cn>0</m:cn>
		  </m:apply>
		</m:piece>
		<m:piece>
		  <m:apply>
		    <m:minus/>
		    <m:ci>j</m:ci>
		  </m:apply>
		  <m:apply>
		    <m:gt/>
		    <m:ci>f</m:ci>
		    <m:cn>0</m:cn>
		  </m:apply>
		</m:piece>
	      </m:piecewise>
	    </m:apply>
	  </m:math>
	  <list id="list6.4" type="enumerated">
	    <item>Find an expression for the spectrum of
	      
	  <m:math display="inline">
	    <m:apply>
	      <m:ci type="fn">x</m:ci>
	      <m:ci>t</m:ci>
	    </m:apply>
	  </m:math>. Sketch your answer.
	</item>
	  <item>
	    Show that the usual coherent receiver demodulates this
	    signal.
	  </item>
	  <item>
	    Find the signal-to-noise ratio that results when this
	    receiver is used.
	  </item>
	  <item>
	    Find a superior receiver (one that yields a better
	    signal-to-noise ratio), and analyze its performance.
	  </item>
	</list>
	</para></section></q:question>
	<q:answer><q:response>No answer provided.</q:response></q:answer>
      </q:item>
    </exercise>

    <exercise id="ex6.5">
      <q:item type="text-response" id="item6.5">
        <q:question>
	  <section id="s5">
	    <name>Multi-Tone Digital Communication</name>
	    <para id="para6.5">
	      In a so-called multi-tone system, several bits are
	      gathered together and transmitted simultaneously on
	      different carrier frequencies during a T-second
	      interval.  For example, B bits would be transmitted
	      according to
	      
	  <m:math display="block">
	    <m:apply>
	      <m:eq/>
	      <m:apply>
		<m:ci type="fn">x</m:ci>
		<m:ci>t</m:ci>
	      </m:apply>
	      <m:apply>
		<m:apply>
		  <m:times/>
		  <m:ci>A</m:ci>
		  <m:apply>
		    <m:sum/>
		    <m:bvar><m:ci>k</m:ci></m:bvar>
		    <m:lowlimit><m:cn>0</m:cn></m:lowlimit>
		    <m:uplimit>
		      <m:apply>
			<m:minus/>
			<m:ci>B</m:ci>
			<m:cn>1</m:cn>
		      </m:apply>
		    </m:uplimit>
		    <m:apply>
		      <m:times/>
		      <m:ci><m:msub><m:mi>b</m:mi><m:mi>k</m:mi></m:msub></m:ci>
		      <m:apply>
			<m:sin/>
			<m:apply>
			  <m:times/>
			  <m:cn>2</m:cn>
			  <m:pi/>
			  <m:apply>
			    <m:plus/>
			    <m:ci>k</m:ci>
			    <m:cn>1</m:cn>
			  </m:apply>
			  <m:ci><m:msub><m:mi>f</m:mi><m:mn>0</m:mn></m:msub></m:ci>
			  <m:ci>t</m:ci>
			</m:apply>
		      </m:apply>
		    </m:apply>
		  </m:apply>
		</m:apply>
	      </m:apply>
	    </m:apply>
	  </m:math>
	  for 
	  <m:math>
	    <m:apply>
	      <m:lt/>
	      <m:apply>
		<m:leq/>
		<m:cn>0</m:cn>
		<m:ci>t</m:ci>
	      </m:apply>
	      <m:ci>T</m:ci>
	    </m:apply>
	  </m:math>.
	  
	  Here, 
	  <m:math display="inline">
	    <m:ci><m:msub><m:mi>f</m:mi><m:mn>0</m:mn></m:msub></m:ci>
	  </m:math>
	  is the frequency offset for each bit and it is harmonically
	  related to the bit interval <m:math><m:ci>T</m:ci></m:math>.
	  The value of
	  <m:math display="inline">
	    <m:ci><m:msub><m:mi>b</m:mi><m:mi>k</m:mi></m:msub></m:ci>
	  </m:math>
	  is either 0 or 1.
	  
	  <list id="list6.5" type="enumerated">
	    <item>Find a receiver for this transmission
	      scheme.</item>
	    <item>
	      An ELEC 241 almuni likes digital systems so much that he
	      decides to produce a discrete-time version.  He samples
	      the received signal (sampling interval
	      
	  <m:math display="inline">
	    <m:apply>
	      <m:eq/>
	      <m:ci><m:msub><m:mi>T</m:mi><m:mi>s</m:mi></m:msub></m:ci>
	      <m:apply>
		<m:divide/>
		<m:ci>T</m:ci>
		<m:ci>N</m:ci>
	      </m:apply>
	    </m:apply>
	  </m:math>).  How should <m:math><m:ci>N</m:ci></m:math> be
	  related to B, the number of simultaneously transmitted
	  bits?</item>
	  <item>
	    The alumni wants to find a simple form for the receiver so
	  that his software implementation runs as
	  <emphasis>efficiently</emphasis> as possible.  How would you
	  recommend he implement the receiver?</item>
	</list>
	</para></section></q:question>
	<q:answer><q:response>No answer provided.</q:response></q:answer>
      </q:item>
    </exercise>

    <exercise id="ex6.6">
      <q:item type="text-response" id="item6.6">
        <q:question>
	  <section id="s6">
	    <name>City Radio Channels</name>
	    <para id="para6.6">
	      In addition to additive white noise, metropolitan
	      cellular radio channels also contain multipath: the
	      attenuated signal and a delayed, further attenuated
	      signal are received superimposed.  Multipath occurs
	      because the buildings reflect the signal and the
	      reflected path length between transmitter and receiver
	      is longer than the direct path.
	    </para>

	    <figure id="fig6">
	      <media type="image/png" src="sys6.png"/>
	    </figure>
	    <list id="list6.6" type="enumerated">
	      <item>
		Assume that the length of the direct path is d meters
		and the reflected path is 1.5 times as long.  What is
		the model for the channel, including the multipath and
		the additive noise?</item>
	      <item>
		Assume <m:math><m:ci>d</m:ci></m:math> is 1 km.  Find
		and sketch the magnitude of the transfer function for
		the multipath component of the channel.  How would you
		characterize this transfer function?</item>
	      <item>
		Would the multipath affect AM radio?  If not, why not;
		if so, how so?  Would analog cellular telephone, which
		operates at much higher carrier frequencies (800 MHz
		vs. 1 MHz for radio), be affected or not?  Analog
		cellular telephone uses amplitude modulation to
		transmit voice.</item>
	      <item>
		How would the usual AM receiver be modified to
		minimize multipath effects?  Express your modified
		receiver as a block diagram.</item>
	    </list>
	  </section></q:question>
	<q:answer><q:response>No answer provided.</q:response></q:answer>
      </q:item>
    </exercise>

    <exercise id="ex6.7">
      <q:item type="text-response" id="item6.7">
        <q:question>
	  <section id="s7">
	    <name>Downlink Signal Sets</name>
	    <para id="para6.7">
	      In digital cellular telephone systems, the base station
	      (transmitter) needs to relay different voice signals to
	      several telephones at the same time.  Rather than send
	      signals at different frequencies, a clever Rice engineer
	      suggests using a different signal set for each data
	      stream.  For example, for two simultaneous data streams,
	      she suggests BPSK signal sets that have the depicted
	      basic signals.
	    </para>

	    <figure id="fig7">
	      <media type="image/png" src="sig12.png"/>
	    </figure>
	    <para id="fortheloveofgodivebeenhereforever">
	      Thus, bits are represented in data stream 1 by
	      
	  <m:math display="inline">
	    <m:apply>
	      <m:ci type="fn"><m:msub><m:mi>s</m:mi><m:mn>1</m:mn></m:msub></m:ci>
	      <m:ci>t</m:ci>
	    </m:apply>
	  </m:math>
	  and
	  
	  <m:math display="inline">
	    <m:apply>
	      <m:apply>
		<m:minus/>
		<m:ci type="fn"><m:msub><m:mi>s</m:mi><m:mn>1</m:mn></m:msub></m:ci>
		<m:ci>t</m:ci>
	      </m:apply>
	    </m:apply>
	  </m:math>
	  and in data stream 2 by
	  
	  <m:math display="inline">
	    <m:apply>
	      <m:ci type="fn"><m:msub><m:mi>s</m:mi><m:mn>2</m:mn></m:msub></m:ci>
	      <m:ci>t</m:ci>
	    </m:apply>
	  </m:math>
	  and
	  
	  <m:math display="inline">
	    <m:apply>
	      <m:apply>
		<m:minus/>
		<m:ci type="fn"><m:msub><m:mi>s</m:mi><m:mn>2</m:mn></m:msub></m:ci>
		<m:ci>t</m:ci>
	      </m:apply>
	    </m:apply>
	  </m:math>
	  each of which are modulated by 900 MHz carrier.  The
	  transmitter sends the two data streams so that their bit
	  intervals align.  Each receiver uses a matched filter for
	  its receiver.  The requirement is that each receiver
	  <emphasis>not</emphasis> receive the other's bit stream.
	  
	  <list id="list6.7" type="enumerated">
	    <item>
	      What is the block diagram describing the proposed system?</item>
	    <item>
	      What is the transmission bandwidth required by the
	      proposed system?</item>
	    <item>
	      Will the proposal work?  Does the fact that the two data
	      streams are transmitted in the same bandwidth at the
	      same time mean that each receiver's performance is
	      affected?  Can each bit stream be received without
	      interference from the other?</item>
	  </list>
	</para></section></q:question>
	<q:answer><q:response>No answer provided.</q:response></q:answer>
      </q:item>
    </exercise>
        <exercise id="ex6.8">
      <q:item type="text-response" id="item6.8">
        <q:question>
	  <section id="s8">
	    <name>Mixed Analog and Digital Transmission</name>
	    <para id="para6.8">
	      A signal
	      
	  <m:math display="inline">
	    <m:apply>
	      <m:ci type="fn">m</m:ci>
	      <m:ci>t</m:ci>
	    </m:apply>
	  </m:math>
	  is transmitted using amplitude modulation in the usual way.
	  The signal has bandwidth <m:math><m:ci>W</m:ci></m:math> Hz,
	  and the carrier frequency is

	  <m:math display="inline">
	    <m:ci><m:msub><m:mi>f</m:mi><m:mi>c</m:mi></m:msub></m:ci>
	  </m:math>.  In addition to sending this analog signal, the
	  transmitter also wants to send ASCII text in an
	  <term>auxiliary band</term> that lies slightly above the
	  analog transmission band.  Using an 8-bit representation of
	  the characters and a simple baseband BPSK signal set (the
	  constant signal +1 corresponds to a 0, the constant -1 to a
	  1), the data signal 
	      
	  <m:math display="inline">
	    <m:apply>
	      <m:ci type="fn">d</m:ci>
	      <m:ci>t</m:ci>
	    </m:apply>
	  </m:math> representing the text is
	  transmitted as the same time as the analog signal
	  
	  <m:math display="inline">
	    <m:apply>
	      <m:ci type="fn">m</m:ci>
	      <m:ci>t</m:ci>
	    </m:apply>
	  </m:math>.  The transmission signal spectrum is as shown,
	  and has a total bandwidth B.
	</para>

	  <figure id="fig8">
	    <media type="image/png" src="spectrum14.png"/>
	  </figure>
	  <list id="list6.8" type="enumerated">
	    <item>
	      Write an expression for the time-domain version of the
	      transmitted signal in terms of
	      
	  <m:math display="inline">
	    <m:apply>
	      <m:ci type="fn">m</m:ci>
	      <m:ci>t</m:ci>
	    </m:apply>
	  </m:math>
	  and the digital signal 
	  <m:math display="inline">
	    <m:apply>
	      <m:ci type="fn">d</m:ci>
	      <m:ci>t</m:ci>
	    </m:apply>
	  </m:math>.</item>
	  <item>
	    What is the maximum datarate the scheme can provide in
	    terms of the available bandwidth?</item>
	  <item>
	    Find a receiver that yields both the analog signal and the
	    bit stream.</item>
	   	</list>
	</section></q:question>
	<q:answer><q:response>No answer provided.</q:response></q:answer>
      </q:item>
    </exercise>

    <exercise id="ex6.9">
      <q:item type="text-response" id="item6.9">
        <q:question>
	  <section id="s6.9">
	    <name>Digital and Analog Speech Communication</name>
	    <para id="para6.9">
	      Suppose we transmit speech signals over comparable
	      digital and analog channels.  We want to compare the
	      resulting quality of the received signals.  Assume the
	      transmitters use the same power, and the channels
	      introduce the same attenuation and additive white noise.
	      Assume the speech signal has a 4 kHz bandwidth and, in
	      the digital case, is sampled at an 8 kHz rate with
	      eight-bit A/D conversion.  Assume simple binary source
	      coding and a modulated BPSK transmission scheme.
	      
	      <list id="list6.9" type="enumerated">
		<item>
		  What is the transmission bandwidth of the analog
		  (AM) and digital schemes?</item>
		<item>
		  Assume the speech signal's amplitude has a magnitude
		  less than one.  What is maximum amplitude
		  quantization error introduced by the A/D
		  converter?</item>
		<item>
		  In the digital case, each bit in quantized speech
		  sample is received in error with probability
		  
	  <m:math display="inline">
	    <m:ci><m:msub><m:mi>p</m:mi><m:mi>e</m:mi></m:msub></m:ci>
	  </m:math>
	  that depends on signal-to-noise ratio
	  
	  <m:math display="inline">
	    <m:apply>
	      <m:divide/>
	      <m:ci><m:msub><m:mi>E</m:mi><m:mi>b</m:mi></m:msub></m:ci>
	      <m:ci><m:msub><m:mi>N</m:mi><m:mn>0</m:mn></m:msub></m:ci>
	    </m:apply>
	  </m:math>.  However, errors in each bit have a different
	  impact on the error in the reconstructed speech sample.
	  Find the mean-squared error between the transmitted and
	  received amplitude.</item>
	  <item>
	    In the digital case, the recovered speech signal can be
	    considered to have two noise sources added to each
	    sample's true value: One is the A/D amplitude quantization
	    noise and the second is due to channel errors.  Because
	    these are separate, the total noise power equals the sum
	    of these two.  What is the signal-to-noise ratio of the
	    received speech signal as a function of
	    
	  <m:math display="inline">
	    <m:ci><m:msub><m:mi>p</m:mi><m:mi>e</m:mi></m:msub></m:ci>
	  </m:math>?
	</item>
	  <item>
	    Compute and plot the received signal's signal-to-noise
	    ratio for the two transmission schemes for a few values of
	    channel signal-to-noise ratios.</item>
	  <item>
	    Compare and evaluate these systems.</item>
	</list>
	</para></section></q:question>
	<q:answer><q:response>No answer provided.</q:response></q:answer>
      </q:item>
    </exercise>

         <exercise id="ex6.13">
      <q:item type="text-response" id="item6.13">
        <q:question>
	  <section id="s13">
	    <name>Source Compression</name>
	    <para id="para6.13">
	      Consider the following 5-letter source.
	      </para>
	    <table frame="all" id="table6.10">
	      <tgroup cols="2" align="left" colsep="1" rowsep="1">
		<thead valign="top">
		  <row>
		    <entry>
		      Letter
		    </entry>
		    <entry>
		      Probability
		    </entry>
		  </row>
		</thead>
		<tbody valign="top">
		  <row>
		    <entry>
		      a
		    </entry>
		    <entry>
		      .5
		    </entry>
		  </row>
		  <row>
		    <entry>
		      b
		    </entry>
		    <entry>
		     0.25
		    </entry>
		  </row>
		  <row>
		    <entry>
		      c
		    </entry>
		    <entry>
		     0.125
		    </entry>
		  </row>
		  <row>
		    <entry>
		      d
		    </entry>
		    <entry>
		      0.0625
		    </entry>
		  </row>
		  <row>
		    <entry>
		      e
		    </entry>
		    <entry>
		      0.0625
		    </entry>
		  </row>
		</tbody>
	      </tgroup>
	    </table>
	    <list id="list6.10" type="enumerated">
	      <item>Find this source's entropy</item>
	      <item>Show that the simple binary coding is
		inefficient.</item>
	      <item>Find an unequal-length codebook for this sequence that satisfies the Source Coding Theorem.
		Does your code achieve the entropy limit?</item>
	      <item>How much more efficient is this code than the simple
		binary code?</item>
	    </list>
	  </section></q:question>
	<q:answer><q:response>No answer provided.</q:response></q:answer>
      </q:item>
    </exercise>


    <exercise id="ex6.14">
      <q:item type="text-response" id="i6.14">
        <q:question>
	  <section id="s14">
	    <name>Source Compression</name>
	    <para id="para6.14">
	      Consider the following 5-letter source.
	      </para>
	    <table frame="all" id="table6.11">
	      <tgroup cols="2" align="left" colsep="1" rowsep="1">
		<thead valign="top">
		  <row>
		    <entry>
		      Letter
		    </entry>
		    <entry>
		      Probability
		    </entry>
		  </row>
		</thead>
		<tbody valign="top">
		  <row>
		    <entry>
		      a
		    </entry>
		    <entry>
		      0.4
		    </entry>
		  </row>
		  <row>
		    <entry>
		      b
		    </entry>
		    <entry>
		      0.2
		    </entry>
		  </row>
		  <row>
		    <entry>
		      c
		    </entry>
		    <entry>
		      0.15
		    </entry>
		  </row>
		  <row>
		    <entry>
		      d
		    </entry>
		    <entry>
		      0.15
		    </entry>
		  </row>
		  <row>
		    <entry>
		      e
		    </entry>
		    <entry>
		      0.1
		    </entry>
		  </row>
		</tbody>
	      </tgroup>
	    </table>
	    <list id="list6.11" type="enumerated">
	      <item>Find this source's entropy.</item>
	      <item>Show that the simple binary coding is
		inefficient.</item>
	      <item>Find the Huffman code for this source.
		What is its average code length?</item>
	    </list>
	  </section></q:question>
	<q:answer><q:response>No answer provided.</q:response></q:answer>
      </q:item>
    </exercise>


    <exercise id="ex6.15">
      <q:item type="text-response" id="item6.15">
        <q:question>
	  <section id="s15">
	    <name>Speech Compression</name>
	    <para id="para6.15">
	      When we sample a signal, such as speech, we quantize the
	      signal's amplitude to a set of integers.  For a b-bit
	      converter, signal amplitudes are represented by
	      
	  <m:math display="inline">
	    <m:apply>
	      <m:power/>
	      <m:cn>2</m:cn>
	      <m:ci>b</m:ci>
	    </m:apply>
	  </m:math> integers.  Although these integers could be
	  represented by a binary code for digital transmission, we
	  should consider whether a Huffman coding would be more
	  efficient.
	  
	  <list id="list6.12" type="enumerated">
	    <item>
	      Load into Matlab the segment of speech contained in
	      <code>y.mat</code>.  Its sampled values lie in the
	      interval (-1, 1).  To simulate a 3-bit converter, we use
	      Matlab's round function to create quantized amplitudes
	      corresponding to the integers [0 1 2 3 4 5 6 7].

<code><![CDATA[

	 y_quant = round(3.5*y + 3.5);

]]>
</code>
	      Find the relative frequency of occurrence of quantized
	      amplitude values.  The following Matlab program computes
	      the number of times each quantized value occurs.
	      <code><![CDATA[

for n=0:7
    count(n+1) = sum(y_quant == n);
end

]]>
</code>
	      Find the entropy of this source. 
	    </item>
	    <item>Find the Huffman code for this source.  How
	      would you characterize this source code in
	      words?</item>
	    <item>How many fewer bits would be used in
	      transmitting this speech segment with your Huffman
	      code in comparison to simple binary coding?</item>
	  </list>
	</para></section></q:question>
	<q:answer><q:response>No answer provided.</q:response></q:answer>
      </q:item>
    </exercise>

    <exercise id="ex6.16">
      <q:item type="text-response" id="item6.16">
        <q:question>
	  <section id="s16">
	    <name>Digital Communication</name>
	    <para id="para6.16">
	      In a digital cellular system, a signal bandlimited to
	      5~kHz is sampled with a two-bit A/D converter at its
	      Nyquist frequency.  The sample values are found to have
	      the shown relative frequencies.
	    </para>
	    <table frame="all" id="table6.13">
	      <tgroup cols="2" align="left" colsep="1" rowsep="1">
		<thead valign="top">
		  <row>
		    <entry>
		      Sample Value
		    </entry>
		    <entry>
		      Probability
		    </entry>
		  </row>
		</thead>
		<tbody valign="top">
		  <row>
		    <entry>
		      0
		    </entry>
		    <entry>
		      0.15
		    </entry>
		  </row>
		  <row>
		    <entry>
		      1
		    </entry>
		    <entry>
		      0.35
		    </entry>
		  </row>
		  <row>
		    <entry>
		      2
		    </entry>
		    <entry>
		      0.3
		    </entry>
		  </row>
		  <row>
		    <entry>
		      3
		    </entry>
		    <entry>
		      0.2
		    </entry>
		  </row>
		</tbody>
	      </tgroup>
	    </table>
	    <para id="whyme">
	      We send the bit stream consisting of Huffman-coded
	      samples using one of the two depicted signal sets.
	    </para>

	    <figure id="fig12">
	      <media type="image/png" src="sig11.png"/>
	    </figure>
	    <list id="list6.12andahalf" type="enumerated">
	      <item>What is the datarate of the compressed
		source?</item>
	      <item>Which choice of signal set maximizes the communication system's performance?</item>
	      <item>With no error-correcting coding, what
		signal-to-noise ratio would be needed for your chosen
		signal set to guarantee that the bit error
		probability will not exceed
		
	  <m:math display="inline">
	    <m:apply>
	      <m:power/>
	      <m:cn>10</m:cn>
	      <m:cn>-3</m:cn>
	    </m:apply>
	  </m:math>?  If the receiver moves twice as far from the
	  transmitter (relative to the distance at which the
	  
	  <m:math display="inline">
	    <m:apply>
	      <m:power/>
	      <m:cn>10</m:cn>
	      <m:cn>-3</m:cn>
	    </m:apply>
	  </m:math>
	  error rate was obtained), how does the performance change? </item>
	</list>
	</section></q:question>
	<q:answer><q:response>No answer provided.</q:response></q:answer>
      </q:item>
    </exercise>

    <exercise id="ex6.17">
      <q:item type="text-response" id="item6.17">
        <q:question>
	  <section id="s17">
	    <name>Universal Product Code</name>
	    <para id="para6.17">
	      The Universal Product Code (UPC), often known as a bar
	      code, labels virtually every sold good.  An example of a
	      portion of the code is shown.
	    </para>

	    <figure id="fig17">
	      <media type="image/png" src="sig37.png"/>
	    </figure>

	    <para id="barq">
	      Here a sequence of black and white bars, each having
	      width <m:math><m:ci>d</m:ci></m:math>, presents an
	      11-digit number (consisting of decimal digits) that
	      uniquely identifies the product.  In retail stores,
	      laser scanners read this code, and after accessing a
	      database of prices, enter the price into the cash
	      register.
	  
	  <list id="list6.14" type="enumerated">
	    <item>How many bars must be used to represent a
	      single digit?</item>
	    <item>A complication of the laser scanning system is that the bar code must be read either forwards or backwards.
	      Now how many bars are needed to represent each digit?</item>
	    <item>What is the probability that the 11-digit code
	      is read correctly if the probability of reading a
	      single bit incorrectly is
	      
	  <m:math display="inline">
	    <m:ci><m:msub><m:mi>p</m:mi><m:mi>e</m:mi></m:msub></m:ci>
	  </m:math>?
	</item>
	  <item>How many error correcting bars would need to be
	    present so that any single bar error occurring in the 11-digit code
	    can be corrected?</item>
	</list>
	</para></section></q:question>
	<q:answer><q:response>No answer provided.</q:response></q:answer>
      </q:item>
    </exercise>

    <exercise id="ex6.18">
      <q:item type="text-response" id="item6.18">
        <q:question>
	  <section id="s18">
	    <name>Error Correcting Codes</name>
	    <para id="para6.18">
	      A code maps pairs of information bits into codewords of
	      length 5 as follows.</para>
	    <table frame="all" id="table6.15">
	      <tgroup cols="2" align="left" colsep="1" rowsep="1">
		<thead valign="top">
		  <row>
		    <entry>
		      Data
		    </entry>
		    <entry>
		      Codeword
		    </entry>
		  </row>
		</thead>
		<tbody valign="top">
		  <row>
		    <entry>
		      00
		    </entry>
		    <entry>
		      00000
		    </entry>
		  </row>
		  <row>
		    <entry>
		      01
		    </entry>
		    <entry>
		      01101
		    </entry>
		  </row>
		  <row>
		    <entry>
		      10
		    </entry>
		    <entry>
		      10111
		    </entry>
		  </row>
		  <row>
		    <entry>
		      11
		    </entry>
		    <entry>
		      11010
		    </entry>
		  </row>
		</tbody>
	      </tgroup>
	    </table>
	    <list id="list6.18" type="enumerated">
	      <item>What is this code's efficiency?</item>
	      <item>Find the generator matrix G and parity-check
		matrix H for this code.</item>
	      <item>Give the decoding table for this code.
		How many patterns of 1, 2, and 3 errors are correctly decoded?</item>
	      <item>What is the block error probability (the
		probability of any number of errors occurring in the
		decoded codeword)?</item>
	    </list>
	  </section></q:question>
	<q:answer><q:response>No answer provided.</q:response></q:answer>
      </q:item>
    </exercise>

    <exercise id="ex6.19">
      <q:item type="text-response" id="item6.19">
        <q:question>
	  <section id="s19">
	    <name>Overly Designed Error Correction Codes</name>
	    <para id="para6.19">
	      An Aggie engineer wants not only to have codewords for
	      his data, but also to hide the information from Rice
	      engineers (no fear of the UT engineers).  He decides to
	      represent 3-bit data with 6-bit codewords in which none
	      of the data bits appear explicitly.
	      
	  <m:math display="block">
	    <m:apply>
	      <m:eq/>
	      <m:ci><m:msub><m:mi>c</m:mi><m:mn>1</m:mn></m:msub></m:ci>
	      <m:apply>
		<m:xor/>
		<m:ci><m:msub><m:mi>d</m:mi><m:mn>1</m:mn></m:msub></m:ci>
		<m:ci><m:msub><m:mi>d</m:mi><m:mn>2</m:mn></m:msub></m:ci>
	      </m:apply>
	    </m:apply>
	  </m:math>
	  <m:math display="block">
	    <m:apply>
	      <m:eq/>
	      <m:ci><m:msub><m:mi>c</m:mi><m:mn>2</m:mn></m:msub></m:ci>
	      <m:apply>
		<m:xor/>
		<m:ci><m:msub><m:mi>d</m:mi><m:mn>2</m:mn></m:msub></m:ci>
		<m:ci><m:msub><m:mi>d</m:mi><m:mn>3</m:mn></m:msub></m:ci>
	      </m:apply>
	    </m:apply>
	  </m:math>
	  	  <m:math display="block">
	    <m:apply>
	      <m:eq/>
	      <m:ci><m:msub><m:mi>c</m:mi><m:mn>3</m:mn></m:msub></m:ci>
	      <m:apply>
		<m:xor/>
		<m:ci><m:msub><m:mi>d</m:mi><m:mn>1</m:mn></m:msub></m:ci>
		<m:ci><m:msub><m:mi>d</m:mi><m:mn>3</m:mn></m:msub></m:ci>
	      </m:apply>
	    </m:apply>
	  </m:math>
	  <m:math display="block">
	    <m:apply>
	      <m:eq/>
	      <m:ci><m:msub><m:mi>c</m:mi><m:mn>4</m:mn></m:msub></m:ci>
	      <m:apply>
		<m:xor/>
		<m:ci><m:msub><m:mi>d</m:mi><m:mn>1</m:mn></m:msub></m:ci>
		<m:ci><m:msub><m:mi>d</m:mi><m:mn>2</m:mn></m:msub></m:ci>
		<m:ci><m:msub><m:mi>d</m:mi><m:mn>3</m:mn></m:msub></m:ci>
	      </m:apply>
	    </m:apply>
	  </m:math>
	  	  <m:math display="block">
	    <m:apply>
	      <m:eq/>
	      <m:ci><m:msub><m:mi>c</m:mi><m:mn>5</m:mn></m:msub></m:ci>
	      <m:apply>
		<m:xor/>
		<m:ci><m:msub><m:mi>d</m:mi><m:mn>1</m:mn></m:msub></m:ci>
		<m:ci><m:msub><m:mi>d</m:mi><m:mn>2</m:mn></m:msub></m:ci>
	      </m:apply>
	    </m:apply>
	  </m:math>
	  	  <m:math display="block">
	    <m:apply>
	      <m:eq/>
	      <m:ci><m:msub><m:mi>c</m:mi><m:mn>6</m:mn></m:msub></m:ci>
	      <m:apply>
		<m:xor/>
		<m:ci><m:msub><m:mi>d</m:mi><m:mn>1</m:mn></m:msub></m:ci>
		<m:ci><m:msub><m:mi>d</m:mi><m:mn>2</m:mn></m:msub></m:ci>
		<m:ci><m:msub><m:mi>d</m:mi><m:mn>3</m:mn></m:msub></m:ci>
	      </m:apply>
	    </m:apply>
	  </m:math>
	  <list id="list6.19" type="enumerated">
	    <item>Find the generator matrix G and parity-check matrix H
	      for this code.</item>
	    <item>Find a 3 x 6 matrix that recovers the data bits from
	      the codeword.</item>
	    <item>What is the error correcting capability of the
	      code?</item>
	  </list>
	</para></section></q:question>
	<q:answer><q:response>No answer provided.</q:response></q:answer>
      </q:item>
    </exercise>

    <exercise id="ex6.20">
      <q:item type="text-response" id="item6.20">
        <q:question>
	  <section id="s20">
	    <name>Error Correction?</name>
	    <para id="para6.20">
	      It is important to realize that when more transmission
	      errors than can be corrected, error correction
	      algorithms believe that a smaller number of errors have
	      occurred and correct accordingly.  For example, consider
	      a (7,4) Hamming Code having the generator matrix
	      
	  <m:math display="block">
	    <m:apply>
	      <m:eq/>
	      <m:ci type="matrix">G</m:ci>
	      <m:matrix>
		<m:matrixrow>
		  <m:cn>1</m:cn><m:cn>0</m:cn><m:cn>0</m:cn><m:cn>0</m:cn>
		</m:matrixrow>   <m:matrixrow>
		  <m:cn>0</m:cn><m:cn>1</m:cn><m:cn>0</m:cn><m:cn>0</m:cn>
		</m:matrixrow>
		<m:matrixrow>
		  <m:cn>0</m:cn><m:cn>0</m:cn><m:cn>1</m:cn><m:cn>0</m:cn>
		</m:matrixrow>
		<m:matrixrow>
		  <m:cn>0</m:cn><m:cn>0</m:cn><m:cn>0</m:cn><m:cn>1</m:cn>
		</m:matrixrow>
		<m:matrixrow>
		  <m:cn>1</m:cn><m:cn>1</m:cn><m:cn>1</m:cn><m:cn>0</m:cn>
		</m:matrixrow>
		<m:matrixrow>
		  <m:cn>0</m:cn><m:cn>1</m:cn><m:cn>1</m:cn><m:cn>1</m:cn>
		</m:matrixrow>
		<m:matrixrow>
		  <m:cn>1</m:cn><m:cn>0</m:cn><m:cn>1</m:cn><m:cn>1</m:cn>
		</m:matrixrow>
	      </m:matrix>
	    </m:apply>
	  </m:math>.
	  
	  This code corrects all single-bit error, but if a double bit
	  error occurs, it corrects using a single-bit error
	  correction approach.
	  <list id="list6.17" type="enumerated">
	    <item>How many double-bit errors can occur in a
	      codeword?</item>
	    <item>For each double-bit error pattern, what is the result of channel decoding?
	      Express your result as a binary error sequence for the data
	      bits.</item>
	  </list>
	</para></section></q:question>
	<q:answer><q:response>No answer provided.</q:response></q:answer>
      </q:item>
    </exercise>

    <exercise id="ex6.21">
      <q:item type="text-response" id="item6.21">
        <q:question>
	  <section id="s21">
	    <name>Selective Error Correction</name>
	    <para id="para6.21">
	      We have found that digital transmission errors occur
	      with a probability that remains constant no matter how
	      "important" the bit may be.  For example, in
	      transmitting digitized signals, errors occur as
	      frequently for the most significant bit and they do for
	      the least significant bit.  Yet, the former errors have
	      a much larger impact on the overall signal-to-noise
	      ratio than the latter.  Rather than applying error
	      correction to each sample value, why not concentrate the
	      error correction on the most important bits?  Assume
	      that we sample an 8 kHz signal with an 8-bit A/D
	      converter.  We use single-bit error correction on the
	      most significant four bits and none on the least
	      significant four.  Bits are transmitted using a
	      modulated BPSK signal set over an additive white noise
	      channel.
	      
	      <list id="list6.18d" type="enumerated">
		<item>How many error correction bits must be added to provide
		  single-bit error correction on the most significant
		  bits?</item>
		<item>How large must the signal-to-noise ratio of the
		  received signal be to insure reliable communication?</item>
		<item>Assume that once error correction is applied, only the least significant 4 bits can be received in error.
		  How much would the output signal-to-noise ratio improve using this
		  error correction scheme?</item>
	      </list>
	    </para></section></q:question>
	<q:answer><q:response>No answer provided.</q:response></q:answer>
      </q:item>
    </exercise>

    <exercise id="ex6.22">
      <q:item type="text-response" id="item6.22">
        <q:question>
	  <section id="s22">
	    <name>Compact Disk</name>
	    <para id="para6.22">
	      Errors occur in reading audio compact disks.  Very few
	      errors are due to noise in the compact disk player; most
	      occur because of dust and scratches on the disk surface.
	      Because scratches span several bits, a single-bit error
	      is rare; several <emphasis>consecutive</emphasis> bits
	      in error are much more common.  Assume that scratch and
	      dust-induced errors are four or fewer consecutive bits
	      long.  The audio CD standard requires 16-bit, 44.1 kHz
	      analog-to-digital conversion of each channel of the
	      stereo analog signal.
	      
	      <list id="list6.19effe" type="enumerated">
		<item>
		  How many error-correction bits are required to
		  correct scratch-induced errors for each 16-bit
		  sample?</item>
		<item>
		  Rather than use a code that can correct several
		  errors in a codeword, a clever 241 engineer proposes
		  <emphasis>interleaving</emphasis> consecutive coded
		  samples.  As the cartoon shows, the bits
		  representing coded samples are interpersed before
		  they are written on the CD.  The CD player
		  de-interleaves the coded data, then performs
		  error-correction. Now, evaluate this proposed scheme
		  with respect to the non-interleaved one.
		</item>
	      </list>
	    </para>

	    <figure id="curvacious">
	      <media type="image/png" src="sig43.png"/>
	    </figure>
	  </section></q:question>
	<q:answer><q:response>No answer provided.</q:response></q:answer>
      </q:item>
    </exercise>
    
    <exercise id="ex6.23">
      <q:item type="text-response" id="item6.23">
        <q:question>
	  <section id="s23">
	    <name>Communication System Design</name>
	    <para id="para6.23">
	      RU Communication Systems has been asked to design a
	      communication system that meets the following
	      requirements.
	      
	      <list id="list6.20">
		<item>The baseband message signal has a bandwidth of 10
		  kHz.</item>
		<item>The RUCS engineers find that the entropy H of the sampled
		  message signal depends on how many bits b are used in the A/D
		  converter (see figure below).	    
		</item>
		<item>The signal is to be sent through a noisy channel having a
		  bandwidth of 25 kHz channel centered at 2MHz and a
		  signal-to-noise ratio within that band of 10 dB.</item>
		<item>Once received, the message signal must have
		  a signal-to-noise ratio of at least 20 dB.</item>
	      </list></para>
	    <table frame="all" id="table6.20">
	      <tgroup cols="2" align="left" colsep="1" rowsep="1">
		<thead valign="top">
		  <row>
		    <entry>
		      b
		    </entry>
		    <entry>
		      H
		    </entry>
		  </row>
		</thead>
		<tbody valign="top">
		  <row>
		    <entry>
		      3
		    </entry>
		    <entry>
		      2.19
		    </entry>
		  </row>
		  <row>
		    <entry>
		      4
		    </entry>
		    <entry>
		      3.25
		    </entry>
		  </row>
		  <row>
		    <entry>
		      5
		    </entry>
		    <entry>
		      4.28
		    </entry>
		  </row>
		  <row>
		    <entry>
		      6
		    </entry>
		    <entry>
		      5.35
		    </entry>
		  </row>
		</tbody>
	      </tgroup>
	    </table>
	    <para id="afdasdfasasd">
	  Can these specifcations be met? Justify your answer.
 	</para></section></q:question>
	<q:answer><q:response>No answer provided.</q:response></q:answer>
      </q:item>
    </exercise>
    
    <exercise id="ex6.24">
      <q:item type="text-response" id="item6.24">
        <q:question>
	  <section id="s24">
	    <name>HDTV</name>
	    <para id="para6.24">
	      As HDTV (high-definition television) was being
	      developed, the FCC restricted this digital system to use
	      in the same bandwidth (6 MHz) as its analog (AM)
	      counterpart.  HDTV video is sampled on a 1035 x 1840
	      raster at 30 images per second for each of the three
	      colors.  The least-acceptable picture received by
	      television sets located at an analog station's broadcast
	      perimeter has a signal-to-noise ratio of about 10 dB.
	      
	      <list id="list6.21" type="enumerated">
		<item>
		  Using signal-to-noise ratio as the criterion, how
		  many bits per sample must be used to guarantee that
		  a high-quality picture, which achieves a
		  signal-to-noise ratio of 20 dB, can be received by
		  any HDTV set within the same broadcast
		  region?</item>
		<item>
		  Assuming the digital television channel has the same
		  characteristics as an analog one, how much
		  compression must HDTV systems employ?</item>
	      </list>
	    </para></section></q:question>
	<q:answer><q:response>No answer provided.</q:response></q:answer>
      </q:item>
    </exercise>

    <exercise id="ex6.25">
      <q:item type="text-response" id="item6.25">
        <q:question>
	  <section id="s25">
	    <name>Optimial Ethernet Random Access Protocols</name>
	    <para id="para6.25">
	      Assume a population of <m:math><m:ci>N</m:ci></m:math>
	      computers want to transmit information on a random
	      access channel.  The access algorithm works as follows.
	      
	      <list id="list6.22a">
		<item>
		  Before transmitting, flip a coin that has
		  probability <m:math><m:ci>p</m:ci></m:math> of
		  coming up heads</item>
		<item>
		  If only one of the <m:math><m:ci>N</m:ci></m:math>
		  computer's coins comes up heads, its transmission
		  occurs successfully, and the others must wait until
		  that transmission is complete and then resume the
		  algorithm.</item>
		<item>
		  If none or more than one head comes up, the
		  <m:math><m:ci>N</m:ci></m:math> computers will
		  either remain silent (no heads) or a collision will
		  occur (more than one head).  This unsuccessful
		  transmission situation will be detected by all
		  computers once the signals have propagated the
		  length of the cable, and the algorithm resumes
		  (return to the beginning).</item>
	      </list>
	      <list id="list6.22b" type="enumerated">
		<item>
		  What is the optimal probability to use for flipping
		  the coin?  In other words, what should
		  <m:math><m:ci>p</m:ci></m:math> be to maximize the
		  probability that exactly one computer
		  transmits?</item>
		<item>
		  What is the probability of one computer transmitting
		  when this optimal value of
		  <m:math><m:ci>p</m:ci></m:math> is used as the
		  number of computers grows to infinity?</item>
		<item>
		  Using this optimal probability, what is the average
		  number of coin flips that will be necessary to
		  resolve the access so that one computer successfully
		  transmits?</item>
		<item>
		  Evaluate this algorithm. Is it realistic? Is it
		  efficient?</item>
	      </list>
	    </para></section></q:question>
	<q:answer><q:response>No answer provided.</q:response></q:answer>
      </q:item>
    </exercise>
  </content>
</document>
