1 / 8

100 likes | 1.15k Views

Introduction to Fast Fourier Transform (FFT) Algorithms. R.C. Maher ECEN4002/5002 DSP Laboratory Spring 2003. Discrete Fourier Transform (DFT). The DFT provides uniformly spaced samples of the Discrete-Time Fourier Transform (DTFT) DFT definition:

Download Presentation
## Introduction to Fast Fourier Transform (FFT) Algorithms

**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

**Introduction toFast Fourier Transform (FFT)Algorithms**R.C. Maher ECEN4002/5002 DSP Laboratory Spring 2003**Discrete Fourier Transform (DFT)**• The DFT provides uniformly spaced samples of the Discrete-Time Fourier Transform (DTFT) • DFT definition: • Requires N2 complex multiplies and N(N-1) complex additions FFT Intro R. C. Maher**Faster DFT computation?**• Take advantage of the symmetry and periodicity of the complex exponential (let WN=e-j2p/N) • symmetry: • periodicity: • Note that two length N/2 DFTs take less computation than one length N DFT: 2(N/2)2<N2 • Algorithms that exploit computational savings are collectively called Fast Fourier Transforms FFT Intro R. C. Maher**Decimation-in-Time Algorithm**• Consider expressing DFT with even and odd input samples: FFT Intro R. C. Maher**DIT Algorithm (cont.)**• Result is the sum of two N/2 length DFTs • Then repeat decomposition of N/2 to N/4 DFTs, etc. N/2 DFT x[0,2,4,6] X[0…7] N/2 DFT x[1,3,5,7] FFT Intro R. C. Maher**Detail of “Butterfly”**• Cross feed of G[k] and H[k] in flow diagram is called a “butterfly”, due to shape or simplify: -1 FFT Intro R. C. Maher**8-point DFT Diagram**x[0,4,2,6,1,5,3,7] X[0…7] FFT Intro R. C. Maher**Computation on DSP**• Input and Output data • Real data in X memory • Imaginary data in Y memory • Coefficients (“twiddle” factors) • cos (real) values in X memory • sin (imag) values in Y memory • Inverse computed with exponent sign change and 1/N scaling FFT Intro R. C. Maher

More Related