离散时间信号处理英文版）chap9-第1讲.ppt

Main contents 9.0 Introduction Comparison of the computation of DFT and DIT-FFT Ch9. Computation of the Discrete Fourier Transform Decimation-In-Time FFT algorithm (DIT-FFT) Decimation-In-Frequency FFT algorithm (DIF-FFT) IFFT The Fast Fourier Transform (FFT) is not a new algorithm which is different from the DFT, but an efficient algorithm for fast computation of the DFT. 9.1 Efficient Computation of the DFT The direct computation of DFT N N-point DFT one X[k] Real Add Real Mul Complex Add Complex Mul N-1 N(N-1) 4N 2N+2(N-1) = 4N-2 e.g. N : Complex Mul : 8 1024 64 1048