| Line 1: | Line 1: | ||
| − | + | = 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 | ||
| + | |||
| + | <math> X [k] = \sum_{k=0}^{N-1} x[n].e^{-J.2pi.kn/N}.</math> | ||
| + | |||
| + | Conversely, the Inverse Discrete Fourier transform is | ||
| + | |||
| + | <math> x [n] = (1/N) \sum_{k=0}^{N-1} X[k].e^{J.2pi.kn/N}</math> | ||
| + | ---- | ||
| + | More about the Discrete Fourier Transform | ||
| + | *[[Student_summary_Discrete_Fourier_transform_ECE438F09|A summary page about the DFT written by a student]] | ||
Revision as of 15:38, 8 October 2010
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} $
More about the Discrete Fourier Transform
