1 / 11

Fast Fourier Transform (FFT)

Fast Fourier Transform (FFT) Problem : we need an efficient way to compute the DFT. The answer is the FFT. Consider a data sequence and its DFT:.

Download Presentation

Fast Fourier Transform (FFT)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Fast Fourier Transform (FFT) Problem: we need an efficient way to compute the DFT. The answer is the FFT. Consider a data sequence and its DFT: We can always break the summation into two summations: one on even indices (n=0,2,4,…) and one on odd indeces (n=1,3,5,…), as

  2. Let us assume that the total number of points N is even, ie N/2 is an integer. Then we can write the DFT as since

  3. N-point DFT N/2-point DFT N/2-point DFT The two summations are two distinct DFT’s, as we can see below for k=0,…N-1, where

  4. The problem is that in the expression the N-point DFT and the N/2 point DFT’s have different lengths, since we define them as For example if N=4 we need to compute from two 2-point DFT’s So how do we compute and ?

  5. We use the periodicity of the DFT, and relate the N-point DFT with the two N/2-point DFT’s as follows • where we used the facts that • the DFT is periodic and in particular

  6. General Structure of the FFT (take, say, N=8): 4-DFT 4-DFT where is called the butterfly.

  7. 2-DFT 2-DFT 2-DFT 2-DFT Same for the 4-DFT: 4-DFT 4-DFT

  8. Finally the 2-DFT’s have a simple expansion: 2-DFT since with

  9. Put everything together: mult N/2 mult/stage N adds/stage adds

  10. We say that, for a data set of length , complexity of the FFT is for some constants a,b. On the other hand, for the same data of length N , complexity of the DFT is Since, from the formula, N ops/term N terms N ops

  11. DFT FFT This is a big difference in the total number of computations, as shown in this graph: complexity N

More Related