| Line 5: | Line 5: | ||
'''Definition''' | '''Definition''' | ||
| + | |||
DFT | DFT | ||
| − | <math>X(k) = \sum^N-1_n=0{x(n) | + | *<math>X(k) = \sum^N-1_n=0{x(n)exp(-j2pikn/N) dn } k = 0, 1, 2, ..., N-1</math> |
Inverse DFT (IDFT) | Inverse DFT (IDFT) | ||
| − | <math>x[n] = (1/N)\sum^N-1_k=0{X(k) | + | *<math>x[n] = (1/N)\sum^N-1_k=0{X(k)exp(j2pikn/N) dk } n = 0, 1, 2, ..., N-1</math> |
Revision as of 16:21, 18 September 2009
DFT ( Discrete Fourier Transform )
Definition
DFT
- $ X(k) = \sum^N-1_n=0{x(n)exp(-j2pikn/N) dn } k = 0, 1, 2, ..., N-1 $
Inverse DFT (IDFT)
- $ x[n] = (1/N)\sum^N-1_k=0{X(k)exp(j2pikn/N) dk } n = 0, 1, 2, ..., N-1 $
