Revision as of 16:57, 18 September 2009 by Kmhacker (Talk | contribs)


DFT ( Discrete Fourier Transform )

Definition

DFT

  • $ X(k) = \sum_{n=0}^{N-1}{x[n]e^{-j2{\pi}kn/N}} k = 0, 1, 2, ..., N-1 $

Inverse DFT (IDFT)

  • $ x[n] = \frac{1}{N}\sum_{k=0}^{N-1}{X(k)e^{j2{\pi}kn/N}} n = 0, 1, 2, ..., N-1 $

Back to ECE438 course page

Retrieved from "https://www.projectrhea.org/rhea/index.php?title=Student_summary_Discrete_Fourier_transform_ECE438F09&oldid=34483"
Shortcuts
Help Main Wiki Page Random Page Special Pages Log in
Search

Alumni Liaison

BSEE 2004, current Ph.D. student researching signal and image processing.

Landis Huffman