Revision as of 11:31, 27 October 2010 by Hirawan (Talk | contribs)

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

Discrete Fourier Transform (DFT)


Definition of DFT

DFT

$ X[k] = \sum_{n=0}^{N-1}{x[n]e^{-j \frac{2{\pi}}{N}kn}}, for \mbox{ }k = 0, 1, 2, 3, ..., N-1 $

IDFT

$ x[n] = \frac{1}{N}\sum_{k=0}^{N-1}{X(k)e^{j \frac{2{\pi}}{N}kn}}, for \mbox{ }n = 0, 1, 2, 3, ..., N-1 $


Alumni Liaison

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

Buyue Zhang