<?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="m11222">

  <name xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Non-Gaussian Detection Theory: Problems</name>

  <metadata xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
  <md:version xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">1.4</md:version>
  <md:created xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">2003/06/02</md:created>
  <md:revised xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">2003/09/19 11:15:05.417 GMT-5</md:revised>
  <md:authorlist xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
    <md:author xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="dhj">
      <md:firstname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Don</md:firstname>
      
      <md:surname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Johnson</md:surname>
      <md:email xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">dhj@rice.edu</md:email>
    </md:author>
  </md:authorlist>

  <md:maintainerlist xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
    <md:maintainer xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="dhj">
      <md:firstname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Don</md:firstname>
      
      <md:surname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Johnson</md:surname>
      <md:email xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">dhj@rice.edu</md:email>
    </md:maintainer>
    <md:maintainer xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="erkrause">
      <md:firstname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Eileen</md:firstname>
      
      <md:surname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Krause</md:surname>
      <md:email xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">erkrause@rice.edu</md:email>
    </md:maintainer>
    <md:maintainer xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="kclarks">
      <md:firstname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Kyle</md:firstname>
      
      <md:surname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Clarkson</md:surname>
      <md:email xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">kclarks@rice.edu</md:email>
    </md:maintainer>
    <md:maintainer xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="lizzardg">
      <md:firstname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Elizabeth</md:firstname>
      
      <md:surname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Gregory</md:surname>
      <md:email xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">lizzardg@rice.edu</md:email>
    </md:maintainer>
    <md:maintainer xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="kevinduh">
      <md:firstname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Kevin</md:firstname>
      
      <md:surname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Duh</md:surname>
      <md:email xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">kevinduh@rice.edu</md:email>
    </md:maintainer>
    <md:maintainer xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="mariyah">
      <md:firstname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Mariyah</md:firstname>
      
      <md:surname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Poonawala</md:surname>
      <md:email xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">mariyah@rice.edu</md:email>
    </md:maintainer>
    <md:maintainer xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="mjeanes">
      <md:firstname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Matthew</md:firstname>
      
      <md:surname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Jeanes</md:surname>
      <md:email xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">mjeanes@rice.edu</md:email>
    </md:maintainer>
    <md:maintainer xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="jsilv">
      <md:firstname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Jeffrey</md:firstname>
      
      <md:surname xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Silverman</md:surname>
      <md:email xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">jsilv@rice.edu</md:email>
    </md:maintainer>
  </md:maintainerlist>
  
  

  <md:abstract xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/"/>
</metadata>
  
  <content xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">

    <exercise 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="problem1">
      <problem xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
	<para 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="intro1">
	  The additive noise in a detection problem consists of a
	  sequence of statistically independent Laplacian random
	  variables.  The probability density of
	  <m:math>
	    <m:apply>
	      <m:ci type="fn">n</m:ci>
	      <m:ci>l</m:ci>
	    </m:apply>
	  </m:math>
	  is therefore
	  <m:math display="block">
	    <m:apply>
	      <m:eq/>
	      <m:apply>
		<m:ci type="fn">
		  <m:msub>
		    <m:mi>p</m:mi>
		    <m:mrow>
		      <m:mi>n</m:mi>
		      <m:mfenced>
			<m:mi>l</m:mi>
		      </m:mfenced>
		    </m:mrow>
		  </m:msub>
		</m:ci>
		<m:ci>n</m:ci>
	      </m:apply>
	      <m:apply>
		<m:times/>
		<m:apply>
		  <m:divide/>
		  <m:cn>1</m:cn>
		  <m:cn>2</m:cn>
		</m:apply>
		<m:apply>
		  <m:exp/>
		  <m:apply>
		    <m:minus/>
		    <m:apply>
		      <m:abs/>
		      <m:ci>n</m:ci>
		    </m:apply>
		  </m:apply>
		</m:apply>
	      </m:apply>
	    </m:apply>
	  </m:math>
	  The two possible signals are constant throughout the
	  observation interval, equaling either +1 or -1.
	</para>

	<section 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="s1a">
	  <para 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="p1a">
	    Find the optimum decision rule which could be used on a
	    <emphasis xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">single</emphasis> value of the observation
	    signal.
	  </para>
	</section>
	
	<section 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="s1b">
	  <para 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="p1b">
	    Find an expression for the threshold in your rule as a
	    function of the false-alarm probability.
	  </para>
	</section>
	
	<section 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="s1c">
	  <para 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="p1c">
	    What is the threshold value for the "symmetric" error
	    situation (
	    <m:math>
	      <m:apply>
		<m:eq/>
		<m:ci>
		  <m:msub>
		    <m:mi>P</m:mi>
		    <m:mi>F</m:mi>
		  </m:msub>
		</m:ci>
		<m:apply>
		  <m:minus/>
		  <m:cn>1</m:cn>
		  <m:ci>
		    <m:msub>
		      <m:mi>P</m:mi>
		      <m:mi>D</m:mi>
		    </m:msub>
		  </m:ci>
		</m:apply>
	      </m:apply>
	    </m:math>)?
	  </para>
	</section>

	<section 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="s1d">
	  <para 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="p1d">
	    Now assume that two values of the observations are used
	    in the detector (patience; to solve this problem, we
	    need to approach it gradually).  What is the decision
	    rule for symmetric errors?  How does this result
	    generalize to
	    <m:math><m:ci>L</m:ci></m:math>
	    observations?
	  </para>
	</section>
      </problem>
    </exercise>


    <exercise 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="problem2">
      <problem xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
	<para 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="intro2">
	  The threshold for non-parametric model evaluation is
	  computed (somewhat glibly) in discussing <cnxn xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" document="m11304">Non-parametric Model Evaluation</cnxn>
	  using the Central Limit Theorem.  As warned in <cnxn xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" document="m11251">our previous discussion</cnxn>, such
	  applications of the Central Limit Theorem need to be
	  employed carefully.
	</para>

	<section 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="s2a">
	  <para 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="p2a">
	    The critical parameters - 
	    <m:math>
	      <m:apply>
		<m:csymbol definitionURL="http://cnx.rice.edu/cd/cnxmath.ocd#expectedvalue"/>
		<m:apply>
		  <m:ci type="fn">u</m:ci>
		  <m:ci>x</m:ci>
		</m:apply>
	      </m:apply>
	    </m:math> and
	    <m:math>
	      <m:apply>
		<m:variance/>
		<m:apply>
		  <m:ci type="fn">u</m:ci>
		  <m:ci>x</m:ci>
		</m:apply>
	      </m:apply>
	    </m:math>
	     - of the Central Limit Theorem approximation are claimed
	    to equal
	    <m:math>
	      <m:apply>
		<m:divide/>
		<m:cn>1</m:cn>
		<m:cn>2</m:cn>
	      </m:apply>
	    </m:math> and
	    <m:math>
	      <m:apply>
		<m:divide/>
		<m:cn>1</m:cn>
		<m:cn>4</m:cn>
	      </m:apply>
	    </m:math>
	    respectively under model
	    <m:math>
	      <m:ci>
		<m:msub>
		  <m:mi>ℳ</m:mi>
		  <m:mn>0</m:mn>
		</m:msub>
	      </m:ci>
	    </m:math>.  Verify this claim.
	  </para>
	</section>

	<section 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="s2b">
	  <para 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="p2b">
	    How is the threshold in the non-parametric hypothesis test
	    related to the number of observations from the point of
	    view of the Central Limit Theorem?
	  </para>
	</section>

	<section 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="s2c">
	  <para 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="p2c">
	    Contrast this answer with that determined by the
	    non-parametric test.  Which constraint dominates under
	    what conditions?
	  </para>
	</section>

	<section 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="s2d">
	  <para 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="p2d">
	    How many observations are needed in a non-parametric
	    test to achieve a false-alarm rate of
	    <m:math>
	      <m:apply>
		<m:power/>
		<m:cn>10</m:cn>
		<m:cn>-2</m:cn>
	      </m:apply>
	    </m:math>? of
	    <m:math>
	      <m:apply>
		<m:power/>
		<m:cn>10</m:cn>
		<m:cn>-6</m:cn>
	      </m:apply>
	    </m:math>?
	  </para>
	</section>
      </problem>
    </exercise>    

    <exercise 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="problem3">
      <problem xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
	<para 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="intro3">
	  What are the ranges of signal waveforms and probability
	  density functions consistent with the appropriate model for
	  uncertainty about a nominal?
	</para>

	<section 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="s3a">
	  <para 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="p3a">
	    When considering <cnxn xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" document="m11316">waveform
	    uncertainties</cnxn>, the uncertainty was modeled as an
	    additive corrupting signal that has bounded energy.
	    Assuming a sinusoidal nominal consisting of eight samples
	    per period, sketch the worst-case and best-case signals
	    for the detection problem described in the text.
	  </para>
	</section>
	<section 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="s3b">
	  <para 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="p3b">
	    What other signals are consistent with this model?  Do
	    they fall within the envelopes of the best-case and
	    worst-case signals?  If so prove it; if not, find a
	    counter example and provide some method of finding the
	    others.
	  </para>
	</section>
	<section 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="s3c">
	  <para 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="p3c">
	    The <m:math><m:ci>ε</m:ci></m:math>-contamination
	    model for uncertain densities was somewhat different
	    because we needed to maintain <cnxn xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" document="m11316">unit
	    area</cnxn>. Characterize the range of densities
	    consistent with this model.
	  </para>
	</section>
      </problem>
    </exercise>

    <exercise 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="problem4">
      <problem xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
	<para 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="intro4">
	  In the <cnxn xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" document="m11316">partially known signal
	  waveform problem</cnxn>, we assumed that there was no
	  uncertainty in the "no-signal" model
	  <m:math>
	    <m:ci>
	      <m:msub>
		<m:mi>ℳ</m:mi>
		<m:mn>0</m:mn>
	      </m:msub>
	    </m:ci>
	  </m:math>.
	  A residual signal corrupting the observations may well be
	  present no matter what signal model is actually true.  For
	  example, hum (power-line noise) could be present no matter
	  what signal is received.
	</para> 
	
	<section 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="s4a">
	  <para 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="p4a">
	    Re-derive the robust detector for the situation where a
	    zero-energy signal and a non-zero energy signal can both
	    be corrupted by a signal having energy
	    <m:math>
	      <m:apply>
		<m:power/>
		<m:ci>E</m:ci>
		<m:ci>c</m:ci>
	      </m:apply>
	    </m:math>.
	  </para>
	</section>
	<section 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="s4b">
	  <para 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="p4b">
	    Under what conditions will a solution exist?
	  </para>
	</section>
	<section 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="s4c">
	  <para 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="p4c">
	    Contrast your detector with that found in the text.  What
	    are the worst-case signals?  What signal is used in the
	    matched-filter in the white noise case?  Does the usual
	    matched filter remain robust?
	  </para>
	</section>
      </problem>
    </exercise>

    <exercise 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="problem5">
      <problem xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
	<para 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="intro5">
	  The detector robust under signal waveform uncertainties was
	  only briefly described in the <cnxn xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" document="m11316">text</cnxn>. This result has several
	  interesting properties that warrant further exploration.
	</para>
	
	<section 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="s5a">
	  <para 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="p5a">
	    Explicitly derive the detector using the Lagrange
	    multiplier technique outlined in the text.  Find the value
	    of the Lagrange multiplier for the white-noise case.
	  </para>
	</section>
	<section 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="s5b">
	  <para 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="p5b">
	    Don't take the authors' word that the worst-case signal is
	    indeed that derived.  By computing the probability of
	    detection for a matched-filter detector that uses
	    <m:math>
	      <m:apply>
		<m:ci type="fn">
		  <m:msup>
		    <m:mi>s</m:mi>
		    <m:mi>o</m:mi>
		  </m:msup>
		</m:ci>
		<m:ci>l</m:ci>
	      </m:apply>
	    </m:math>, find the worst-case signal
	    <m:math>
	      <m:apply>
		<m:ci type="fn">
		  <m:msup>
		    <m:mi>s</m:mi>
		    <m:mi>ω</m:mi>
		  </m:msup>
		</m:ci>
		<m:ci>l</m:ci>
	      </m:apply>
	    </m:math> - the one that minimizes
	    <m:math>
	      <m:ci>
		<m:msub>
		  <m:mi>P</m:mi>
		  <m:mi>D</m:mi>
		</m:msub>
	      </m:ci>
	    </m:math> - that satisfies the constraint
	    <m:math>
	      <m:apply>
		<m:eq/>
		<m:apply>
		  <m:ci type="fn">
		    <m:msup>
		      <m:mi>s</m:mi>
		      <m:mi>ω</m:mi>
		    </m:msup>
		  </m:ci>
		  <m:ci>l</m:ci>
		</m:apply>
		<m:apply>
		  <m:plus/>
		  <m:apply>
		    <m:ci type="fn">
		      <m:msup>
			<m:mi>s</m:mi>
			<m:mi>o</m:mi>
		      </m:msup>
		    </m:ci>
		    <m:ci>l</m:ci>
		  </m:apply>
		  <m:apply>
		    <m:ci type="fn">c</m:ci>
		    <m:ci>l</m:ci>
		  </m:apply>
		</m:apply>
	      </m:apply>
	    </m:math>,
	    <m:math>
	      <m:apply>
		<m:leq/>
		<m:apply>
		  <m:sum/>
		  <m:apply>
		    <m:ci type="fn">
		      <m:msup>
			<m:mi>c</m:mi>
			<m:mn>2</m:mn>
		      </m:msup>
		    </m:ci>
		    <m:ci>l</m:ci>
		  </m:apply>
		</m:apply>
		<m:apply>
		  <m:power/>
		  <m:ci>E</m:ci>
		  <m:ci>c</m:ci>
		</m:apply>
	      </m:apply>
	    </m:math>.
	    Do <emphasis xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">not</emphasis> assume the noise is white.
	  </para>
	</section>
	<section 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="s5c">
	  <para 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="p5c">
	    The solution shown <cnxn xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" document="m11316">previously</cnxn> differs from the
	    colored-noise detector that ignores signal uncertainties.
	    By contrasting the signals to which the observations are
	    matched, describe the differences.  When are they similar?
	    very different?
	  </para>
	</section>
      </problem>
    </exercise>

    <exercise 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="problem6">
      <problem xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
	<name xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Noisy Signal Templates</name>
	<para 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="intro6">
	  In many signal detection problems, the signal itself is not
	  known accurately; for example, the signal could have been
	  the result of a measurement, in which case the "signal" used
	  to specify the observations is actually the actual signal
	  plus noise.  We want to determine how the measurement noise
	  affects the detector.
	</para>

	<para 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="intro6b">
	  The formal statement of the detection problem is
	  <m:math display="block">
	    <m:mrow>
	      <m:ci><m:msub>
		  <m:mi>ℳ</m:mi>
		  <m:mn>0</m:mn>
		</m:msub></m:ci>
	      <m:mo>:</m:mo>
	      <m:apply>
		<m:eq/>
		<m:ci>
		  <m:msub>
		    <m:mi>r</m:mi>
		    <m:mi>l</m:mi>
		  </m:msub>
		</m:ci>
		<m:apply>
		  <m:plus/>
		  <m:ci>
		    <m:msubsup>
		      <m:mover accent="true">
			<m:mi>s</m:mi>
			<m:mo>˜</m:mo>
		      </m:mover>
		      <m:mi>l</m:mi>
		      <m:mn>0</m:mn>
		    </m:msubsup>
		  </m:ci>
		  <m:ci>
		    <m:msub>
		      <m:mi>n</m:mi>
		      <m:mi>l</m:mi>
		    </m:msub>
		  </m:ci>
		</m:apply>
	      </m:apply>
	    </m:mrow>
	  </m:math>

	  <m:math display="block">
	    <m:mrow>
	      <m:ci><m:msub>
		  <m:mi>ℳ</m:mi>
		  <m:mn>1</m:mn>
		</m:msub></m:ci>
	      <m:mo>:</m:mo>	    
	      <m:apply>
		<m:eq/>
		<m:ci>
		  <m:msub>
		    <m:mi>r</m:mi>
		    <m:mi>l</m:mi>
		  </m:msub>
		</m:ci>
		<m:apply>
		  <m:plus/>
		  <m:ci>
		    <m:msubsup>
		      <m:mover accent="true">
			<m:mi>s</m:mi>
			<m:mo>˜</m:mo>
		      </m:mover>
		      <m:mi>l</m:mi>
		      <m:mn>1</m:mn>
		    </m:msubsup>
		  </m:ci>
		  <m:ci>
		    <m:msub>
		      <m:mi>n</m:mi>
		      <m:mi>l</m:mi>
		    </m:msub>
		  </m:ci>
		</m:apply>
	      </m:apply>
	    </m:mrow>
	  </m:math>
	  for

	  <m:math>
	    <m:apply>
	      <m:in/>
	      <m:ci>l</m:ci>
	      <m:set>
		<m:cn>0</m:cn>
		<m:ci>…</m:ci>
		<m:apply>
		  <m:minus/>
		  <m:ci>L</m:ci>
		  <m:cn>1</m:cn>
		</m:apply>
	      </m:set>
	    </m:apply>
	  </m:math>, where
	  <m:math>
	    <m:ci>
	      <m:msubsup>
		<m:mover accent="true">
		  <m:mi>s</m:mi>
		  <m:mo>˜</m:mo>
		</m:mover>
		<m:mi>l</m:mi>
		<m:mi>i</m:mi>
	      </m:msubsup>
	    </m:ci>
	  </m:math>
	  equals
	  <m:math>
	    <m:apply>
	      <m:plus/>
	      <m:ci>
		<m:msubsup>
		  <m:mi>s</m:mi>
		  <m:mi>l</m:mi>
		  <m:mi>i</m:mi>
		</m:msubsup>
	      </m:ci>
	      <m:ci>
		<m:msub>
		  <m:mi>ω</m:mi>
		  <m:mi>l</m:mi>
		</m:msub>
	      </m:ci>
	    </m:apply>
	  </m:math>, with
	  <m:math>
	    <m:ci>
	      <m:msub>
		<m:mi>ω</m:mi>
		<m:mi>l</m:mi>
	      </m:msub>
	    </m:ci>
	  </m:math>
	  and
	  <m:math>
	    <m:ci>
	      <m:msub>
		<m:mi>n</m:mi>
		<m:mi>l</m:mi>
	      </m:msub>
	    </m:ci>
	  </m:math>
	  comprising white Gaussian noise having variances
	  <m:math>
	    <m:ci><m:msubsup>
		<m:mi>σ</m:mi>
		<m:mi>ω</m:mi>
		<m:mn>2</m:mn>
	      </m:msubsup></m:ci>
	  </m:math>
	  and
	  <m:math>
	    <m:ci><m:msubsup>
		<m:mi>σ</m:mi>
		<m:mi>n</m:mi>
		<m:mn>2</m:mn>
	      </m:msubsup>
	    </m:ci>
	  </m:math>,
	  respectively.  We know precisely what the signals
	  <m:math>
	    <m:ci><m:msubsup>
		<m:mover accent="true">
		  <m:mi>s</m:mi>
		  <m:mo>˜</m:mo>
		</m:mover>
		<m:mi>l</m:mi>
		<m:mi>i</m:mi>
	      </m:msubsup></m:ci>
	  </m:math>
	  are, but not the underlying "actual" signal.
	</para>
	
	<section 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="s6a">
	  <para 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="p6a">
	    Find a detector for this problem.
	  </para>
	</section>
	<section 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="s6b">
	  <para 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="p6b">
	    Analyze, as much as possible, how this detector is
	    affected by the measurement noise, contrasting its
	    performance with that obtained when the signals are known
	    precisely.
	  </para>
	</section>
      </problem>
    </exercise>

    <exercise 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="problem7">
      <problem xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
	<para 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="intro7">
	  In robust detection problems in which we have
	  <emphasis xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">signal uncertainties</emphasis>, the so-called
	  "minimax" approach is to find the worst-case signals among
	  received signal possibilities (the pair that would yield the
	  worst performance if they were indeed transmitted), then use
	  the likelihood ratio based on these signals instead of what
	  is actually transmitted.  Assume the signal transmissions
	  are observed in the presence of additive white Gaussian
	  noise.  The received signal
	  <m:math>
	    <m:ci><m:msub>
		<m:mover accent="true">
		  <m:mi>s</m:mi>
		  <m:mo>˜</m:mo>
		</m:mover>
		<m:mi>i</m:mi>
	      </m:msub></m:ci>
	  </m:math>
	  deviates from the nominal one
	  <m:math>
	    <m:ci><m:msub>
		<m:mi>s</m:mi>
		<m:mi>i</m:mi>
	      </m:msub></m:ci>
	  </m:math>
	  by a finite mean-squared error:
	  <m:math>
	    <m:apply>
	      <m:leq/>
	      <m:apply>
		<m:power/>
		<m:apply>
		  <m:csymbol definitionURL="http://cnx.rice.edu/cd/cnxmath.ocd#norm"/>
		  <m:apply>
		    <m:minus/>
		    <m:ci><m:msub>
			<m:mover accent="true">
			  <m:mi>s</m:mi>
			  <m:mo>˜</m:mo>
			</m:mover>
			<m:mi>i</m:mi>
		      </m:msub></m:ci>
		    <m:ci><m:msub>
			<m:mi>s</m:mi>
			<m:mi>i</m:mi>
		      </m:msub></m:ci>
		  </m:apply>
		</m:apply>
		<m:cn>2</m:cn>
	      </m:apply>
	      <m:apply>
		<m:power/>
		<m:ci>ε</m:ci>
		<m:cn>2</m:cn>
	      </m:apply>
	    </m:apply>
	  </m:math>.
	  Prove or disprove: The receiver obtained when there is no
	  uncertainty is robust.
	</para>
      </problem>
    </exercise>
    
    <!-- 7.8 in the notes is exactly the same as 7.7
    Therefore, I have simply omitted a problem with id='problem8' -->
    
    <exercise 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="problem9">
      <problem xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
	<para 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="intro9">
	  Consider a two-model problem where signals are observed in
	  the presence of additive <emphasis xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Laplacian</emphasis>
	  noise having samples statistically independent of each other
	  and the signal.  
	  <m:math display="block">
	    <m:mrow>
	      <m:ci><m:msub>
		  <m:mi>ℳ</m:mi>
		  <m:mn>0</m:mn>
		</m:msub></m:ci>
	      <m:mo>:</m:mo>
	      <m:apply>
		<m:eq/>
		<m:apply>
		  <m:ci type="fn">r</m:ci>
		  <m:ci>l</m:ci>
		</m:apply>
		<m:apply>
		  <m:plus/>
		  <m:apply>
		    <m:ci type="fn"><m:msub>
			<m:mi>s</m:mi>
			<m:mn>0</m:mn>
		      </m:msub></m:ci>
		    <m:ci>l</m:ci>
		  </m:apply>
		  <m:apply>
		    <m:ci type="fn">n</m:ci>
		    <m:ci>l</m:ci>
		  </m:apply>
		</m:apply>
	      </m:apply>
	    </m:mrow>
	  </m:math>
	  
	  <m:math display="block">
	    <m:mrow>
	      <m:ci><m:msub>
		  <m:mi>ℳ</m:mi>
		  <m:mn>1</m:mn>
		</m:msub></m:ci>
	      <m:mo>:</m:mo>
	      <m:apply>
		<m:eq/>
		<m:apply>
		  <m:ci type="fn">r</m:ci>
		  <m:ci>l</m:ci>
		</m:apply>
		<m:apply>
		  <m:plus/>
		  <m:apply>
		    <m:ci type="fn"><m:msub>
			<m:mi>s</m:mi>
			<m:mn>1</m:mn>
		      </m:msub></m:ci>
		    <m:ci>l</m:ci>
		  </m:apply>
		  <m:apply>
		    <m:ci type="fn">n</m:ci>
		    <m:ci>l</m:ci>
		  </m:apply>
		</m:apply>
	      </m:apply>
	    </m:mrow>
	  </m:math>
	  for
	  <m:math>
	    <m:apply>
	      <m:in/>
	      <m:ci>l</m:ci>
	      <m:set>
		<m:cn>0</m:cn>
		<m:ci>…</m:ci>
		<m:apply>
		  <m:minus/>
		  <m:ci>L</m:ci>
		  <m:cn>1</m:cn>
		</m:apply>
	      </m:set>
	    </m:apply>
	  </m:math>.  To design an optimal signal set for this
	  problem, we constrain each signal's energy to be less than
	  <m:math><m:ci>E</m:ci></m:math>.
	</para>
	
	<section 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="s9a">
	  <para 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="p9a">
	    What signal choices provide optimal performance (the
	    smallest error probabilities) when the signal-to-noise
	    ratio is small?
	  </para>
	</section>
	<section 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="s9b">
	  <para 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="p9b">
	    When the signal-to-noise ratio is large, do the choices
	    change?  If so, determine what choices, if any, would be
	    optimal regardless of the signal-to-noise ratio.
	  </para>
	</section>
      </problem>
    </exercise>

    <exercise 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="problem10">
      <problem xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
	<para 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="intro10">
	  In Poisson channels, such as photon-limited optical
	  communication systems, the received signal consists of the
	  number of photons and when they occurred.  The joint
	  distribution of these quantities has the form
	  
	  <m:math display="block">
	    <m:apply>
	      <m:eq/>
	      <m:apply>
		<m:csymbol definitionURL="http://cnx.rice.edu/cd/cnxmath.ocd#probability"/>
		<m:condition>
		  <m:apply>
		    <m:eq/>
		    <m:ci type="vector">t</m:ci>
		    <m:set>
		      <m:ci><m:msub>
			  <m:mi>t</m:mi>
			  <m:mn>1</m:mn>
			</m:msub></m:ci>
		      <m:ci>…</m:ci>
		      <m:ci><m:msub>
			  <m:mi>t</m:mi>
			  <m:mi>n</m:mi>
			</m:msub></m:ci>
		    </m:set>
		  </m:apply>
		</m:condition>
		<m:apply>
		  <m:eq/>
		  <m:ci><m:msub>
		      <m:mi>N</m:mi>
		      <m:mfenced open="[" close=")">
			<m:mn>0</m:mn>
			<m:mi>T</m:mi>
		      </m:mfenced>
		    </m:msub></m:ci>
		  <m:ci>n</m:ci>
		</m:apply>
	      </m:apply>
	      <m:apply>
		<m:times/>
		<m:apply>
		  <m:product/>
		  <m:bvar><m:ci>j</m:ci></m:bvar>
		  <m:lowlimit>
		    <m:cn>1</m:cn>
		  </m:lowlimit>
		  <m:uplimit>
		    <m:ci>n</m:ci>
		  </m:uplimit>
		  <m:apply>
		    <m:ci type="fn">λ</m:ci>
		    <m:ci><m:msub>
			<m:mi>t</m:mi>
			<m:mi>j</m:mi>
		      </m:msub></m:ci>
		  </m:apply>
		</m:apply>
		<m:apply>
		  <m:exp/>
		  <m:apply>
		    <m:minus/>
		    <m:apply>
		      <m:int/>
		      <m:bvar><m:ci>α</m:ci></m:bvar>
		      <m:lowlimit>
			<m:cn>0</m:cn>
		      </m:lowlimit>
		      <m:uplimit>
			<m:ci>T</m:ci>
		      </m:uplimit>
		      <m:apply>
			<m:ci type="fn">λ</m:ci>
			<m:ci>α</m:ci>
		      </m:apply>
		    </m:apply>
		  </m:apply>
		</m:apply>
	      </m:apply>
	    </m:apply>
	  </m:math>
	  where
	  <m:math>
	    <m:apply>
	      <m:ci type="fn">λ</m:ci>
	      <m:ci>t</m:ci>
	    </m:apply>
	  </m:math>
	  denotes the Poisson process's time-varying intensity, which
	  <emphasis xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">must</emphasis> be non-negative.  in optical
	  digital communication, the signal sets consist of designed
	  intensities, and these are typically received in the
	  presence of a background light level.  Phrased in terms of a
	  model,
	  <m:math>
	    <m:ci>
	      <m:msub>
		<m:mi>ℳ</m:mi>
		<m:mi>i</m:mi>
	      </m:msub>
	    </m:ci>
	  </m:math>: 
	  
	  <m:math>
	    <m:apply>
	      <m:eq/>
	      <m:apply>
		<m:ci type="fn">λ</m:ci>
		<m:ci>t</m:ci>
	      </m:apply>
	      <m:apply>
		<m:plus/>
		<m:apply>
		  <m:ci type="fn"><m:msub>
		      <m:mi>λ</m:mi>
		      <m:mi>i</m:mi>
		    </m:msub></m:ci>
		  <m:ci>t</m:ci>
		</m:apply>
		<m:ci><m:msub>
		    <m:mi>λ</m:mi>
		    <m:mi>d</m:mi>
		  </m:msub></m:ci>
	      </m:apply>
	    </m:apply>
	  </m:math>.  In designing signal sets for the optical
	  channel, the intensity's integral is typically bounded:
	  <m:math>
	    <m:apply>
	      <m:lt/>
	      <m:apply>
		<m:int/>
		<m:bvar><m:ci>α</m:ci></m:bvar>
		<m:lowlimit>
		  <m:cn>0</m:cn>
		</m:lowlimit>
		<m:uplimit>
		  <m:ci>T</m:ci>
		</m:uplimit>
		<m:apply>
		  <m:ci type="fn"><m:msub>
		      <m:mi>λ</m:mi>
		      <m:mi>i</m:mi>
		    </m:msub></m:ci>
		  <m:ci>α</m:ci>
		</m:apply>
	      </m:apply>
	      <m:ci><m:msub>
		  <m:mi>Λ</m:mi>
		  <m:mi>max</m:mi>
		</m:msub></m:ci>
	    </m:apply>
	  </m:math>.
	  What is the optimal binary signal set
	  <m:math>
	    <m:set>
	      <m:apply>
		<m:ci type="fn"><m:msub>
		    <m:mi>λ</m:mi>
		    <m:mn>0</m:mn>
		  </m:msub></m:ci>
		<m:ci>t</m:ci>
	      </m:apply>
	      <m:apply>
		<m:ci type="fn"><m:msub>
		    <m:mi>λ</m:mi>
		    <m:mn>1</m:mn>
		  </m:msub></m:ci>
		<m:ci>t</m:ci>
	      </m:apply>
	    </m:set>
	  </m:math>
	  for the optical channel?
	</para>
	
      </problem>
    </exercise>

    <exercise 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="problem11">
      <problem xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">
	<para 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="intro11">
	  Consider a two-model problem where signals are observed in
	  the presence of additive <emphasis xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/">Laplacian</emphasis>
	  noise having samples statistically independent of each other
	  and the signal.
	  <m:math display="block">
	    <m:mrow>
	      <m:ci><m:msub>
		  <m:mi>ℳ</m:mi>
		  <m:mn>0</m:mn>
		</m:msub></m:ci>
	      <m:mo>:</m:mo>
	      <m:apply>
		<m:eq/>
		<m:ci>
		  <m:msub>
		    <m:mi>r</m:mi>
		    <m:mi>l</m:mi>
		  </m:msub>
		</m:ci>
		<m:apply>
		  <m:plus/>
		  <m:ci>
		    <m:msubsup>
		      <m:mi>s</m:mi>
		      <m:mi>l</m:mi>
		      <m:mfenced>
			<m:mn>0</m:mn>
		      </m:mfenced>
		    </m:msubsup>
		  </m:ci>
		  <m:ci>
		    <m:msub>
		      <m:mi>n</m:mi>
		      <m:mi>l</m:mi>
		    </m:msub>
		  </m:ci>
		</m:apply>
	      </m:apply>
	    </m:mrow>
	  </m:math>
	  
	  <m:math display="block">
	    <m:mrow>
	      <m:ci><m:msub>
		  <m:mi>ℳ</m:mi>
		  <m:mn>1</m:mn>
		</m:msub></m:ci>
	      <m:mo>:</m:mo>
	    <m:apply>
		<m:eq/>
		<m:ci>
		  <m:msub>
		    <m:mi>r</m:mi>
		    <m:mi>l</m:mi>
		  </m:msub>
		</m:ci>
		<m:apply>
		  <m:plus/>
		  <m:ci>
		    <m:msubsup>
		      <m:mi>s</m:mi>
		      <m:mi>l</m:mi>
		      <m:mfenced>
			<m:mn>1</m:mn>
		      </m:mfenced>
		    </m:msubsup>
		  </m:ci>
		  <m:ci>
		    <m:msub>
		      <m:mi>n</m:mi>
		      <m:mi>l</m:mi>
		    </m:msub>
		  </m:ci>
		</m:apply>
	      </m:apply>
	    </m:mrow>
	  </m:math>
	  for
	  <m:math>
	    <m:apply>
	      <m:in/>
	      <m:ci>l</m:ci>
	      <m:set>
		<m:cn>0</m:cn>
		<m:ci>…</m:ci>
		<m:apply>
		  <m:minus/>
		  <m:ci>L</m:ci>
		  <m:cn>1</m:cn>
		</m:apply>
	      </m:set>
	    </m:apply>
	  </m:math>
	  To design an optimal signal set for this problem, we
	  constrain each signal's energy to be less than
	  <m:math><m:ci>E</m:ci></m:math>.  Assume that the number of
	  observations <m:math><m:ci>L</m:ci></m:math> is large.
	</para>
	
	<section 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="s11a">
	  <para 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="p11a">
	    What signal choices provide optimal performance (the
	    smallest error probabilities) when the signal-to-noise
	    ratio is small?
	  </para>
	</section>
	<section 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="s11b">
	  <para 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="p11b">
	    When the signal-to-noise ratio is large, do the choices
	    change?  If so, determine what choices, if any, would be
	    optimal regardless of the signal-to-noise ratio.
	  </para>
	</section>
      </problem>
    </exercise>
  </content>
</document>
