Line 4: Line 4:
  
 
=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>
*Some relevant Rhea pages related to the DTFT
+
----
 +
==Slectures on DTFT==
 +
*Definition+properties of Discrete-time Fourier transform (DTFT)
 +
**[[Discrete-time Fourier transform (DTFT) Slecture by Jacob Holtman|Text slecture]] by Jacob Holtman
 +
**[[Discrete-time Fourier transform Slecture by Fabian Faes|Text slecture]] by Fabian Faes 
 +
**[[Discrete-time Fourier transform Xian Zhang ECE438 slecture|Text slecture]] by Xian Zhang 
 +
* Discrete-time Fourier transform (DTFT) of a sampled cosine
 +
**[[DTFTCosinePawling|Text slecture]] by Andrew Pawling 
 +
**[[Dtft sampling slecture srh|Text slecture]] by Sutton Hathorn
 +
**[[Text Slecture|Text slecture]] by Sahil Sanghani
 +
**[[DTFT of a sampled cosine Yijun ECE438 slecture|Text slecture]] by Yijun Han
 +
-----
 +
==Other pages related to the DTFT==
 
**[[Table_DT_Fourier_Transforms|Collective table of discrete-time Fourier transform pairs and properties]]
 
**[[Table_DT_Fourier_Transforms|Collective table of discrete-time Fourier transform pairs and properties]]
 
**[[Practice_DTFT_computation_rect_ECE438F11|Practice problem on computing DTFT of a rect]]
 
**[[Practice_DTFT_computation_rect_ECE438F11|Practice problem on computing DTFT of a rect]]

Revision as of 18:59, 16 March 2015


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


Other pages related to the DTFT

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


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

Alumni Liaison

Followed her dream after having raised her family.

Ruth Enoch, PhD Mathematics