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]]
 
----
 
----
 
==Slectures on DTFT==
 
==Slectures on DTFT==
Line 20: Line 26:
 
*[[Table_DT_Fourier_Transforms|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]]
 
*[[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_cosine_ECE438F11|Practice problem on computing DTFT of a sinc]]
 
 
*[[DTFT_Window_Function|Graph of DTFT of window function]]
 
*[[DTFT_Window_Function|Graph of DTFT of window function]]
*To be continued
+
 
  
 
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]]

Revision as of 13:45, 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}\, $


Practice Problems


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

Questions/answers with a recent ECE grad

Ryne Rayburn