View source for Discrete Fourier Transform - Rhea

[[Category:discrete Fourier transform]]
= Discrete Fourier Transform =

Definition: let x[n] be a discrete-time signal with Period N. Then the Discrete Fourier Transform X[k] of x[n] is the discrete-time signal defined by
 
<math> X [k] = \sum_{k=0}^{N-1} x[n].e^{-J.2pi.kn/N}.</math>

Conversely, the Inverse Discrete Fourier transform is 

<math> x [n] = (1/N) \sum_{k=0}^{N-1} X[k].e^{J.2pi.kn/N}</math>
----
Some pages discussing or using Discrete Fourier Transform
*[[Student_summary_Discrete_Fourier_transform_ECE438F09|A summary page about the DFT written by a student]] from [[ECE438]]
*[[Notes_on_Discrete_Fourier_Transform|Course notes on DFT]]
*[[Exercise_effect_of_zero_padding_on_DFT_ECE438F11|What is the effect of zero padding a signal on its DFT?]]
*[[Practice_question_1_eECE439F10|Practice Question on DFT computation]] from [[ECE438]]
*[[Compute DFT practice no1 ECE438F11|Practice Question on DFT computation]] from [[ECE438]]
*[[Compute DFT practice no2 ECE438F11|Practice Question on DFT computation]] from [[ECE438]]
*[[Discrete_Fourier_Transform_table|Table of DFT pairs and properties]] from [[Collective_Table_of_Formulas|Collective Table of Formulas]]
Click [[:Category:discrete Fourier transform|here]] to view all the pages in the [[:Category:discrete Fourier transform|discrete Fourier transform]] category.