About the Discrete-time Fourier transform (DTFT)

$ \,\mathcal{X}(\omega)=\mathcal{F}(x[n])=\sum_{n=-\infty}^{\infty}x[n]e^{-j\omega n}\, $

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

Other pages related to the DTFT

• Table of discrete-time Fourier transform pairs and properties
• Relationship between DTFT and z-transform
• Practice problem on computing DTFT of a rect
• Practice problem on computing DTFT of a sinc
• Graph of DTFT of window function
• To be continued

Click here to view all pages in the "discrete-time Fourier transform" cateory

Back to table of discrete-time Fourier transform pairs and properties