Science Fair Project Encyclopedia
Discrete-time fourier transform
The discrete time Fourier transform is the discrete time analog of the Fourier transform.
Formulation
- The DTFT of the function f[n] is:
![F(e^{j\omega})=\sum_{n=-\infty}^\infty {f[n]e^{j{\omega}n}}](a/../upload/math/d579fdfa5167d50b4673630f54808ff9.png)
- The inverse transform of F(ejω) is:
![f[n]=\frac{1}{2\pi}\sum_{n=-\infty}^\infty {F(e^{j\omega})e^{-j{\omega}n}}](a/../upload/math/b57ff198744bd10fbc2d2700d246784b.png)
10-26-2009 08:16:03
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details