Revision as of 07:13, 23 September 2011

Discrete Fourier Transform

Definition: let x[n] be a discrete-time signal with Period N. Then the Discrete Fourier Transform X[k] of x[n] is the discrete-time signal defined by

$X [k] = \sum_{k=0}^{N-1} x[n].e^{-J.2pi.kn/N}.$

Conversely, the Inverse Discrete Fourier transform is

$x [n] = (1/N) \sum_{k=0}^{N-1} X[k].e^{J.2pi.kn/N}$

Some pages discussing or using Discrete Fourier Transform

• A summary page about the DFT written by a student from ECE438
• Practice Question on DFT computation from ECE438
• Practice Question on DFT computation from ECE438
• Practice Question on DFT computation from ECE438
• Table of DFT pairs and properties from Collective Table of Formulas

Click here to view all the pages in the discrete Fourier transform category.