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


DFT ( Discrete Fourier Transform )

Definition

DFT

  • $ X(k) = \sum^N-1_n=0{x(n)exp(-j2pikn/N) dn } k = 0, 1, 2, ..., N-1 $

Inverse DFT (IDFT)

  • $ x[n] = (1/N)\sum^N-1_k=0{X(k)exp(j2pikn/N) dk } n = 0, 1, 2, ..., N-1 $
Retrieved from "https://www.projectrhea.org/rhea/index.php?title=Student_summary_Discrete_Fourier_transform_ECE438F09&oldid=34479"
Shortcuts
Help Main Wiki Page Random Page Special Pages Log in
Search

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood