| (3 intermediate revisions by the same user not shown) | |||
| Line 5: | Line 5: | ||
=About the Discrete-time Fourier transform (DTFT)= | =About the Discrete-time Fourier transform (DTFT)= | ||
<math>\,\mathcal{X}(\omega)=\mathcal{F}(x[n])=\sum_{n=-\infty}^{\infty}x[n]e^{-j\omega n}\,</math> | <math>\,\mathcal{X}(\omega)=\mathcal{F}(x[n])=\sum_{n=-\infty}^{\infty}x[n]e^{-j\omega n}\,</math> | ||
| + | ---- | ||
| + | ==Practice Problems== | ||
| + | *[[Practice DTFT computation cosine ECE438F11|What is the Fourier transform of this DT cosine?]] | ||
| + | *[[Practice DTFT computation rect ECE438F11|What is the Fourier transform of this DT rect function?]] | ||
| + | *[[practice_DTFT_computation_sine_ECE438F13|Compute the DT Fourier transform of a sinc]] | ||
| + | *[[practice_DTFT_computation_rect_ECE438F13|Compute the DT Fourier transform of a rect]] | ||
| + | *[[Fourier_transform_3numinusn_DT_ECE301S11|Compute the Fourier transform of 3^n u[-n]]] | ||
| + | *[[Fourier_transform_window_DT_ECE301S11|Compute the Fourier transform of u[n+1]-u[n-2]]] | ||
---- | ---- | ||
==Slectures on DTFT== | ==Slectures on DTFT== | ||
| Line 18: | Line 26: | ||
----- | ----- | ||
==Other pages related to the DTFT== | ==Other pages related to the DTFT== | ||
| − | + | *[[Table_DT_Fourier_Transforms|Table of discrete-time Fourier transform pairs and properties]] | |
| − | + | *[[Relationship_between_DTFT_%26_Z-Transform_-_Howard_Ho|Relationship between DTFT and z-transform]] | |
| − | + | *[[DTFT_Window_Function|Graph of DTFT of window function]] | |
| − | + | ||
| − | + | ||
Click [[:Category:discrete-time Fourier transform|here]] to view all pages in the [[:Category:discrete-time Fourier transform|"discrete-time Fourier transform" cateory]] | Click [[:Category:discrete-time Fourier transform|here]] to view all pages in the [[:Category:discrete-time Fourier transform|"discrete-time Fourier transform" cateory]] | ||
---- | ---- | ||
[[Table_DT_Fourier_Transforms|Back to table of discrete-time Fourier transform pairs and properties]] | [[Table_DT_Fourier_Transforms|Back to table of discrete-time Fourier transform pairs and properties]] | ||
Latest revision as of 14:47, 1 May 2015
Contents
About the Discrete-time Fourier transform (DTFT)
$ \,\mathcal{X}(\omega)=\mathcal{F}(x[n])=\sum_{n=-\infty}^{\infty}x[n]e^{-j\omega n}\, $
Practice Problems
- What is the Fourier transform of this DT cosine?
- What is the Fourier transform of this DT rect function?
- Compute the DT Fourier transform of a sinc
- Compute the DT Fourier transform of a rect
- Compute the Fourier transform of 3^n u[-n]
- Compute the Fourier transform of u[n+1]-u[n-2]
Slectures on DTFT
- Definition+properties of Discrete-time Fourier transform (DTFT)
- Text slecture by Jacob Holtman
- Text slecture by Fabian Faes
- Text slecture by Xian Zhang
- Discrete-time Fourier transform (DTFT) of a sampled cosine
- Text slecture by Andrew Pawling
- Text slecture by Sutton Hathorn
- Text slecture by Sahil Sanghani
- Text slecture by Yijun Han
- Table of discrete-time Fourier transform pairs and properties
- Relationship between DTFT and z-transform
- Graph of DTFT of window function
Click here to view all pages in the "discrete-time Fourier transform" cateory
Back to table of discrete-time Fourier transform pairs and properties
