Ch3.2 Discrete Fourier Transform
Ch3.2 Discrete Fourier Transform
Ch3.2 Discrete Fourier Transform
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Inverse <strong>Discrete</strong> <strong>Fourier</strong> <strong>Transform</strong> (IDFT)<br />
• The sequence is called the discrete <strong>Fourier</strong> transform<br />
(DFT) of sequence .<br />
• Utilizing the notation , DFT is usually expressed as<br />
<br />
<br />
<br />
<br />
,01<br />
• The inverse discrete <strong>Fourier</strong> transform (IDFT) is given by<br />
<br />
1 <br />
<br />
,01<br />
• Question: Can we uniquely reconstruct from ? In other words,<br />
is ?<br />
Elec3100 Chapter 3<br />
6
Change language