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

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


DFT ( Discrete Fourier Transform )

Definition

  • DFT $ X(k) = \sum{x(n)*exp(-j2pikn/N) dn } k = 0, 1, 2, ..., N-1 $
  • Inverse DFT (IDFT) $ x[n] = (1/N)\sum{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=34477"
Shortcuts
Help Main Wiki Page Random Page Special Pages Log in
Search

Alumni Liaison

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

Buyue Zhang