Ch3.2 Discrete Fourier Transform
Ch3.2 Discrete Fourier Transform
Ch3.2 Discrete Fourier Transform
SHOW LESS
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
<strong>Discrete</strong> <strong>Fourier</strong> <strong>Transform</strong><br />
• Example: Consider the length-N sequence<br />
1, 0<br />
<br />
0, 1 1<br />
• Its N-point DFT is given by<br />
<br />
<br />
<br />
<br />
1,01<br />
0 <br />
<br />
• Example: Consider the length-N sequence<br />
1, , 0 1<br />
<br />
0, otherwise<br />
• Its N-point DFT is given by<br />
∑<br />
<br />
<br />
<br />
<br />
,0 1<br />
Elec3100 Chapter 3<br />
8
Change language