1 DFT基本原理与计算方法
FFT(快速傅里叶变换)是DFT(离散傅里叶变换)的一种算法,下文中均以DFT的原理进行说明。
1.1 基本原理
正反变换的DFT公式如下:
F ( m ) = D F T { f ( k ) } = ∑ k = 0 N − 1 f ( k ) W N m k ( m = 0 , 1 , . . . , N − 1 ) F(m) = DFT\left\{ {f(k)} \right\} = \sum\limits_{k = 0}^{N - 1} {f(k)W_N^{mk}} \;\;\;\;(m = 0,1,...,N - 1) F(m)=DFT{ f(k)}=k=0∑N−1f(k)WNmk(m=0,1,...,N−1)
f ( k ) = I D F T { F ( m ) } = 1 N ∑ m = 0 N − 1 F ( m ) W N − m k ( k = 0 , 1 , . . . , N − 1 ) f(k) = IDFT\left\{ {F(m)} \right\} = \frac{1}{N}\sum\limits_{m = 0}^{N - 1} {F(m)W_N^{ - mk}} \;\;\;\;(k = 0,1,...,N - 1) f(k)=IDFT{ F(m)}=N1