桂电数字信号讲义2.ppt

* Chapter 11 DFT Algorithm Implementation In order to compute the DFT or IDFT of a length-N sequence, one needs N2 complex multiplications N(N-1) complex additions 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. Ways to decrease the complexity: Using the properties of the WNnk Decompose the long sequence into shorten sequence to compute DFT Combine the some item of DFT computation. §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. DIT FFT Now, we obtain the remind N/2 points of length-N DFT. DIT FFT called basic cell of the algorithm, and its signal flow graph is also called a butterfly DIT FFT for example N=8=23 DIT FFT each butterfly needs one complex multiplication two complex additions so,after one decomposed 2 N/2 points DFT N/2 butterflies its number of computation is almost half of dircet DFT. DIT FFT Now, xe(n) and xo(n) is length N/2 sequences, and N/2 also even then they can be splited into even-index and odd-index parts furthermore DIT FFT then, like the first decomposing and DIT FFT as the example above N=8=23, and after second decomposing here WN, different from WN/2 in teaching book DIT FFT Resembly, we can decompose it to length-2 DFT at last expressed as DIT FFT as the example above N=8=23, at last DIT FFT 2. Number of computation from the signal flow graph of DIT-