Scribd
Upload
29 views17 pages

FFT Notes (Divide&Conquer - DIT FFT)

FFT notes on dsp

Uploaded by

PRO Gamer
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
29 views17 pages

FFT Notes (Divide&Conquer - DIT FFT)

FFT notes on dsp

Uploaded by

PRO Gamer
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 17

FFT

UNIT-IV (Fast Fourier Transform)

1.1 Fast Fourier transforms (FFT) algorithms, Divide-and-conquer approach to Computation of


the DFT, Radix-2 FFT algorithms.
Direct computation of the DFT

DFT formulation

The IDFT formulation

▪ Direct computation of the DFT is inefficient, primarily because it does not exploit
the symmetry and periodicity of the phase factor WN
Properties
Divide-and-Conquer Approach

▪ Decomposition of an N-point DFT into successively smaller DFTs


N = LM

4
Mapping function
▪ We now can use either of two mappings from 2-D indices l, m to the actual time index n:
Input mapping
➢ Row-wise mapping ➢ Column-wise mapping

Output mapping
▪ We now can use either of two mappings from 2-D indices p, q to the actual DFT result index k:

➢ Row-wise mapping ➢ Column-wise mapping


Divide-and-Conquer Approach
Divide-and-Conquer Approach

For example, suppose that N=1000 and we


select L=2 and M=500

• Direct computation: 10^6


• Divide-and-Conquer: 50300
Example
➢Fast-Fourier-Transform (FFT) algorithms

Decimation-in-Time FFT
Method of Decimation-in-Time FFT
➢ X(k) can be obtained from F1(k) and F2(k).
where F1(k) and F2(k) are two 4-point DFTs.

➢ The 8-point DFT can be found by combining


two 4-point DFTs, F1(k) and F2(k). The
sequences f1(m) and f2(m) are

Fig. The first iteration

➢ The process of decimation in time is repeated for the sequences f1(n) and f2(n). This is done by
splitting the sequences into odd and even numbered sequences for f1(n) as
➢ Similarly splitting is done into odd and even numbered sequences for f2(n) as
▪ v11(n), v12(n), v21(n) and v22(n) are four N/4
point samples.

➢ Determine the N/4 point DFT to obtain F1(k), ➢ Similarly, Determine the N/4 point DFT to obtain
based on the N/2 point DFT F2(k), based on the N/2 point DFT

Fig. The Second iteration


➢ The decimation of the data sequence is repeated again and again until the sequences reduce to the one-point
sequence
The two-point DFT for V11(k) is expressed as

Similarly, V12(k), V21(k), and V22(k) are calculated, Fig. The Third iteration

• DIT FFT
structure with
input bit-
reversed, output
natural

Fig. The eight-point FFT algorithm using decimation-in-time


Butterfly Structure : Decimation-in-Time

➢ Flow graph of simplified


butterfly computation
requiring only one complex
multiplication and two
additions.

Flow graph of 4-point DIT FFT algorithm


Flow graph of 8-point DIT FFT algorithm using the using the butterfly
butterfly (N=8)
Problems

1. Given x(n)=[1,2,3,4], find X[k] using DIT FFT algorithm?

2. Given x(n)=[0,1,2,3,4,5,6,7], find X[k] using DIT FFT algorithm?

N=8
References

1. G. Proakis and D. G. Manolakis, Digital Signal Processing: Principles Algorithms and


Applications, Prentice Hall, 4th Ed.

2. A. V. Oppenheim, R. W. Schafer and J. R. Buck, Discrete-Time Signal Processing,


Pearson Prentice Hall, 2nd Ed.

3. S. K. Mitra, Digital Signal Processing, Tata McGraw Hill, 3rd Ed.

4. Li Tan, Digital Signal Processing, Fundamentals and Applications, Academic Press,


Elsevier, 2008.

17

You might also like