Ch3.2 Discrete Fourier Transform
Ch3.2 Discrete Fourier Transform
Ch3.2 Discrete Fourier Transform
SHOW LESS
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
<strong>Discrete</strong> <strong>Fourier</strong> <strong>Transform</strong> (DFT)<br />
• The simplest relation between a length-N sequence and its<br />
DTFT is obtained by uniformly sampling on the -<br />
axis at <br />
,01.<br />
<br />
• From the definition of DTFT, we have<br />
|<br />
<br />
<br />
<br />
<br />
<br />
• Note: is also a length-N sequence in the frequency domain.<br />
Elec3100 Chapter 3<br />
5
Change language