查看单个帖子
旧 2008-05-08, 12:39   #3
hzxsyzl943
普通会员
 
注册日期: 2008-04-28
年龄: 35
帖子: 63
声望力: 19
hzxsyzl943 正向着好的方向发展
默认

N
X(k) = sum x(n)*exp(-j*2*pi*(k-1)*(n-1)/N), 1 <= k <= N.
n=1


The inverse DFT (computed by IFFT) is given by



N
x(n) = (1/N) sum X(k)*exp( j*2*pi*(k-1)*(n-1)/N), 1 <= n <= N.
k=1
hzxsyzl943 当前离线   回复时引用此帖