Revision as of 17:20, 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 $

Alumni Liaison

Recent Math PhD now doing a post-doctorate at UC Riverside.

Kuei-Nuan Lin