Fft ppt
Download as PPT, PDF11 likes14,424 views
The document discusses the Fast Fourier Transform (FFT) algorithm. 1) The FFT is a set of techniques that exploits symmetries in the Discrete Fourier Transform (DFT) to make its computation much faster. The speedup increases with larger DFT sizes. 2) The Cooley-Tukey algorithm decomposes an N-point DFT into smaller DFTs by splitting the indices, resulting in an algorithm that is proportional to NlogN operations rather than N^2. 3) The algorithm can be represented as a series of "butterfly" operations, with each butterfly requiring only 2 multiplications. This reduces the number of multiplications needed compared to direct computation of the DFT.
![The Cooley-Tukey decimation-in-time algorithm Splitting indices in time , we have obtained But and So N/2 -point DFT of x[2r] N/2 -point DFT of x[2r+1]](https://image.slidesharecdn.com/fftppt-110603180956-phpapp01/85/Fft-ppt-6-320.jpg)
Fft ppt
- 1. The Fast Fourier Transform Title
- 2. Introduction What is the FFT? - A collection of “tricks” that exploit the symmetryof the DFT calculation to make its execution muchfaster . - Speedup increases with DFT size.
- 3. Computational Cost of Discrete-Time Filtering Convolution of an N -point input with an M -point unit sample response . - Direct convolution: Number of multiplies ≈ MN - Using transforms directly : Computation of N-point DFTs requires N^2 multiplies. Each convolution requires three DFTs of length N+M-1 plus an additional N+M-1 complex multiplies or For , for example, the computation is O(N^2)
- 4. Computational Cost of Discrete-Time Filtering Convolution of an N -point input with an M -point unit sample response . - Using overlap-add with sections of length L : N/L sections, 2 DFTs per section of size L+M-1, plus additional multiplies for the DFT coefficients, plus one more DFT for - For very large N , still is proportional to
- 5. The Cooley-Tukey decimation-in-time algorithm Consider the DFT algorithm for an integer power of 2, Create separate sums for even and odd values of n: Letting for n even and for n odd, we obtain
- 6. The Cooley-Tukey decimation-in-time algorithm Splitting indices in time , we have obtained But and So N/2 -point DFT of x[2r] N/2 -point DFT of x[2r+1]
- 7. Signal flowgraph representation of 8- point DFT Recall that the DFT is now of the form The DFT in (partial) flowgraph notation:
- 8. Continuing with the decomposition … So why not break up into additional DFTs? Let’s take the upper 4-point DFT and break it up into two 2-point DFTs:
- 9. The complete decomposition into 2-point DFTs
- 10. Closer look at the 2-point DFT The expression for the 2-point DFT is: Evaluating for we obtain which in signal flow graph notation looks like … This topology is referred as the BASIC BUTTERFLY
- 11. The complete 8-point decimation-in-time FFT
- 12. Number of multiplys for N-point FFTs Let (log 2 ( N ) columns)( N/2 butterflies/column)(2 mults/butterfly) or multiplies
- 13. CONCLUSION Use of the FFT algorithm reduces the number of multiplys required to perform the DFT by a factor of more than 100 for 1024-point DFTs, with the advantage increasing with increasing DFT size.