数字信号处理十一.ppt

§11.1.2 Cooley-Tukey FFT Algorithms Alternative form of radix-2 DIT and DIF follow the feature of the flow graph, we can obtain some alternative form DIT-FFT N=8 for example §11.1.2 Cooley-Tukey FFT Algorithms §11.1.2 Cooley-Tukey FFT Algorithms §11.1.3 Inverse DFT Computation differences are: §11.1.3 Inverse DFT Computation for example N=4, DIF-FFT WNr→WN-r , x→X, ×1/2 each level §11.1.3 Inverse DFT Computation In practice FFT that is: homework 11.6,11.7 Chapter 11DFT Algorithm Implementation 11.1 Computation of the Discrete Fourier Transform Chapter 11 DFT Algorithm Implementation §11.1 Computation of the Discrete Fourier Transform In order to compute the DFT or IDFT of a length-N sequence, one needs N2 complex multiplications N(N-1) complex additions §11.1 Computation of the Discrete Fourier Transform The complexity of the DFT grows with the square of the signal length. It requests a fast algorithm urgently. This severely limits its practical use for lengthy signals. for example: N=8 needs 64 complex multiplications. N=1024 needs 1,048,576 complex multiplications. In 1965, Cooley and Tukey proposed an efficient algorithm to compute the DFT, that is DIT-FFT. §11.1.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.1.2 Cooley-Tukey FFT Algorithms Radix-2 algorithm with decimation in time-DIT FFT 1. Principle of algorithm Soppose: x(n) length N=2L split x(n) into two parts even-index odd-index 2n 2n+1 §11.1.2 Cooley-Tukey FFT Algorithms N/2 points DFT N/2 points DFT Decompose length-N DFT into two length-N/2 DFT However, we only compute the N/2 points of length-N DFT at beginning, and remind other N/2 points. §11.1.2 Cooley-Tukey FFT Algorithms Now, we obtain the remind N/2 points of length-N DFT. §11.1.2 Cooley-Tukey FFT Algorithm