数字信号处理a（双语）chapter 11-discrete fourier transform computationnew-140325教学材料.pptVIP

Chapter 11 DSP Algorithm Implementation 11.3 Computation of the DFT §11.3.2 Cooley-Tukey FFT Algorithms Ways to decrease the complexity: Using the properties of the Decompose the long sequence into shorten sequence to compute DFT Combine the some item of DFT computation. Decimation in time Decimation in frequency §11.3.2 Cooley-Tukey FFT Algorithms Radix-2 algorithm with decimation in time-DIT FFT 1. Principle of algorithm Suppose: x(n) length N=2L split x(n) into two parts even-index odd-index 2n 2n+1 §11.3.2 Cooley-Tukey FFT Algorithms N/2 points DFT N/2 points DFT Decompose length-