| Line 9: | Line 9: | ||
<math> x [n] = (1/N) \sum_{k=0}^{N-1} X[k].e^{J.2pi.kn/N}</math> | <math> x [n] = (1/N) \sum_{k=0}^{N-1} X[k].e^{J.2pi.kn/N}</math> | ||
---- | ---- | ||
| − | + | Some pages discussing or using Discrete Fourier Transform | |
*[[Student_summary_Discrete_Fourier_transform_ECE438F09|A summary page about the DFT written by a student]] | *[[Student_summary_Discrete_Fourier_transform_ECE438F09|A summary page about the DFT written by a student]] | ||
| + | |||
| + | Click [[:Category:discrete Fourier transform|here]] to view all the pages in the [[:Category:discrete Fourier transform|discrete Fourier transform]] category. | ||
Revision as of 06:52, 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
Click here to view all the pages in the discrete Fourier transform category.
