<?xml version="1.0" encoding="utf-8" standalone="no"?>
<!DOCTYPE module PUBLIC "-//CNX//DTD CNXML 0.3 plus MathML//EN" "http://cnx.rice.edu/cnxml/0.3/DTD/cnxml_mathml.dtd">
<module xmlns="http://cnx.rice.edu/cnxml/0.3" xmlns:m="http://www.w3.org/1998/Math/MathML" id="m10247" levelmask="0" created="2000-07-18" revised="2001-05-29" version="0.1"> 
<name xmlns:m="http://www.w3.org/1998/Math/MathML">Discrete-Time Fourier Transform(DTFT)</name>

<authorlist xmlns:m="http://www.w3.org/1998/Math/MathML"> 
   <author xmlns:m="http://www.w3.org/1998/Math/MathML" id="dhj">
      <honorific xmlns:m="http://www.w3.org/1998/Math/MathML">Dr.</honorific> 
      <firstname xmlns:m="http://www.w3.org/1998/Math/MathML">Don</firstname>
      <surname xmlns:m="http://www.w3.org/1998/Math/MathML">Johnson</surname>
      <email xmlns:m="http://www.w3.org/1998/Math/MathML">dhj@rice.edu</email> 
   </author>
</authorlist> 

<maintainerlist xmlns:m="http://www.w3.org/1998/Math/MathML">
   <maintainer xmlns:m="http://www.w3.org/1998/Math/MathML" id="dhj">
      <honorific xmlns:m="http://www.w3.org/1998/Math/MathML">Dr.</honorific> 
      <firstname xmlns:m="http://www.w3.org/1998/Math/MathML">Don</firstname>
      <surname xmlns:m="http://www.w3.org/1998/Math/MathML">Johnson</surname>
      <email xmlns:m="http://www.w3.org/1998/Math/MathML">dhj@rice.edu</email>
   </maintainer>
   <maintainer xmlns:m="http://www.w3.org/1998/Math/MathML" id="seejaie">
      <firstname xmlns:m="http://www.w3.org/1998/Math/MathML">C.J.</firstname>
      <surname xmlns:m="http://www.w3.org/1998/Math/MathML">Ganier</surname>
      <email xmlns:m="http://www.w3.org/1998/Math/MathML">seejaie@rice.edu</email>
   </maintainer>
   <maintainer xmlns:m="http://www.w3.org/1998/Math/MathML" id="jac3">
      <firstname xmlns:m="http://www.w3.org/1998/Math/MathML">John</firstname>
      <othername xmlns:m="http://www.w3.org/1998/Math/MathML">Austin</othername>
      <surname xmlns:m="http://www.w3.org/1998/Math/MathML">Cottrell</surname>
      <lineage xmlns:m="http://www.w3.org/1998/Math/MathML">III</lineage>
      <email xmlns:m="http://www.w3.org/1998/Math/MathML">jac3@rice.edu</email>
   </maintainer>
</maintainerlist>

<keywordlist xmlns:m="http://www.w3.org/1998/Math/MathML">
    <keyword xmlns:m="http://www.w3.org/1998/Math/MathML">Fourier transform</keyword>
    <keyword xmlns:m="http://www.w3.org/1998/Math/MathML">discrete-time</keyword>
    <keyword xmlns:m="http://www.w3.org/1998/Math/MathML">analog</keyword>
    <keyword xmlns:m="http://www.w3.org/1998/Math/MathML">digital</keyword>
    <keyword xmlns:m="http://www.w3.org/1998/Math/MathML">Nyquist frequency</keyword>
    <keyword xmlns:m="http://www.w3.org/1998/Math/MathML">Parseval's Theorem</keyword>
    <keyword xmlns:m="http://www.w3.org/1998/Math/MathML">digital signal processing</keyword>
    <keyword xmlns:m="http://www.w3.org/1998/Math/MathML">DSP</keyword>
    <keyword xmlns:m="http://www.w3.org/1998/Math/MathML">discrete-time Fourier transform</keyword>
</keywordlist> 

<abstract xmlns:m="http://www.w3.org/1998/Math/MathML">Discussion of Discrete-time Fourier Transforms. Topics include comparison with analog transforms and discussion of Parseval's theorem.
</abstract> 

<objectives xmlns:m="http://www.w3.org/1998/Math/MathML">
	To demonstrate some of the properties of the discrete-time Fourier
	transform that simplify the calculations.
</objectives>                                                               

<para xmlns:m="http://www.w3.org/1998/Math/MathML" id="p1"> Now that we have the underpinnings of digital computation, we
need to return to signal processing ideas. The most prominent of which
is, of course, the Fourier transform. The Fourier transform of a
sequence is defined to be
<equation xmlns:m="http://www.w3.org/1998/Math/MathML" id="eqn1">
   <name xmlns:m="http://www.w3.org/1998/Math/MathML">Fourier Transform</name> 
   <m:math mode="inline">
      <m:apply>
         <m:eq/>
         <m:apply>
	    <m:ci>S</m:ci>
	    <m:apply><m:exp/>
	       <m:apply>
	          <m:times/><m:imaginaryi/><m:cn>2</m:cn><m:pi/><m:ci>f</m:ci>
	       </m:apply> 
	    </m:apply>
	 </m:apply>
	 <m:apply><m:sum/>
	    <m:bvar><m:ci>n</m:ci></m:bvar>
	    <m:lowlimit><m:apply><m:minus/><m:infinity/></m:apply></m:lowlimit>
	    <m:uplimit><m:infinity/></m:uplimit>
	    <m:apply><m:times/>
	       <m:apply><m:ci>s</m:ci><m:ci>n</m:ci></m:apply>
	       <m:apply><m:exp/><m:apply><m:minus/>
		  <m:apply>
		     <m:times/>
		     <m:imaginaryi/>
		     <m:cn>2</m:cn>
		     <m:pi/>
		     <m:ci>f</m:ci>
		     <m:ci>n</m:ci>
		  </m:apply></m:apply>
	       </m:apply>
	    </m:apply>
         </m:apply>
      </m:apply>
   </m:math>
</equation>

Frequency here has no units. As should be expected, this definition
is linear, with the transform of a sum of signals equaling the sum of
their transforms. Real-valued signals have conjugate-symmetric spectra:  

   <m:math mode="inline">
      <m:apply><m:eq/>
	 <m:apply><m:ci>S</m:ci>
	    <m:apply><m:exp/>
	       <m:apply><m:minus/><m:apply><m:times/>
		  <m:imaginaryi/>
		  <m:cn>2</m:cn>
		  <m:pi/>
		  <m:ci>f</m:ci>
	       </m:apply></m:apply>
	    </m:apply>
	 </m:apply>
	 <m:apply><m:conjugate/>
	    <m:apply><m:ci>S</m:ci>
	       <m:apply><m:exp/>
	          <m:apply><m:times/>
		     <m:imaginaryi/>
		     <m:cn>2</m:cn>
		     <m:pi/>
		     <m:ci>f</m:ci>
	          </m:apply>
	       </m:apply>
	    </m:apply>
	 </m:apply>
      </m:apply>
   </m:math>
.</para>

<exercise xmlns:m="http://www.w3.org/1998/Math/MathML" id="ex1">
<problem xmlns:m="http://www.w3.org/1998/Math/MathML"><para xmlns:m="http://www.w3.org/1998/Math/MathML" id="prob1">A special property of the discrete-time Fourier transform is
that it is periodic with period one:
<m:math>
   <m:apply><m:eq/>
      <m:apply><m:ci>S</m:ci>
	 <m:apply><m:exp/>
	    <m:apply><m:times/>
	       <m:imaginaryi/>
	       <m:cn>2</m:cn>
	       <m:pi/>
	       <m:apply><m:plus/><m:ci>f</m:ci><m:cn>1</m:cn>
	       </m:apply>
	    </m:apply>
	 </m:apply>
      </m:apply>
      <m:apply><m:ci>S</m:ci>
	 <m:apply><m:exp/>
	    <m:apply><m:times/>
	       <m:imaginaryi/>
	       <m:cn>2</m:cn>
	       <m:pi/>
	       <m:ci>f</m:ci>
	    </m:apply>
	 </m:apply>
      </m:apply>
   </m:apply>
</m:math>
.  Derive this property from
the definition of the DTFT.</para>  
</problem>
<solution xmlns:m="http://www.w3.org/1998/Math/MathML">
<equation xmlns:m="http://www.w3.org/1998/Math/MathML" id="eqn2">
<m:math mode="display">
   <m:apply><m:eq/>
      <m:apply><m:ci>S</m:ci>
	 <m:apply><m:exp/>
	    <m:apply><m:times/>
	       <m:imaginaryi/>
	       <m:cn>2</m:cn>
	       <m:pi/>
	       <m:apply><m:plus/><m:ci>f</m:ci><m:cn>1</m:cn></m:apply>
	    </m:apply>
	 </m:apply>
      </m:apply>
      <m:apply><m:sum/>
	 <m:bvar><m:ci>n</m:ci></m:bvar>
	 <m:lowlimit><m:apply><m:minus/><m:infinity/></m:apply></m:lowlimit>
	 <m:uplimit><m:infinity/></m:uplimit>
	 <m:apply><m:times/>
	    <m:apply><m:ci>s</m:ci><m:ci>n</m:ci></m:apply>
	    <m:apply><m:exp/>
	       <m:apply><m:minus/><m:apply><m:times/>
		  <m:imaginaryi/>
		  <m:cn>2</m:cn>
		  <m:pi/>
		  <m:apply><m:plus/><m:ci>f</m:ci><m:cn>1</m:cn></m:apply>
		  <m:ci>n</m:ci>
	       </m:apply></m:apply>
	    </m:apply>
	 </m:apply>
      </m:apply>
      <m:apply><m:sum/>
	 <m:bvar><m:ci>n</m:ci></m:bvar>
	 <m:lowlimit><m:apply><m:minus/><m:infinity/></m:apply></m:lowlimit>
	 <m:uplimit><m:infinity/></m:uplimit>
	 <m:apply><m:times/>
	    <m:apply><m:exp/>
	       <m:apply><m:minus/><m:apply><m:times/>
		     <m:imaginaryi/>
		     <m:cn>2</m:cn>
		     <m:pi/>
		     <m:ci>n</m:ci>
		  </m:apply>
	       </m:apply>
	    </m:apply>
	    <m:apply><m:ci>s</m:ci><m:ci>n</m:ci></m:apply>
	    <m:apply><m:exp/>
	       <m:apply>
	          <m:times/>
		  <m:imaginaryi/>
		  <m:cn>2</m:cn>
		  <m:pi/>
		  <m:ci>f</m:ci>
		  <m:ci>n</m:ci>
	       </m:apply>
	    </m:apply>
	 </m:apply>
      </m:apply>
      <m:apply><m:sum/>
	 <m:bvar><m:ci>n</m:ci></m:bvar>
	 <m:lowlimit><m:apply><m:minus/><m:infinity/></m:apply></m:lowlimit>
	 <m:uplimit><m:infinity/></m:uplimit>
	 <m:apply><m:times/>
	    <m:apply><m:ci>s</m:ci><m:ci>n</m:ci>
	    </m:apply>
	    <m:apply><m:exp/>
	       <m:apply><m:times/>
		  <m:imaginaryi/>
		  <m:cn>2</m:cn>
		  <m:pi/>
		  <m:ci>f</m:ci>
		  <m:ci>n</m:ci>
	       </m:apply>
	    </m:apply>
	 </m:apply>
      </m:apply>
      <m:apply><m:ci>S</m:ci>
	 <m:apply><m:exp/>
	    <m:apply><m:times/>
	       <m:imaginaryi/>
	       <m:cn>2</m:cn>
	       <m:pi/>
	       <m:ci>f</m:ci>
	    </m:apply>
	 </m:apply>
      </m:apply>
   </m:apply>
</m:math>
</equation>
</solution>
</exercise>
<para xmlns:m="http://www.w3.org/1998/Math/MathML" id="p2"> 
      Because of this periodicity, we need only plot the spectrum over
one period to understand completely the spectrum's structure; typically, we
plot the spectrum over the frequency range
<m:math mode="inline">
   <m:apply>
      <m:interval closure="closed">
         <m:apply><m:minus/>
	    <m:apply><m:divide/><m:cn>1</m:cn><m:cn>2</m:cn></m:apply>
	 </m:apply>
	 <m:apply><m:divide/><m:cn>1</m:cn><m:cn>2</m:cn></m:apply>
      </m:interval>
   </m:apply>
</m:math>. When the
signal is real-valued, we can further simplify our plotting chores by
showing the spectrum only over
<m:math mode="inline">
   <m:apply>
      <m:interval closure="closed">
         <m:cn>0</m:cn>
	 <m:apply><m:divide/><m:cn>1</m:cn><m:cn>2</m:cn></m:apply>
      </m:interval>
   </m:apply>
</m:math>; the spectrum at negative frequencies can be
derived from positive-frequency spectral values.  
</para>


<para xmlns:m="http://www.w3.org/1998/Math/MathML" id="p2.1">
When we obtain the discrete-time signal via sampling an analog signal, the <cnxn xmlns:m="http://www.w3.org/1998/Math/MathML" module="FIXME" strength="6">Nyquist frequency</cnxn> corresponds to the discrete-time frequency 
<m:math>
<m:apply>
  <m:divide/>
  <m:cn>1</m:cn>
  <m:cn>2</m:cn>
</m:apply>
</m:math>
.  To show this, note that a sinusoid at the Nyquist frequency
<m:math>
<m:apply>
  <m:divide/>
  <m:cn>1</m:cn>
  <m:apply>
    <m:times/>
    <m:cn>2</m:cn>
    <m:ci>T</m:ci>
    <m:ci>s</m:ci>
  </m:apply>
</m:apply>
</m:math> 
has a sampled waveform that equals
</para>

<equation xmlns:m="http://www.w3.org/1998/Math/MathML" id="eqn0002">
<name xmlns:m="http://www.w3.org/1998/Math/MathML">Sinusoid at Nyquist Freqency 1/2T</name>
<m:math>
<m:apply>
  <m:eq/>
  <m:apply>
    <m:cos/>
    <m:apply>
      <m:times/>
      <m:cn>2</m:cn>
      <m:ci>π</m:ci>
      <m:ci>·</m:ci>
      <m:apply>
        <m:divide/>
        <m:cn>1</m:cn>
        <m:apply>
          <m:times/>
          <m:cn>2</m:cn>
          <m:ci>T</m:ci>
          <m:ci>s</m:ci>
        </m:apply>
      </m:apply>
      <m:ci>·</m:ci>
      <m:ci>n</m:ci>
      <m:ci>T</m:ci>
      <m:ci>s</m:ci>
    </m:apply>
  </m:apply>
  <m:apply>
    <m:cos/>
    <m:apply>
      <m:times/>
      <m:ci>π</m:ci>
      <m:ci>n</m:ci>
    </m:apply>
  </m:apply>
  <m:apply>
    <m:power/>
    <m:apply>
      <m:minus/>
      <m:cn>1</m:cn>
    </m:apply>
    <m:ci>n</m:ci>
  </m:apply>
</m:apply>
</m:math>
</equation>

<para xmlns:m="http://www.w3.org/1998/Math/MathML" id="p2.2">
The exponential in the DTFT at frequency 
<m:math>
<m:apply>
  <m:divide/>
  <m:cn>1</m:cn>
  <m:cn>2</m:cn>
</m:apply>
</m:math> 
equals 
<m:math>
<m:apply>
  <m:eq/>
  <m:apply>
    <m:exp/>
    <m:apply>
      <m:divide/>
      <m:apply>
        <m:minus/>
        <m:apply>
          <m:times/>
          <m:imaginaryi/>
          <m:cn>2</m:cn>
          <m:ci>π</m:ci>
          <m:ci>n</m:ci>
        </m:apply>
      </m:apply>
      <m:cn>2</m:cn>
    </m:apply>
  </m:apply>
  <m:apply>
    <m:exp/>
    <m:apply>
      <m:minus/>
      <m:apply>
        <m:times/>
        <m:imaginaryi/>
        <m:ci>π</m:ci>
        <m:ci>n</m:ci>
      </m:apply>
    </m:apply>
  </m:apply>
  <m:apply>
    <m:power/>
    <m:apply>
      <m:minus/>
      <m:cn>1</m:cn>
    </m:apply>
    <m:ci>n</m:ci>
  </m:apply>
</m:apply>
</m:math>
, meaning that the correspondence
    between analog and discrete-time frequency is established:
</para>

<equation xmlns:m="http://www.w3.org/1998/Math/MathML" id="eqn0003">
<name xmlns:m="http://www.w3.org/1998/Math/MathML">Analog, Discrete-Time Frequency Relationship</name>
<m:math>
<m:apply>
  <m:eq/>
  <m:ci>
    <m:msub>
    <m:mi>f</m:mi>
    <m:mi>D</m:mi>
    </m:msub>
  </m:ci>
  <m:apply>
    <m:times/>
    <m:ci>
      <m:msub>
      <m:mi>f</m:mi>
      <m:mi>A</m:mi>
      </m:msub>
    </m:ci>
    <m:ci>T</m:ci>
    <m:ci>s</m:ci>
  </m:apply>
</m:apply>    
</m:math> 
</equation>

<para xmlns:m="http://www.w3.org/1998/Math/MathML" id="p2.3">
where 
<m:math>
<m:ci>
  <m:msub>
  <m:mi>f</m:mi>
  <m:mi>D</m:mi>
  </m:msub>
</m:ci>
</m:math> 
and 
<m:math>
<m:ci>
  <m:msub>
  <m:mi>f</m:mi>
  <m:mi>A</m:mi>
  </m:msub>
</m:ci>
</m:math> 
represent discrete-time and analog frequency variables, respectively.  The <cnxn xmlns:m="http://www.w3.org/1998/Math/MathML" module="m0050" target="alias" strength="8">aliasing figure</cnxn> provides another way of deriving this result.  As the duration of each pulse in the periodic sampling signal 
<m:math>
<m:apply>
  <m:ci type="fn">
    <m:msub>
    <m:mi>p</m:mi>
    <m:mi>Ts</m:mi>
    </m:msub>
  </m:ci>
  <m:ci>t</m:ci>
</m:apply>
</m:math> 
narrows, the amplitudes of the signal's spectral repetitions, which are governed by the <cnxn xmlns:m="http://www.w3.org/1998/Math/MathML" module="m0050" target="pulse" strength="8">Fourier series coefficients</cnxn>
of 
<m:math>
<m:apply>
  <m:ci type="fn">
    <m:msub>
    <m:mi>p</m:mi>
    <m:mi>Ts</m:mi>
    </m:msub>
  </m:ci>
  <m:ci>t</m:ci>
</m:apply>
</m:math>
, become increasingly equal.  Examination of the <cnxn xmlns:m="http://www.w3.org/1998/Math/MathML" module="m0050" target="pulse" strength="8">periodic pulse signal</cnxn> reveals that as 
<m:math>
<m:ci>Δ</m:ci>
</m:math> 
decreases, the value of
<m:math>
<m:ci>
  <m:msub>
  <m:mi>c</m:mi>
  <m:mn>0</m:mn>
  </m:msub>
</m:ci>
</m:math>
, the largest Fourier coefficient, decreases to zero: 
<m:math>
<m:apply>
  <m:eq/>
  <m:apply>
    <m:abs/>
    <m:ci>
      <m:msub>
      <m:mi>c</m:mi>
      <m:mn>0</m:mn>
      </m:msub>
    </m:ci>
  </m:apply>
  <m:apply>
    <m:divide/>
    <m:apply>
      <m:times/>
      <m:ci>A</m:ci>
      <m:ci>Δ</m:ci>
    </m:apply>
    <m:ci>T</m:ci>
  </m:apply>
</m:apply>
</m:math>
.  Thus, to maintain a mathematically viable Sampling Theorem, the amplitude
<m:math>
<m:ci>A</m:ci>
</m:math> 
must increase as 
<m:math>
<m:apply>
  <m:divide/>
  <m:cn>1</m:cn>
  <m:ci>Δ</m:ci>
</m:apply>
</m:math>
, becoming infinitely large as the pulse duration decreases.  Practical systems use a small value of 
<m:math>
<m:ci>Δ</m:ci>
</m:math>
, say 
<m:math>
<m:apply>
  <m:times/>
  <m:cn>0.1</m:cn>
  <m:ci>·</m:ci>
  <m:ci>T</m:ci>
  <m:ci>s</m:ci>
</m:apply>
</m:math> 
and use amplifiers to rescale the signal.  Thus, the sampled signal's spectrum becomes periodic with period 
<m:math>
<m:apply>
  <m:divide/>
  <m:cn>1</m:cn>
  <m:apply>
    <m:times/>
    <m:ci>T</m:ci>
    <m:ci>s</m:ci>
  </m:apply>
</m:apply>
</m:math>
. Thus, the Nyquist frequency 
<m:math>
<m:apply>
  <m:divide/>
  <m:cn>1</m:cn>
  <m:apply>
    <m:times/>
    <m:cn>2</m:cn>
    <m:ci>T</m:ci>
    <m:ci>s</m:ci>
  </m:apply>
</m:apply>
</m:math>
corresponds to the frequency 
<m:math>
<m:apply>
  <m:divide/>
  <m:cn>1</m:cn>
  <m:cn>2</m:cn>
</m:apply>
</m:math>
.
</para>

<para xmlns:m="http://www.w3.org/1998/Math/MathML" id="p2.4">
The inverse discrete-time Fourier transform is easily derived from the following relationship:
</para>

<equation xmlns:m="http://www.w3.org/1998/Math/MathML" id="eqn0012">
<m:math>
<m:apply>
  <m:eq/>
  <m:apply>
    <m:int/>
    <m:uplimit>
    <m:apply>
      <m:divide/>
      <m:cn>1</m:cn>
      <m:cn>2</m:cn>
    </m:apply>
    </m:uplimit>
    <m:lowlimit>
    <m:apply>
      <m:minus/>
      <m:apply>
        <m:divide/>
        <m:cn>1</m:cn>
        <m:cn>2</m:cn>
      </m:apply>
    </m:apply>
    </m:lowlimit>
    <m:bvar><m:ci>f</m:ci></m:bvar>
    <m:apply>
      <m:times/>
      <m:apply>
        <m:exp/>
        <m:apply>
          <m:minus/>
          <m:apply>
            <m:times/>
            <m:imaginaryi/>
            <m:cn>2</m:cn>
            <m:ci>π</m:ci>
            <m:ci>f</m:ci>
            <m:ci>m</m:ci>
          </m:apply>
        </m:apply>
      </m:apply>
      <m:apply>
        <m:exp/>
        <m:apply>
          <m:times/>
          <m:ci>∗</m:ci>
          <m:imaginaryi/>
          <m:ci>π</m:ci>
          <m:ci>f</m:ci>
          <m:ci>n</m:ci>
        </m:apply>
      </m:apply>
    </m:apply>
  </m:apply>
  <m:piecewise>
    <m:piece>
    <m:cn>1</m:cn>
    <m:apply>
      <m:eq/>
      <m:ci>m</m:ci>
      <m:ci>n</m:ci>
    </m:apply>
    </m:piece>
    <m:piece>
    <m:cn>0</m:cn>
    <m:apply>
      <m:neq/>
      <m:ci>m</m:ci>
      <m:ci>n</m:ci>
    </m:apply>
    </m:piece>
  </m:piecewise>
</m:apply>
</m:math>
</equation>

<para xmlns:m="http://www.w3.org/1998/Math/MathML" id="p2.5">
Therefore, we find that
</para>

<equation xmlns:m="http://www.w3.org/1998/Math/MathML" id="eqn0013">
<m:math>
<m:apply>
  <m:eq/>
  <m:apply>
    <m:int/>
    <m:bvar><m:ci>f</m:ci></m:bvar>
    <m:lowlimit>
    <m:apply>
      <m:minus/>
      <m:apply>
        <m:divide/>
        <m:cn>1</m:cn>
        <m:cn>2</m:cn>
      </m:apply>
    </m:apply>
    </m:lowlimit>
    <m:uplimit>
    <m:apply>
      <m:divide/>
      <m:cn>1</m:cn>
      <m:cn>2</m:cn>
    </m:apply>
    </m:uplimit>
    <m:apply>
      <m:times/>
      <m:apply>
        <m:ci type="fn">S</m:ci>
        <m:apply>
          <m:exp/>
          <m:apply>
            <m:times/>
            <m:imaginaryi/>
            <m:cn>2</m:cn>
            <m:ci>π</m:ci>
            <m:ci>f</m:ci>
          </m:apply>
        </m:apply>
      </m:apply>
      <m:apply>
        <m:exp/>
        <m:apply>
          <m:times/>
          <m:ci>∗</m:ci>
          <m:cn>2</m:cn>
          <m:ci>π</m:ci>
          <m:ci>f</m:ci>
          <m:ci>n</m:ci>
        </m:apply>
      </m:apply>
    </m:apply>
  </m:apply>
  <m:apply>
    <m:int/>
    <m:bvar><m:ci>f</m:ci></m:bvar>
    <m:lowlimit>
    <m:apply>
      <m:minus/>
      <m:apply>
        <m:divide/>
        <m:cn>1</m:cn>
        <m:cn>2</m:cn>
      </m:apply>
    </m:apply>
    </m:lowlimit>
    <m:uplimit>
    <m:apply>
      <m:divide/>
      <m:cn>1</m:cn>
      <m:cn>2</m:cn>
    </m:apply>
    </m:uplimit>
    <m:apply>
      <m:sum/>
      <m:bvar><m:ci>m</m:ci></m:bvar>
      <m:condition><m:ci>m</m:ci></m:condition>
      <m:apply>
        <m:times/>
        <m:apply>
          <m:ci type="fn">s</m:ci>
          <m:ci>m</m:ci>
        </m:apply>
        <m:apply>
          <m:exp/>
          <m:apply>
            <m:minus/>
            <m:apply>
              <m:times/>
              <m:imaginaryi/>
              <m:cn>2</m:cn>
              <m:ci>π</m:ci>
              <m:ci>f</m:ci>
              <m:ci>m</m:ci>
            </m:apply>
          </m:apply>
        </m:apply>
        <m:apply>
          <m:exp/>
          <m:apply>
            <m:times/>
            <m:ci>∗</m:ci>
            <m:imaginaryi/>
            <m:cn>2</m:cn>
            <m:ci>π</m:ci>
            <m:ci>f</m:ci>
            <m:ci>n</m:ci>
          </m:apply>
        </m:apply>
      </m:apply>
    </m:apply>
  </m:apply>
  <m:apply>
    <m:sum/>
    <m:bvar><m:ci>m</m:ci></m:bvar>
    <m:condition><m:ci>m</m:ci></m:condition>
    <m:apply>
      <m:times/>
      <m:apply>
        <m:ci type="fn">s</m:ci>
        <m:ci>m</m:ci>
      </m:apply>
      <m:apply>
        <m:int/>
        <m:bvar><m:ci>f</m:ci></m:bvar>
        <m:lowlimit>
        <m:apply>
          <m:minus/>
          <m:apply>
            <m:divide/>
            <m:cn>1</m:cn>
            <m:cn>2</m:cn>
          </m:apply>
        </m:apply>
        </m:lowlimit>
        <m:uplimit>
        <m:apply>
          <m:divide/>
          <m:cn>1</m:cn>
          <m:cn>2</m:cn>
        </m:apply>
        </m:uplimit>
        <m:apply>
          <m:exp/>
          <m:apply>
            <m:times/>
            <m:apply>
              <m:minus/>
              <m:apply>
                <m:times/>
                <m:imaginaryi/>
                <m:cn>2</m:cn>
                <m:ci>π</m:ci>
                <m:ci>f</m:ci>
              </m:apply>
            </m:apply>
            <m:apply>
              <m:minus/>
              <m:ci>m</m:ci>
              <m:ci>n</m:ci>
            </m:apply>
          </m:apply>
        </m:apply>
      </m:apply>
    </m:apply>
  </m:apply>
  <m:apply>
    <m:ci type="fn">s</m:ci>
    <m:ci>n</m:ci>
  </m:apply>
</m:apply>
</m:math>
</equation>

<para xmlns:m="http://www.w3.org/1998/Math/MathML" id="p2.6">
The Fourier transform pairs in discrete-time are  
</para>

<equation xmlns:m="http://www.w3.org/1998/Math/MathML" id="eqn0014a">
<name xmlns:m="http://www.w3.org/1998/Math/MathML">Fourier Transform Pairs in Discrete Time</name>
<m:math>
<m:apply>
  <m:eq/>
  <m:apply>
    <m:ci type="fn">S</m:ci>
    <m:apply>
      <m:exp/>
      <m:apply>
        <m:times/>
        <m:imaginaryi/>
        <m:cn>2</m:cn>
        <m:ci>π</m:ci>
        <m:ci>f</m:ci>
      </m:apply>
    </m:apply>
  </m:apply>
  <m:apply>
    <m:sum/>
    <m:bvar><m:ci>n</m:ci></m:bvar>
    <m:condition><m:ci>n</m:ci></m:condition>
    <m:apply>
      <m:times/>
      <m:apply>
        <m:ci type="fn">s</m:ci>
        <m:ci>n</m:ci>
      </m:apply>
      <m:apply>
        <m:exp/>
        <m:apply>
          <m:minus/>
          <m:apply>
            <m:times/>
            <m:imaginaryi/>
            <m:cn>2</m:cn>
            <m:ci>π</m:ci>
            <m:ci>f</m:ci>
            <m:ci>n</m:ci>
          </m:apply>
        </m:apply>
      </m:apply>
    </m:apply>
  </m:apply>
</m:apply>
</m:math> 
</equation>

<equation xmlns:m="http://www.w3.org/1998/Math/MathML" id="eqn0014b">
<name xmlns:m="http://www.w3.org/1998/Math/MathML">Fourier Transform Pairs in Discrete Time</name>
<m:math>
<m:apply>
  <m:eq/>
  <m:apply>
    <m:ci type="fn">s</m:ci>
    <m:ci>n</m:ci>
  </m:apply>
  <m:apply>
    <m:int/>
    <m:bvar><m:ci>f</m:ci></m:bvar>
    <m:lowlimit>
    <m:apply>
      <m:minus/>
      <m:apply>
        <m:divide/>
        <m:cn>1</m:cn>
        <m:cn>2</m:cn>
      </m:apply>
    </m:apply>
    </m:lowlimit>
    <m:uplimit>
    <m:apply>
      <m:divide/>
      <m:cn>1</m:cn>
      <m:cn>2</m:cn>
    </m:apply>
    </m:uplimit>
    <m:apply>
      <m:times/>
      <m:apply>
        <m:ci type="fn">S</m:ci>
        <m:apply>
          <m:exp/>
          <m:apply>
            <m:times/>
            <m:imaginaryi/>
            <m:cn>2</m:cn>
            <m:ci>π</m:ci>
            <m:ci>f</m:ci>
          </m:apply>
        </m:apply>
      </m:apply>
      <m:apply>
        <m:exp/>
        <m:apply>
          <m:times/>
          <m:ci>∗</m:ci>
          <m:imaginaryi/>
          <m:cn>2</m:cn>
          <m:ci>π</m:ci>
          <m:ci>f</m:ci>
          <m:ci>n</m:ci>
        </m:apply>
      </m:apply>
    </m:apply>
  </m:apply>
</m:apply>
</m:math>
</equation>
<para xmlns:m="http://www.w3.org/1998/Math/MathML" id="intro"> 
The properties of the discrete-time Fourier transform mirror those of the analog Fourier transform.  The <cnxn xmlns:m="http://www.w3.org/1998/Math/MathML" module="m0506" strength="8">DTFT properties table </cnxn> shows similarities and differences.  One important common property is Parseval's Theorem.  

<equation xmlns:m="http://www.w3.org/1998/Math/MathML" id="zerozerofifteen">
<m:math>
<m:apply>
  <m:eq/>
  <m:apply>
    <m:sum/>
    <m:bvar><m:ci>n</m:ci></m:bvar>
    <m:lowlimit>
    <m:apply>
      <m:minus/>
      <m:ci>∞</m:ci>
    </m:apply>
    </m:lowlimit>
    <m:uplimit><m:ci>∞</m:ci></m:uplimit>
    <m:apply>
      <m:power/>
      <m:apply>
        <m:abs/>
        <m:apply>
          <m:ci type="fn">s</m:ci>
          <m:ci>n</m:ci>
        </m:apply>
      </m:apply>
      <m:cn>2</m:cn>
    </m:apply>
  </m:apply>
  <m:apply>
    <m:int/>
    <m:bvar><m:ci>f</m:ci></m:bvar>
    <m:lowlimit>
    <m:apply>
      <m:minus/>
      <m:apply>
        <m:divide/>
        <m:cn>1</m:cn>
        <m:cn>2</m:cn>
      </m:apply>
    </m:apply>
    </m:lowlimit>
    <m:uplimit>
    <m:apply>
      <m:divide/>
      <m:cn>1</m:cn>
      <m:cn>2</m:cn>
    </m:apply>
    </m:uplimit>
    <m:apply>
      <m:power/>
      <m:apply>
        <m:abs/>
        <m:apply>
          <m:ci type="fn">S</m:ci>
          <m:apply>
            <m:exp/>
            <m:apply>
              <m:times/>
              <m:imaginaryi/>
              <m:cn>2</m:cn>
              <m:ci>π</m:ci>
              <m:ci>f</m:ci>
            </m:apply>
          </m:apply>
        </m:apply>
      </m:apply>
      <m:cn>2</m:cn>
    </m:apply>
  </m:apply>
</m:apply>
</m:math> 
</equation>
To show this important property, we simply substitute the Fourier transform expression into the frequency-domain expression for power.

<equation xmlns:m="http://www.w3.org/1998/Math/MathML" id="zerozerosixteen">
<m:math>
<m:apply>
  <m:eq/>
  <m:apply>
    <m:int/>
    <m:bvar><m:ci>f</m:ci></m:bvar>
    <m:lowlimit>
    <m:apply>
      <m:minus/>
      <m:apply>
        <m:divide/>
        <m:cn>1</m:cn>
        <m:cn>2</m:cn>
      </m:apply>
    </m:apply>
    </m:lowlimit>
    <m:uplimit>
    <m:apply>
      <m:divide/>
      <m:cn>1</m:cn>
      <m:cn>2</m:cn>
    </m:apply>
    </m:uplimit>
    <m:apply>
      <m:power/>
      <m:apply>
        <m:abs/>
        <m:apply>
          <m:ci type="fn">S</m:ci>
          <m:apply>
            <m:exp/>
            <m:apply>
              <m:times/>
              <m:imaginaryi/>
              <m:cn>2</m:cn>
              <m:ci>π</m:ci>
              <m:ci>f</m:ci>
            </m:apply>
          </m:apply>
        </m:apply>
      </m:apply>
      <m:cn>2</m:cn>
    </m:apply>
  </m:apply>
  <m:apply>
    <m:int/>
    <m:bvar><m:ci>f</m:ci></m:bvar>
    <m:lowlimit>
    <m:apply>
      <m:minus/>
      <m:apply>
        <m:divide/>
        <m:cn>1</m:cn>
        <m:cn>2</m:cn>
      </m:apply>
    </m:apply>
    </m:lowlimit>
    <m:uplimit>
    <m:apply>
      <m:divide/>
      <m:cn>1</m:cn>
      <m:cn>2</m:cn>
    </m:apply>
    </m:uplimit>
    <m:apply>
      <m:times/>
      <m:apply>
        <m:sum/>
        <m:bvar><m:ci>n</m:ci></m:bvar>
        <m:condition><m:ci>n</m:ci></m:condition>
        <m:apply>
          <m:times/>
          <m:apply>
            <m:ci type="fn">s</m:ci>
            <m:ci>n</m:ci>
          </m:apply>
          <m:apply>
            <m:exp/>
            <m:apply>
              <m:minus/>
              <m:apply>
                <m:times/>
                <m:imaginaryi/>
                <m:cn>2</m:cn>
                <m:ci>π</m:ci>
                <m:ci>f</m:ci>
                <m:ci>n</m:ci>
              </m:apply>
            </m:apply>
          </m:apply>
        </m:apply>
      </m:apply>
      <m:apply>
        <m:sum/>
        <m:bvar><m:ci>m</m:ci></m:bvar>
        <m:condition><m:ci>m</m:ci></m:condition>
        <m:apply>
          <m:times/>
          <m:apply>
            <m:ci type="fn">
              <m:msup>
              <m:mi>s</m:mi>
              <m:mi>∗</m:mi>
              </m:msup>
            </m:ci>
            <m:ci>n</m:ci>
          </m:apply>
          <m:apply>
            <m:exp/>
            <m:apply>
              <m:times/>
              <m:ci>∗</m:ci>
              <m:imaginaryi/>
              <m:cn>2</m:cn>
              <m:ci>π</m:ci>
              <m:ci>f</m:ci>
              <m:ci>m</m:ci>
            </m:apply>
          </m:apply>
        </m:apply>
      </m:apply>
    </m:apply>
  </m:apply>
  <m:apply>
    <m:sum/>
    <m:bvar><m:ci>n,m</m:ci></m:bvar>
    <m:condition><m:ci>n,m</m:ci></m:condition>
    <m:apply>
      <m:times/>
      <m:apply>
        <m:ci type="fn">s</m:ci>
        <m:ci>n</m:ci>
      </m:apply>
      <m:apply>
        <m:ci type="fn">
          <m:msup>
          <m:mi>s</m:mi>
          <m:mi>∗</m:mi>
          </m:msup>
        </m:ci>
        <m:ci>m</m:ci>
      </m:apply>
      <m:apply>
        <m:int/>
        <m:bvar><m:ci>f</m:ci></m:bvar>
        <m:lowlimit>
        <m:apply>
          <m:minus/>
          <m:apply>
            <m:divide/>
            <m:cn>1</m:cn>
            <m:cn>2</m:cn>
          </m:apply>
        </m:apply>
        </m:lowlimit>
        <m:uplimit>
        <m:apply>
          <m:divide/>
          <m:cn>1</m:cn>
          <m:cn>2</m:cn>
        </m:apply>
        </m:uplimit>
        <m:apply>
          <m:exp/>
          <m:apply>
            <m:times/>
            <m:ci>∗</m:ci>
            <m:imaginaryi/>
            <m:cn>2</m:cn>
            <m:ci>π</m:ci>
            <m:ci>f</m:ci>
            <m:apply>
              <m:minus/>
              <m:ci>m</m:ci>
              <m:ci>n</m:ci>
            </m:apply>
          </m:apply>
        </m:apply>
      </m:apply>
    </m:apply>
  </m:apply>
</m:apply>
</m:math>
</equation>

Using the <cnxn xmlns:m="http://www.w3.org/1998/Math/MathML" module="m0525" target="fig0012" strength="8">orthogonality relation</cnxn>, the integral equals 
<m:math>
<m:apply>
  <m:ci type="fn">δ</m:ci>
  <m:apply>
    <m:minus/>
    <m:ci>m</m:ci>
    <m:ci>n</m:ci>
  </m:apply>
</m:apply>
</m:math>, where 
<m:math>
<m:apply>
  <m:ci type="fn">δ</m:ci>
  <m:ci>n</m:ci>
</m:apply>
</m:math> is the <cnxn xmlns:m="http://www.w3.org/1998/Math/MathML" module="m0009" target="fig0003" strength="8">unit sample</cnxn>.  Thus, the double sum collapses into a single sum because nonzero values occur only when 
<m:math>
<m:apply>
  <m:eq/>
  <m:ci>n</m:ci>
  <m:ci>m</m:ci>
</m:apply>
</m:math>, giving Parseval's Theorem as a result.  We term 
<m:math>
<m:apply>
  <m:sum/>
  <m:bvar><m:ci>n</m:ci></m:bvar>
  <m:condition><m:ci>n</m:ci></m:condition>
  <m:apply>
    <m:power/>
    <m:apply>
      <m:ci type="fn">s</m:ci>
      <m:ci>n</m:ci>
    </m:apply>
    <m:cn>2</m:cn>
  </m:apply>
</m:apply>
</m:math> 
the energy in the discrete-time signal 
<m:math>
<m:apply>
  <m:ci type="fn">s</m:ci>
  <m:ci>n</m:ci>
</m:apply>
</m:math> 
in spite of the fact that discrete-time signals don't consume (or produce for that matter) energy.  This terminology is a carry-over from the analog world.   </para>

<exercise xmlns:m="http://www.w3.org/1998/Math/MathML" id="exer1">

<problem xmlns:m="http://www.w3.org/1998/Math/MathML">
<para xmlns:m="http://www.w3.org/1998/Math/MathML" id="probone">
Suppose we obtained our discrete-time signal from values of the product  
<m:math>
<m:apply>
  <m:times/>
  <m:apply>
    <m:ci type="fn">s</m:ci>
    <m:ci>t</m:ci>
  </m:apply>
  <m:apply>
    <m:ci type="fn">
      <m:msub>
      <m:mi>p</m:mi> 
      <m:mrow>
        <m:msub>
        <m:mi>T</m:mi>
        <m:mi>s</m:mi>
        </m:msub> 
      </m:mrow>
      </m:msub>
    </m:ci>
    <m:ci>t</m:ci>
  </m:apply>
</m:apply>
</m:math>
, where the duration of the component pulses in
<m:math>
<m:apply>
  <m:ci type="fn">
    <m:msub>
    <m:mi>p</m:mi>
    <m:mrow>
      <m:msub>
      <m:mi>T</m:mi>
      <m:mi>s</m:mi>
      </m:msub>
    </m:mrow>
    </m:msub>
  </m:ci>
  <m:ci>t</m:ci>
</m:apply>
</m:math> 
is 
<m:math>
<m:ci>Δ</m:ci>
</m:math>
.  How is the discrete-time signal energy related to the total energy contained in 
<m:math>
<m:apply>
  <m:ci type="fn">s</m:ci>
  <m:ci>t</m:ci>
</m:apply>
</m:math>
?  Assume the signal is bandlimited and that the sampling rate was chosen appropriate to the Sampling Theorem's conditions.
</para>
</problem>

<solution xmlns:m="http://www.w3.org/1998/Math/MathML">
<para xmlns:m="http://www.w3.org/1998/Math/MathML" id="answer">
If the sampling frequency exceeds the Nyquist frequency, the spectrum of the
samples equals the analog spectrum, but over the normalized analog frequency  
<m:math>
<m:apply>
  <m:times/>
  <m:ci>f</m:ci>
  <m:ci>T</m:ci>
</m:apply>
</m:math>
.  Thus, the energy in the sampled signal equals the original signal's energy multipled by T.
</para>
</solution>

</exercise>



</module>
