Line 18: Line 18:
 
-----
 
-----
 
==Other pages related to the DTFT==
 
==Other pages related to the DTFT==
*[[Table_DT_Fourier_Transforms|Collective table of discrete-time Fourier transform pairs and properties]]
+
*[[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]]
 
*[[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]]
 
*[[Practice_DTFT_computation_cosine_ECE438F11|Practice problem on computing DTFT of a sinc]]
 
*[[Practice_DTFT_computation_cosine_ECE438F11|Practice problem on computing DTFT of a sinc]]

Revision as of 13:42, 1 May 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

Ph.D. 2007, working on developing cool imaging technologies for digital cameras, camera phones, and video surveillance cameras.

Buyue Zhang