<?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="new2">
  <name>Scaling Filter Sufficient Conditions</name>
  <metadata>
  <md:version>2.6</md:version>
  <md:created>2003/04/30</md:created>
  <md:revised>2005/06/08 10:38:14 GMT-5</md:revised>
  <md:authorlist>
      <md:author id="jpearce">
      <md:firstname>Jeremy</md:firstname>
      <md:othername>G.</md:othername>
      <md:surname>Pearce</md:surname>
      <md:email>jpearce@rice.edu</md:email>
    </md:author>
  </md:authorlist>

  <md:maintainerlist>
    <md:maintainer id="kileen">
      <md:firstname>Kileen</md:firstname>
      
      <md:surname>Cheng</md:surname>
      <md:email>kileen@rice.edu</md:email>
    </md:maintainer>
    <md:maintainer id="jpearce">
      <md:firstname>Jeremy</md:firstname>
      <md:othername>G.</md:othername>
      <md:surname>Pearce</md:surname>
      <md:email>jpearce@rice.edu</md:email>
    </md:maintainer>
    <md:maintainer id="live">
      <md:firstname>Jason</md:firstname>
      
      <md:surname>White</md:surname>
      <md:email>live@rice.edu</md:email>
    </md:maintainer>
    <md:maintainer id="jago">
      <md:firstname>Adan</md:firstname>
      
      <md:surname>Galvan</md:surname>
      <md:email>jago@rice.edu</md:email>
    </md:maintainer>
    <md:maintainer id="charlet">
      <md:firstname>Charlet</md:firstname>
      
      <md:surname>Reedstrom</md:surname>
      <md:email>charlet@rice.edu</md:email>
    </md:maintainer>
  </md:maintainerlist>
  
  <md:keywordlist>
    <md:keyword>recursion equations</md:keyword>
    <md:keyword>scaling filters</md:keyword>
    <md:keyword>sufficient conditions</md:keyword>
    <md:keyword>wavelets</md:keyword>
  </md:keywordlist>

  <md:abstract>In order to find a solution to the basic reqursion equations, the scaling filter must satisfy a set of sufficient conditions.  Certain conditions on the scaling filter will directly result in a wavelet expansion system with certain properties.</md:abstract>
</metadata>



  <content>
    <section id="sec1">
      <name>Basic Recursion Equations</name>
      <para id="para1">
	<equation id="eqn1">
	  <m:math>
	    <m:apply>
	      <m:forall/>
	      <m:bvar><m:ci>n</m:ci></m:bvar>
	      <m:condition>
		<m:apply>
		  <m:in/>
		  <m:ci>n</m:ci>
		  <m:integers/>
		</m:apply>
	      </m:condition>
	      <m:apply>
		<m:eq/>
		<m:apply>
		  <m:ci type="fn">φ</m:ci>
		  <m:ci>t</m:ci>
		</m:apply>
		<m:apply>
		  <m:sum/>
		  <m:bvar><m:ci>n</m:ci></m:bvar>
		  <m:domainofapplication>
		    <m:ci>n</m:ci>
		  </m:domainofapplication>
		  <m:apply>
		    <m:times/>
		    <m:apply>
		      <m:ci type="fn">h</m:ci>
		      <m:ci>n</m:ci>
		    </m:apply>
		    <m:apply>
		      <m:root/>
		      <m:cn>2</m:cn>
		    </m:apply>
		    <m:apply>
		      <m:ci type="fn">φ</m:ci>
		      <m:apply>
			<m:minus/>
			<m:apply>
			  <m:times/>
			  <m:cn>2</m:cn>
			  <m:ci>t</m:ci>
			</m:apply>
			<m:ci>n</m:ci>
		      </m:apply>
		    </m:apply>
		  </m:apply>
		</m:apply>
	      </m:apply>
	    </m:apply>
	  </m:math>
	</equation>

	<equation id="eqn2">
	  <m:math>
	    <m:apply>
	      <m:eq/>
	      <m:apply>
		<m:ci type="fn">Φ</m:ci>
		<m:ci>ω</m:ci>
	      </m:apply>
	      <m:apply>
		<m:product/>
		<m:bvar><m:ci>k</m:ci></m:bvar>
		<m:lowlimit>
		  <m:cn>1</m:cn>
		</m:lowlimit>
		<m:uplimit>
		  <m:infinity/>
		</m:uplimit>
		<m:apply>
		  <m:times/>
		  <m:apply>
		    <m:times/>
		    <m:apply>
		      <m:divide/>
		      <m:cn>1</m:cn>
		      <m:apply>
			<m:root/>
			<m:cn>2</m:cn>
		      </m:apply>
		    </m:apply>
		    <m:apply>
		      <m:ci type="fn">H</m:ci>
		      <m:apply>
			<m:divide/>
			<m:ci>ω</m:ci>
			<m:apply>
			  <m:power/>
			  <m:cn>2</m:cn>
			  <m:ci>k</m:ci>
			</m:apply>
		      </m:apply>
		    </m:apply>
		  </m:apply>
		  <m:apply>
		    <m:ci type="fn">Φ</m:ci>
		    <m:cn>0</m:cn>
		  </m:apply>
		</m:apply>
	      </m:apply>
	    </m:apply>
	  </m:math>
	</equation>

	From the basic recursion equations, it is apparent that 
	<m:math>
	  <m:apply>
	    <m:ci type="fn">h</m:ci>
	    <m:ci>n</m:ci>
	  </m:apply>
	</m:math>
	completely characterizes the scaling function 
	<m:math>
	  <m:apply>
	    <m:ci type="fn">φ</m:ci>
	    <m:ci>t</m:ci>
	  </m:apply>
	</m:math>. In order for a solution for 
	<m:math>
	  <m:apply>
	    <m:ci type="fn">φ</m:ci>
	    <m:ci>t</m:ci>
	  </m:apply>
	</m:math> to exist, 
	<m:math>
	  <m:apply>
	    <m:ci type="fn">h</m:ci>
	    <m:ci>n</m:ci>
	  </m:apply>
	</m:math> must satisfy a set of sufficient conditions.   
      </para>

      <section id="subsec1">
	<name>Sufficient Condition 1</name>
	<para id="para2">
	  If the following conditions on 
	  <m:math>
	    <m:apply>
	      <m:ci type="fn">h</m:ci>
	      <m:ci>n</m:ci>
	    </m:apply>
	  </m:math> hold, then 
	  <m:math>
	    <m:apply>
	      <m:ci type="fn">φ</m:ci>
	      <m:ci>t</m:ci>
	    </m:apply>
	  </m:math> exists.

	  <list id="list1" type="enumerated">
	    <item>
	      <m:math>
		<m:apply>
		  <m:eq/>
		  <m:apply>
		    <m:sum/>
		    <m:bvar><m:ci>n</m:ci></m:bvar>
		    <m:domainofapplication>
		      <m:ci>n</m:ci>
		    </m:domainofapplication>
		    <m:apply>
		      <m:ci type="fn">h</m:ci>
		      <m:ci>n</m:ci>
		    </m:apply>
		  </m:apply>
		  <m:apply>
		    <m:root/>
		    <m:cn>2</m:cn>
		  </m:apply>
		</m:apply>
	      </m:math>
	    </item>
	    <item>
	      <m:math>
		<m:apply>
		  <m:ci type="fn">h</m:ci>
		  <m:ci>n</m:ci>
		</m:apply>
	      </m:math> has finite support or decays fast enough so
	      that 
	      <m:math>
		<m:apply>
		  <m:lt/>
		  <m:apply>
		    <m:sum/>
		    <m:bvar><m:ci>n</m:ci></m:bvar>
		    <m:domainofapplication>
		      <m:ci>n</m:ci>
		    </m:domainofapplication>
		    <m:apply>
		      <m:times/>
		      <m:apply>
			<m:abs/>
			<m:apply>
			  <m:ci type="fn">h</m:ci>
			  <m:ci>n</m:ci>
			</m:apply>
		      </m:apply>
		      <m:apply>
			<m:power/>
			<m:apply>
			  <m:plus/>
			  <m:cn>1</m:cn>
			  <m:apply>
			    <m:abs/>
			    <m:ci>n</m:ci>
			  </m:apply>
			</m:apply>
			<m:ci>ε</m:ci>
		      </m:apply>
		    </m:apply>
		  </m:apply>
		  <m:infinity/>
		</m:apply>
	      </m:math> for some 
	      <m:math>
		<m:apply>
		  <m:gt/>
		  <m:ci>ε</m:ci>
		  <m:infinity/>
		</m:apply>
	      </m:math>.
	    </item>
	  </list>
	  This is the weakest possible condition, and therefore does
	  not necessarily provide a useful expansion system. The
	  resulting scaling function can be very poorly behaved and
	  not support a multiresolution analysis.
	</para>
	<example id="cond1ex">
	  <para id="para3">
	    Let 
	    <m:math>
	      <m:apply>
		<m:eq/>
		<m:apply>
		  <m:ci type="fn" class="discrete">h</m:ci>
		  <m:ci>n</m:ci>
		</m:apply>
		<m:list>
		  <m:cn>0.0800</m:cn>
		  <m:cn>1.0733</m:cn>
		  <m:cn>0.0382</m:cn>
		  <m:cn>0.1169</m:cn>
		  <m:cn>-0.0194</m:cn>
		  <m:cn>0.1252</m:cn>
		</m:list>
	      </m:apply>
	    </m:math>, which satifies 
	    <m:math>
	      <m:apply>
		<m:eq/>
		<m:apply>
		  <m:sum/>
		  <m:bvar><m:ci>n</m:ci></m:bvar>
		  <m:domainofapplication>
		    <m:ci>n</m:ci>
		  </m:domainofapplication>
		  <m:apply>
		    <m:ci type="fn">h</m:ci>
		    <m:ci>n</m:ci>
		  </m:apply>
		</m:apply>
		<m:apply>
		  <m:root/>
		  <m:cn>2</m:cn>
		</m:apply>
	      </m:apply>
	    </m:math> and none of the other sufficient conditions.
	    The magnitude of the frequency response of filter 
	    <m:math>
	      <m:apply>
		<m:ci type="fn">h</m:ci>
		<m:ci>n</m:ci>
	      </m:apply>
	    </m:math> is shown in <cnxn target="fig1" strength="9"/>.
	    The filter is a poorly behaved filter in that it is not
	    even a low-pass filter and therefore 
	    <m:math>
	      <m:apply>
		<m:ci type="fn">φ</m:ci>
		<m:ci>t</m:ci>
	      </m:apply>
	    </m:math> can not be calculated and does not support a
	    multiresolution analysis.
	  </para>

	  <figure id="fig1">
	    <media type="image/png" src="suff1scale.png"/>
	    <caption>
	      Frequency response of the scaling filter that satisfies
	      Sufficient Condition 1.
	    </caption>
	  </figure>
	</example>
      </section>

      <section id="subsec2">
	<name>Sufficient Condition 2</name>
	<para id="para4">
	  If the following conditions on 
	  <m:math>
	    <m:apply>
	      <m:ci type="fn">h</m:ci>
	      <m:ci>n</m:ci>
	    </m:apply>
	  </m:math> hold, then 
	  <m:math>
	    <m:apply>
	      <m:ci type="fn">φ</m:ci>
	      <m:ci>t</m:ci>
	    </m:apply>
	  </m:math> exists.

	  <list id="list2" type="enumerated">
	    <item>
	      <m:math>
		<m:apply>
		  <m:eq/>
		  <m:apply>
		    <m:sum/>
		    <m:bvar><m:ci>n</m:ci></m:bvar>
		    <m:domainofapplication>
		      <m:ci>n</m:ci>
		    </m:domainofapplication>
		    <m:apply>
		      <m:ci type="fn">h</m:ci>
		      <m:apply>
			<m:times/>
			<m:cn>2</m:cn>
			<m:ci>n</m:ci>
		      </m:apply>
		    </m:apply>
		  </m:apply>
		  <m:apply>
		    <m:sum/>
		    <m:bvar><m:ci>n</m:ci></m:bvar>
		    <m:domainofapplication>
		      <m:ci>n</m:ci>
		    </m:domainofapplication>
		    <m:apply>
		      <m:ci type="fn">h</m:ci>
		      <m:apply>
			<m:plus/>
			<m:apply>
			  <m:times/>
			  <m:cn>2</m:cn>
			  <m:ci>n</m:ci>
			</m:apply>
			<m:cn>1</m:cn>
		      </m:apply>
		    </m:apply>
		  </m:apply>
		  <m:apply>
		    <m:divide/>
		    <m:cn>1</m:cn>
		    <m:apply>
		      <m:root/>
		      <m:cn>2</m:cn>
		    </m:apply>
		  </m:apply>
		</m:apply>
	      </m:math>
	    </item>
	    <item>
	      <m:math>
		<m:apply>
		  <m:ci type="fn">h</m:ci>
		  <m:ci>n</m:ci>
		</m:apply>
	      </m:math> has finite support or decays fast enough so
	      that 
	      <m:math>
		<m:apply>
		  <m:lt/>
		  <m:apply>
		    <m:sum/>
		    <m:bvar><m:ci>n</m:ci></m:bvar>
		    <m:domainofapplication>
		      <m:ci>n</m:ci>
		    </m:domainofapplication>
		    <m:apply>
		      <m:times/>
		      <m:apply>
			<m:abs/>
			<m:apply>
			  <m:ci type="fn">h</m:ci>
			  <m:ci>n</m:ci>
			</m:apply>
		      </m:apply>
		      <m:apply>
			<m:power/>
			<m:apply>
			  <m:plus/>
			  <m:cn>1</m:cn>
			  <m:apply>
			    <m:abs/>
			    <m:ci>n</m:ci>
			  </m:apply>
			</m:apply>
			<m:ci>ε</m:ci>
		      </m:apply>
		    </m:apply>
		  </m:apply>
		  <m:infinity/>
		</m:apply>
	      </m:math> for some 
	      <m:math>
		<m:apply>
		  <m:gt/>
		  <m:ci>ε</m:ci>
		  <m:infinity/>
		</m:apply>
	      </m:math>.
	    </item>
	  </list>
	  In addition to having a solution for 
	  <m:math>
	    <m:apply>
	      <m:ci type="fn">φ</m:ci>
	      <m:ci>t</m:ci>
	    </m:apply>
	  </m:math>, the following sum holds
	  <equation id="eqn3">
	    <m:math>
	      <m:apply>
		<m:eq/>
		<m:apply>
		  <m:sum/>
		  <m:bvar><m:ci>k</m:ci></m:bvar>
		  <m:domainofapplication>
		    <m:ci>k</m:ci>
		  </m:domainofapplication>
		  <m:apply>
		    <m:ci type="fn">φ</m:ci>
		    <m:apply>
		      <m:minus/>
		      <m:ci>t</m:ci>
		      <m:ci>k</m:ci>
		    </m:apply>
		  </m:apply>
		</m:apply>
		<m:cn>1</m:cn>
	      </m:apply>
	    </m:math>
	  </equation>
	</para>

	<para id="para5">
	  By forcing the sum of the odd coefficients be equal to the
	  sum of the even coefficients, it guarantees that 
	  <m:math>
	    <m:apply>
	      <m:eq/>
	      <m:apply>
		<m:ci type="fn">H</m:ci>
		<m:pi/>
	      </m:apply>
	      <m:cn>0</m:cn>
	    </m:apply>
	  </m:math>, which means 
	  <m:math>
	    <m:apply>
	      <m:ci type="fn">h</m:ci>
	      <m:ci>n</m:ci>
	    </m:apply>
	  </m:math> is a low-pass filter.  This condition is much
	  stronger than sufficient condition 1 and is called the
	  <term>Fundamental Condition</term>.  From the product
	  formula, <cnxn target="eqn2" strength="9"/>, requiring 
	  <m:math>
	    <m:apply>
	      <m:eq/>
	      <m:apply>
		<m:ci type="fn">H</m:ci>
		<m:pi/>
	      </m:apply>
	      <m:cn>0</m:cn>
	    </m:apply>
	  </m:math> gives a better behaved 
	  <m:math>
	    <m:apply>
	      <m:ci type="fn">Φ</m:ci>
	      <m:ci>ω</m:ci>
	    </m:apply>
	  </m:math>.
	</para>
	<example id="cond2ex">
	  <para id="para6">
	    Let 
	    <m:math>
	      <m:apply>
		<m:eq/>
		<m:apply>
		  <m:ci type="fn" class="discrete">h</m:ci>
		  <m:ci>n</m:ci>
		</m:apply>
		<m:list>
		  <m:cn>0.3526</m:cn>
		  <m:cn>0.1328</m:cn>
		  <m:cn>0.3018</m:cn>
		  <m:cn>0.3702</m:cn>
		  <m:cn>0.0527</m:cn>
		  <m:cn>0.2041</m:cn>
		</m:list>
	      </m:apply>
	    </m:math>, which satifies 
	    <m:math>
	      <m:apply>
		<m:eq/>
		<m:apply>
		  <m:sum/>
		  <m:bvar><m:ci>n</m:ci></m:bvar>
		  <m:domainofapplication>
		    <m:ci>n</m:ci>
		  </m:domainofapplication>
		  <m:apply>
		    <m:ci type="fn">h</m:ci>
		    <m:apply>
		      <m:times/>
		      <m:cn>2</m:cn>
		      <m:ci>n</m:ci>
		    </m:apply>
		  </m:apply>
		</m:apply>
		<m:apply>
		  <m:sum/>
		  <m:bvar><m:ci>n</m:ci></m:bvar>
		  <m:domainofapplication>
		    <m:ci>n</m:ci>
		  </m:domainofapplication>
		  <m:apply>
		    <m:ci type="fn">h</m:ci>
		    <m:apply>
		      <m:plus/>
		      <m:apply>
			<m:times/>
			<m:cn>2</m:cn>
			<m:ci>n</m:ci>
		      </m:apply>
		      <m:cn>1</m:cn>
		    </m:apply>
		  </m:apply>
		</m:apply>
		<m:apply>
		  <m:divide/>
		  <m:cn>1</m:cn>
		  <m:apply>
		    <m:root/>
		    <m:cn>2</m:cn>
		  </m:apply>
		</m:apply>
	      </m:apply>
	    </m:math> and therefore also 
	    <m:math>
	      <m:apply>
		<m:eq/>
		<m:apply>
		  <m:sum/>
		  <m:bvar><m:ci>n</m:ci></m:bvar>
		  <m:domainofapplication>
		    <m:ci>n</m:ci>
		  </m:domainofapplication>
		  <m:apply>
		    <m:ci type="fn">h</m:ci>
		    <m:ci>n</m:ci>
		  </m:apply>
		</m:apply>
		<m:apply>
		  <m:root/>
		  <m:cn>2</m:cn>
		</m:apply>
	      </m:apply>
	    </m:math>.  The magnitude of the frequency response of
	    filter
	    <m:math>
	      <m:apply>
		<m:ci type="fn">h</m:ci>
		<m:ci>n</m:ci>
	      </m:apply>
	    </m:math> is shown in <cnxn target="fig2" strength="9"/>.
	    It yields a better conditioned filter than in <cnxn target="fig1" strength="9"/>.  The scaling function 
	    <m:math>
	      <m:apply>
		<m:ci type="fn">φ</m:ci>
		<m:ci>t</m:ci>
	      </m:apply>
	    </m:math> can also be calculated and is shown. The
	    Fundamental Condition guarantees that a scaling filter can
	    be calculated and that an expansion system exists. It says
	    nothing about whether the expansion is orthogonal or even
	    a tight frame, which will be important in transforming to
	    and from the wavelet domain.
	  </para>

	  <figure id="fig2">
	    <media type="image/png" src="suff2scale.png"/>
	    <caption>
	      Frequency response of the scaling filter that satisfies
	      Sufficient Condition 1 and 2.
	    </caption>
	  </figure>
	</example>
      </section>

      <section id="subsec3">
	<name>Sufficient Condition 3</name>
	<para id="para7">
	  If the following conditions on 
	  <m:math>
	    <m:apply>
	      <m:ci type="fn">h</m:ci>
	      <m:ci>n</m:ci>
	    </m:apply>
	  </m:math> hold, then 
	  <m:math>
	    <m:apply>
	      <m:ci type="fn">φ</m:ci>
	      <m:ci>t</m:ci>
	    </m:apply>
	  </m:math> exists and generates a wavelet system that is a
	  tight frame in 
	  <m:math>
	    <m:apply>
	      <m:power/>
	      <m:ci type="set">L</m:ci>
	      <m:cn>2</m:cn>
	    </m:apply>
	  </m:math>.

	  <list id="list3" type="enumerated">
	    <item>
	      <m:math>
		<m:apply>
		  <m:eq/>
		  <m:apply>
		    <m:sum/>
		    <m:bvar><m:ci>n</m:ci></m:bvar>
		    <m:domainofapplication>
		      <m:ci>n</m:ci>
		    </m:domainofapplication>
		    <m:apply>
		      <m:ci type="fn">h</m:ci>
		      <m:ci>n</m:ci>
		    </m:apply>
		  </m:apply>
		  <m:apply>
		    <m:root/>
		    <m:cn>2</m:cn>
		  </m:apply>
		</m:apply>
	      </m:math>
	    </item>
	    <item>
	      <m:math>
		<m:apply>
		  <m:eq/>
		  <m:apply>
		    <m:sum/>
		    <m:bvar><m:ci>n</m:ci></m:bvar>
		    <m:domainofapplication>
		      <m:ci>n</m:ci>
		    </m:domainofapplication>
		    <m:apply>
		      <m:times/>
		      <m:apply>
			<m:ci type="fn">h</m:ci>
			<m:ci>n</m:ci>
		      </m:apply>
		      <m:apply>
			<m:ci type="fn">h</m:ci>
			<m:apply>
			  <m:minus/>
			  <m:ci>n</m:ci>
			  <m:apply>
			    <m:times/>
			    <m:cn>2</m:cn>
			    <m:ci>k</m:ci>
			  </m:apply>
			</m:apply>
		      </m:apply>
		    </m:apply>
		  </m:apply>
		  <m:apply>
		    <m:ci type="fn">δ</m:ci>
		    <m:ci>k</m:ci>
		  </m:apply>
		</m:apply>
	      </m:math>
	    </item>
	    <item>
	      <m:math>
		<m:apply>
		  <m:ci type="fn">h</m:ci>
		  <m:ci>n</m:ci>
		</m:apply>
	      </m:math> has finite support or decays fast enough so
	      that 
	      <m:math>
		<m:apply>
		  <m:lt/>
		  <m:apply>
		    <m:sum/>
		    <m:bvar><m:ci>n</m:ci></m:bvar>
		    <m:domainofapplication>
		      <m:ci>n</m:ci>
		    </m:domainofapplication>
		    <m:apply>
		      <m:times/>
		      <m:apply>
			<m:abs/>
			<m:apply>
			  <m:ci type="fn">h</m:ci>
			  <m:ci>n</m:ci>
			</m:apply>
		      </m:apply>
		      <m:apply>
			<m:power/>
			<m:apply>
			  <m:plus/>
			  <m:cn>1</m:cn>
			  <m:apply>
			    <m:abs/>
			    <m:ci>n</m:ci>
			  </m:apply>
			</m:apply>
			<m:ci>ε</m:ci>
		      </m:apply>
		    </m:apply>
		  </m:apply>
		  <m:infinity/>
		</m:apply>
	      </m:math> for some 
	      <m:math>
		<m:apply>
		  <m:gt/>
		  <m:ci>ε</m:ci>
		  <m:infinity/>
		</m:apply>
	      </m:math>.
	    </item>
	  </list>
	</para>
      </section>

      <section id="subsec4">
	<name>Sufficient Condition 4</name>
	<para id="para8">
	  If the following conditions on 
	  <m:math>
	    <m:apply>
	      <m:ci type="fn">h</m:ci>
	      <m:ci>n</m:ci>
	    </m:apply>
	  </m:math> hold, then 
	  <m:math>
	    <m:apply>
	      <m:ci type="fn">φ</m:ci>
	      <m:ci>t</m:ci>
	    </m:apply>
	  </m:math> exists and generates an orthonormal basis in 
	  <m:math>
	    <m:apply>
	      <m:power/>
	      <m:ci type="set">L</m:ci>
	      <m:cn>2</m:cn>
	    </m:apply>
	  </m:math>.

	  <list id="list4" type="enumerated">
	    <item>
	      <m:math>
		<m:apply>
		  <m:ci type="fn">h</m:ci>
		  <m:ci>n</m:ci>
		</m:apply>
	      </m:math> has compact support.
	    </item>
	    <item>
	      <m:math>
		<m:apply>
		  <m:eq/>
		  <m:apply>
		    <m:sum/>
		    <m:bvar><m:ci>n</m:ci></m:bvar>
		    <m:domainofapplication>
		      <m:ci>n</m:ci>
		    </m:domainofapplication>
		    <m:apply>
		      <m:ci type="fn">h</m:ci>
		      <m:ci>n</m:ci>
		    </m:apply>
		  </m:apply>
		  <m:apply>
		    <m:root/>
		    <m:cn>2</m:cn>
		  </m:apply>
		</m:apply>
	      </m:math>
	    </item>
	    <item>
	      <m:math>
		<m:apply>
		  <m:eq/>
		  <m:apply>
		    <m:sum/>
		    <m:bvar><m:ci>n</m:ci></m:bvar>
		    <m:domainofapplication>
		      <m:ci>n</m:ci>
		    </m:domainofapplication>
		    <m:apply>
		      <m:times/>
		      <m:apply>
			<m:ci type="fn">h</m:ci>
			<m:ci>n</m:ci>
		      </m:apply>
		      <m:apply>
			<m:ci type="fn">h</m:ci>
			<m:apply>
			  <m:minus/>
			  <m:ci>n</m:ci>
			  <m:apply>
			    <m:times/>
			    <m:cn>2</m:cn>
			    <m:ci>k</m:ci>
			  </m:apply>
			</m:apply>
		      </m:apply>
		    </m:apply>
		  </m:apply>
		  <m:apply>
		    <m:ci type="fn">δ</m:ci>
		    <m:ci>k</m:ci>
		  </m:apply>
		</m:apply>
	      </m:math>
	    </item>
	    <item>
	      <m:math>
		<m:apply>
		  <m:neq/>
		  <m:apply>
		    <m:ci type="fn">H</m:ci>
		    <m:ci>ω</m:ci>
		  </m:apply>
		  <m:cn>0</m:cn>
		</m:apply>
	      </m:math> for 
	      <m:math>
		<m:apply>
		  <m:leq/>
		  <m:apply>
		    <m:minus/>
		    <m:apply>
		      <m:divide/>
		      <m:pi/>
		      <m:cn>3</m:cn>
		    </m:apply>
		  </m:apply>
		  <m:ci>ω</m:ci>
		  <m:apply>
		    <m:divide/>
		    <m:pi/>
		    <m:cn>3</m:cn>
		  </m:apply>
		</m:apply>
	      </m:math>
	    </item>
	  </list>
	</para>
      </section>

      <section id="subsec5">
	<name>Sufficient Condition 5</name>
	<para id="para9">
	  If the following conditions on 
	  <m:math>
	    <m:apply>
	      <m:ci type="fn">h</m:ci>
	      <m:ci>n</m:ci>
	    </m:apply>
	  </m:math> hold, then 
	  <m:math>
	    <m:apply>
	      <m:ci type="fn">φ</m:ci>
	      <m:ci>t</m:ci>
	    </m:apply>
	  </m:math> has finite support.

	  <list id="list5" type="enumerated">
	    <item>
	      <m:math>
		<m:apply>
		  <m:ci type="fn">h</m:ci>
		  <m:ci>n</m:ci>
		</m:apply>
	      </m:math> has finite support.
	    </item>
	    <item>
	      <m:math>
		<m:apply>
		  <m:in/>
		  <m:apply>
		    <m:ci type="fn">φ</m:ci>
		    <m:ci>t</m:ci>
		  </m:apply>
		  <m:apply>
		    <m:power/>
		    <m:ci type="set">L</m:ci>
		    <m:cn>1</m:cn>
		  </m:apply>
		</m:apply>
	      </m:math>
	    </item>
	  </list>
	</para>
	<example id="cond5ex">
	  <para id="para10">
	    Let 
	    <m:math>
	      <m:apply>
		<m:eq/>
		<m:apply>
		  <m:ci type="fn" class="discrete">h</m:ci>
		  <m:ci>n</m:ci>
		</m:apply>
		<m:list>
		  <m:cn>0.3327</m:cn>
		  <m:cn>0.8069</m:cn>
		  <m:cn>0.4599</m:cn>
		  <m:cn>-0.1350</m:cn>
		  <m:cn>-0.0854</m:cn>
		  <m:cn>0.0352</m:cn>
		</m:list>
	      </m:apply>
	    </m:math>, which satifies Sufficient Conditions 1-5.
	    <cnxn target="fig3" strength="9"/> shows a plot of the
	    frequency response of the scaling filter 
	    <m:math>
	      <m:apply>
		<m:abs/>
		<m:apply>
		  <m:ci type="fn">H</m:ci>
		  <m:ci>ω</m:ci>
		</m:apply>
	      </m:apply>
	    </m:math> as well as the scaling function 
	    <m:math>
	      <m:apply>
		<m:ci type="fn">φ</m:ci>
		<m:ci>t</m:ci>
	      </m:apply>
	    </m:math>.  
	    <m:math>
	      <m:apply>
		<m:ci type="fn">H</m:ci>
		<m:ci>ω</m:ci>
	      </m:apply>
	    </m:math> is a well behaved low-pass filter.   
	    <m:math>
	      <m:apply>
		<m:ci type="fn">φ</m:ci>
		<m:ci>t</m:ci>
	      </m:apply>
	    </m:math> is a well defined function.  This wavelet system
	    is known as <term>Daubechies 6</term> and is used in many
	    singal processing applications.  The basis formed by this
	    system is orthonormal.
	  </para>

	  <figure id="fig3">
	    <media type="image/png" src="daubscale.png"/>
	    <caption>
	      Frequency response of the scaling filter that satisfies
	      Sufficient Conditions 1-5.
	    </caption>
	  </figure>
	</example>

	<para id="para11">
	  These conditions give a workable basis set with some useful
	  properties.  A 
	  <m:math>
	    <m:apply>
	      <m:ci type="fn">h</m:ci>
	      <m:ci>n</m:ci>
	    </m:apply>
	  </m:math> that satisfies Sufficient Conditions 1-5 will have 
	  <m:math>
	    <m:apply>
	      <m:minus/>
	      <m:apply>
		<m:divide/>
		<m:ci>N</m:ci>
		<m:cn>2</m:cn>
	      </m:apply>
	      <m:cn>1</m:cn>
	    </m:apply>
	  </m:math> degrees of freedom, where
	  <m:math><m:ci>N</m:ci></m:math> is the length of filter 
	  <m:math>
	    <m:apply>
	      <m:ci type="fn">h</m:ci>
	      <m:ci>n</m:ci>
	    </m:apply>
	  </m:math>.  The remaining degrees of freedom will permit
	  more conditions to be placed on the scaling functions.  Click 
          <link src="wavesystem.zip">here </link> for a Labview program that will allow you to use the remaining degrees of freedom to generate an orthogonal wavelet system.
	</para>
      </section>
    </section>
  </content>
  
</document>
