| Line 14: | Line 14: | ||
*[[Compute DFT practice no1 ECE438F11|Practice Question on DFT computation]] from [[ECE438]] | *[[Compute DFT practice no1 ECE438F11|Practice Question on DFT computation]] from [[ECE438]] | ||
*[[Compute DFT practice no2 ECE438F11|Practice Question on DFT computation]] from [[ECE438]] | *[[Compute DFT practice no2 ECE438F11|Practice Question on DFT computation]] from [[ECE438]] | ||
| + | *[[Discrete_Fourier_Transform_table|Table of DFT pairs and properties]] from [[Collective_Table_of_Formulas|Collective Table of Formulas]] | ||
Click [[:Category:discrete Fourier transform|here]] to view all the pages in the [[:Category:discrete Fourier transform|discrete Fourier transform]] category. | Click [[:Category:discrete Fourier transform|here]] to view all the pages in the [[:Category:discrete Fourier transform|discrete Fourier transform]] category. | ||
Revision as of 07:12, 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.
