<?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="None">
  <name>M-Channel Filter Banks</name>
  <metadata>
  <md:version>1.1</md:version>
  <md:created>2005/02/16 21:37:15 US/Central</md:created>
  <md:revised>2005/04/28 14:55:55 GMT-5</md:revised>
  <md:authorlist>
      <md:author id="dljones">
      <md:firstname>Douglas</md:firstname>
      <md:othername>L.</md:othername>
      <md:surname>Jones</md:surname>
      <md:email>dl-jones@uiuc.edu</md:email>
    </md:author>
  </md:authorlist>

  <md:maintainerlist>
    <md:maintainer id="dljones">
      <md:firstname>Douglas</md:firstname>
      <md:othername>L.</md:othername>
      <md:surname>Jones</md:surname>
      <md:email>dl-jones@uiuc.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:maintainer id="kclarks">
      <md:firstname>Kyle</md:firstname>
      
      <md:surname>Clarkson</md:surname>
      <md:email>kclarks@rice.edu</md:email>
    </md:maintainer>
  </md:maintainerlist>
  
  <md:keywordlist>
    <md:keyword>multirate signal processing</md:keyword>
  </md:keywordlist>

  <md:abstract/>
</metadata>

  <content>
    <para id="para1">
      The theory of M-band QMFBs and PRFBs has been investigated
      recently.  Some results are available.
    </para>

    <section id="sec1">
      <name>Tree-structured filter banks</name>
      <para id="para2">
	Once we have a two-band PRFB, we can continue to split the
	subbands with similar systems! (<cnxn target="fig1"/>)

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

	Thus we can recursively decompose a signal into 
	<m:math>
	  <m:apply>
	    <m:power/>
	    <m:cn>2</m:cn>
	    <m:ci>p</m:ci>
	  </m:apply>
	</m:math> bands, each sampled at  
	<m:math>
	  <m:apply>
	    <m:power/>
	    <m:cn>2</m:cn>
	    <m:ci>p</m:ci>
	  </m:apply>
	</m:math>th the rate of the original signal, and reconstruct
	exactly!  Due to the tree structure, this can be quite
	efficient, and in fact close to the efficiency of an FFT
	filter bank, which does <emphasis>not</emphasis> have perfect
	reconstruction.
      </para>
    </section>

    <section id="sec2">
      <name>Wavelet decomposition</name>
      <para id="para3">
	We need not split both the upper-frequency and lower-frequency
	bands identically. (<cnxn target="fig2"/>)

	<figure id="fig2">
	  <media type="image/png" src="imag002.png"/>
	</figure>
	This is good for image coding, because the energy tends to be
	distributed such that after a wavelet decomposition, each band
	has roughly equal energy.
      </para>
    </section>
  </content>
  
</document>
