Chapter 19 Fast Fourier Transform TI C5000官方课件.pptVIP

Copyright ? 2003 Texas Instruments. All rights reserved. DSP C5000 Chapter 19 Fast Fourier Transform Discrete Fourier Transform Allows us to compute an approximation of the Fourier Transform on a discrete set of frequencies from a discrete set of time samples. Where k are the index of the discrete frequencies and n the index of the time samples Inverse Discrete Fourier Transform The inverse formula is: Where, again, k are the index of the discrete frequencies and n the index of the time samples. We have the following properties: Discrete time periodic spectra Periodic time discrete spectra DFT Computation We can write the DFT: We need: N(N-1) complex ‘+’ N2 complex ‘×’ Fast Fourier Transform 1 of 3 Cooley-Tukey algorithm: Based on decimation, leads to a factorization of computations. Let us first look at the classical radix 2 decimation in time. This particular case of the algorithm requires the time sequence length to be a power of 2. First we split the computation between odd and even samples: Fast Fourier Transform 2 of 3 Using the following property: The DFT can be rewritten: For k=0, 1, …, N-1 Fast Fourier Transform 3 of 3 Using the property that: The entire DFT can be computed with only k=0, 1, …,N/2-1. and Butterfly This leads to basic building block of the FFT, the butterfly. Recursion If N/2 is even, we can further split the computation of each DFT of size N/2 into two computations of half size DFT. When N=2r this can be done until DFT of size 2 (i.e. butterfly with two elements). Number of Operations If N=2r, we have r=log2(N) stages. For each one we have: N/2 complex ‘×’ (some of them are by ‘1’). N complex ‘+’. Thus the grand total of operations is: N/2 log2(N) complex ‘×’. N log2(N) complex ‘+’. Shuffling the Data, Bit Reverse Ordering At each step of the algorithm, data are split between even and odd values. This results in scrambling the order. Reverse Carry Propagation This scrambling when we use ra