Discrete Fourier Transform(DFT)

1
Faculty of Engineering & Technology © Ramaiah University of Applied Sciences
 Lecture 8
FFT - Radix-2 Decimation In Frequency
Lecture delivered by:
Vasanthavalli.S

2
Faculty of Engineering & Technology © Ramaiah University of Applied Sciences
 Topics

• Decimation in Frequency FFT Algorithm

• Comparison of DIT and DIF Radix-2 FFT
• Inverse Fast Fourier Transform

3
Faculty of Engineering & Technology © Ramaiah University of Applied Sciences
 Objectives

At the end of this lecture, student will be able to:

• Explain FFT algorithm of radix-2 DIF

• Compute N point DFT by radix-2DIF-FFT
• Explain the differences between DIT andDIF
• Compute N point IDFT by radix-2-FFT

4
Faculty of Engineering & Technology © Ramaiah University of Applied Sciences
 DIF is the Transpose of DIT

DIT FFT Structure DIF FFT Structure

5
Faculty of Engineering & Technology © Ramaiah University of Applied Sciences
 Radix -2 DIF FFT Algorithm for N=8

• Input sequence is N point sequences N=8=23

• Radix(r)=2; no of stages=3

6
Faculty of Engineering & Technology © Ramaiah University of Applied Sciences
 Butterfly Computation in DIF
• Consider N point DFT(to be splitted into smaller number of DFTs in
frequency
N 1
domain)
Xk    x[n]e  j2  / N kn

n0
N 2𝜋 2𝜋
−1 −𝑗 𝑘𝑛 N−1 −𝑗 𝑁 𝑘𝑛
• X[k]= 2
n=0 x[n] 𝑒 𝑁 + n=𝑁/2 x[n] 𝑒
𝑁
𝑘( )
N 2𝜋 N 2𝜋 𝑁 WN 2 =
−1 −𝑗 𝑘𝑛 −1 −𝑗 𝑘(𝑛+ )
• X[k]= 2
n=0 x[n] 𝑒
𝑁 + 2
n=0 x[n + N/2] 𝑒 𝑁 2
𝑒
2𝜋
−𝑗 2𝑁 𝑘𝑁
=
N N 𝑁 (-1)k
−1 kn −1 𝑘(𝑛+ 2 )
• X[k]= 2
n=0 x[n] WN +
2
n=0 x[n + N/2] WN
N N
−1 kn −1 𝑘𝑛
• X[k]= 2
n=0 x[n] WN +(-1) k 2
n=0 x[n + N/2] WN
N
−1
• X[k]= 2
n=0 x[n]+(-1)k x[n + N/2] WN𝑘𝑛

7
Faculty of Engineering & Technology © Ramaiah University of Applied Sciences
 Butterfly Computation in DIF

• Only consider k (why ? splitting in frequency domain)

• X[k]= x[n]+(-1)k x[n + N/2] WN𝑘
• Consider N=2 and k=0,1
• X[k]= x[0]+(-1)k x[1] WN𝑘
• Consider 2 points a and b
• X[0]=a+b
• X[1]=(a-b) WN1
• The general equation is given as

X[0]=a+b
X[1]=(a-b) WNk
8
Faculty of Engineering & Technology © Ramaiah University of Applied Sciences
 Butterfly Computation in DIF

9
Faculty of Engineering & Technology © Ramaiah University of Applied Sciences
 Butterfly Diagram for First Stage Computation

• First stage

10
Faculty of Engineering & Technology © Ramaiah University of Applied Sciences
 Butterfly Diagram for Second Stage Computation

• Second stage

11
Faculty of Engineering & Technology © Ramaiah University of Applied Sciences
 Butterfly Diagram for Third Stage Computation

• Third stage(output is bit reversed)

12
Faculty of Engineering & Technology © Ramaiah University of Applied Sciences
 The Combined Butterfly Diagram of All Three Stages

13
Faculty of Engineering & Technology © Ramaiah University of Applied Sciences
 Comparison of DIT and DIF Radix-2 FFT

DIT DIF

BIT REVERSAL ORDER Input Output

DECIMATION Time domain sequence Frequency domain sequence

BASIC BUTTERFLY Complex multiplication takes Complex multiplication takes

place before add-subtract place after add-subtract
operation operation

14
Faculty of Engineering & Technology © Ramaiah University of Applied Sciences
 Similarities in DIT and DIF

• N=2m ,there will be m stages of butterfly computation with N/2

butterfly per stage
• The total number of complex additions are Nlog2N
• The total number of complex multiplications are N/2log2N
• Both algorithms require bit reversal at some place

15
Faculty of Engineering & Technology © Ramaiah University of Applied Sciences
 Computation of Inverse DFT using FFT

• The following procedure can be followed to compute inverse DFT using

FFT algorithm
– Take N point frequency domain sequence X(K) as input sequence
– Compute FFT by using conjugate of phase factors
– Divide the output sequence obtained in FFT computation by N , to get
the sequence of x(n)

16
Faculty of Engineering & Technology © Ramaiah University of Applied Sciences
 Example:1
• An 8 point sequence is given by x(n)={12,1,2,1,1,2,1,2}.Compute 8
point DFT of x(n) by radix-2 DIF FFT.

17
Faculty of Engineering & Technology © Ramaiah University of Applied Sciences
 Example:1 cont’d

18
Faculty of Engineering & Technology © Ramaiah University of Applied Sciences
 Example:1 cont’d

19
Faculty of Engineering & Technology © Ramaiah University of Applied Sciences
 Example:1 cont’d

20
Faculty of Engineering & Technology © Ramaiah University of Applied Sciences
 Example:1 cont’d

21
Faculty of Engineering & Technology © Ramaiah University of Applied Sciences
 Summary
• In direct computation of N point DFT via radix -2 FFT, the total number of
complex additions are Nlog2N and total number of complex
multiplications are(N/2)log2N
• In DIF the frequency domain sequence is decimated and smaller point
DFTs are performed
N
• In radix-2 FFT,
butterflies per stage are required to represent the
2
computational process
• In radix-2 DIF FFT , the output should be bit reversed order and the input
will be in normal order
• In butterfly computation of DIF , the multiplication of phase factor takes
place after the add-subtract operation

22
Faculty of Engineering & Technology © Ramaiah University of Applied Sciences
 Summary cont’d

• DIF is the transpose of DIT

• Inverse FFT is same as FFT except inputs are X(K),phase factors are
made negative and outputs are divided by N

23
Faculty of Engineering & Technology © Ramaiah University of Applied Sciences