1

LOGO

Fast Fourier Transform

(FFT)

iugaza2010.blogspot.com
melasmer@gmail.com

Fast Fourier Transform (FFT)

-The Fast Fourier Transform (FFT) is a very efficient algorithm for

performing a discrete Fourier transform.

-The most widely used methods of FFT are based on decomposing or

breaking the transform into smaller transforms, and combining them to give
the total transform.

-There are two methods to do this decomposition or decimation:

(1) Decimation In Frequency domain

(2) Decimation In Time domain

FFT

DFT

log 2 (N )
stages
complex multiplications
complex additions

N
log 2 (N )
2
N *log 2 (N )

N2
N2 N

DFT
N 1

X (k ) x (n )W N

kn

, k=0,1,2,.......,N 1

n 0

where : W N e

2
N

4
7

(1) Decimation in Time domain

Decimation in Time domain

Example

x(n)={ 1,2,3,4} find DFT for first 4-points

0 1

3
flip

0
1
2
3

00
01
10
11

W4 e

00
10
01
11
2
N

0
2
1
3
j

2
4

x(0)=1

x(2)=3
x(1)=2
x(3)=4

j
9

x(0)=1

x(2)=3

W40 1

-2
-1

x(1)=2
x(3)=4

X(0 )= 10

W40 1

-2
-1

X(1)= -2+2j
W40 1

-1

W41 j

-1

X(2)= -2
X(3)= -2-2j

Stage#1

Stage#2

x(0)=1

x(2)=3

-2

W 40

10

-2+2j

-2

x(1)=2

W 40 1

-2-2j

-2

x(3)=4
W 40

W 41 j

X(k)={10,-2+2j,-2,-2-2j}

W increment

N
2

#of stage
11

W increment

N
2

#of stage

4
2

for stage#2 W increment

#of stage

4
2 1
2

12

Decimation in Time domain

Example

x(n)={ 1,1,3,5,0,0,1,3} find DFT for first 8-points

0

000 000

001 100

W8 e

2
8

(1 j )
2

W8 1
0

010 010

011 110

100 001

101 101

110 011

111 111

1
W
(1 j )
2
W 82 j
1
8

W8

(1 j )
2

13

Stage#1
x(0)=1
x(4)=0

W 80

1-2j

X[1]=0.3-j4.12

-3

X[2]=-3+j7

1+2j

X[3]=1.7-j0.12

0
8

-1

W 82

x(1)=1

x(5)=0

-1
9
0
8

W
W

0
8

-1

W 80
W 80

1
8

-1

2
8

W82

-1
X[6]=-3-j7

-1

X[7]=0.3+j4.12

1+2j

-1

W83

X[4]=-4

X[5]=1.7+j0.12

-7

-1

-1

1-2j

W
8

x(3)=5

x(7)=3

X[0]=14

-1

W 80

Stage#3

-1

x(2)=3
x(6)=1

Stage#2

-1

X(k)={14,0.3-j4.12,-3+j7,1.7-j0.121,-4,1.7+j0.121
,-3-j7,0.3+j4.12}
14

Stage#1
x(0)=1
x(4)=0

W 80

1-2j

X[1]=0.3-j4.12

-3

X[2]=-3+j7

1+2j

X[3]=1.7-j0.12

0
8

-1

W 82

x(1)=1

x(5)=0

-1
9
0
8

W
W

0
8

-1

W 80
W 80

1
8

-1

2
8

W82

-1
X[6]=-3-j7

-1

X[7]=0.3+j4.12

1+2j

-1

W83

X[4]=-4

X[5]=1.7+j0.12

-7

-1

-1

1-2j

W
8

x(3)=5

x(7)=3

X[0]=7

-1

W 80

Stage#3

-1

x(2)=3
x(6)=1

Stage#2

-1

X(k)={14,0.3-j4.12,-3+j7,1.7-j0.121,-4,1.7+j0.121
,-3-j7,0.3+j4.12}
15

W increment

N
2

#of stage

8
2

for stage#2 W increment

for stage#3 W increment

#of stage

8
2 2
2
8
3 1
2
16

IDFT :
Decimation in Time domain
~

2
j
N

(1) W N e
(2) divided final result by N
17

Decimation in Time domain

Example

X(k)={ 1,1+j2,1,1-j2} find x(n) IDFT for 4-points

00
01
10
11

0
1
2
3
~

00
10
01
11
2
N

0
2
1
3
2
4

j
18

Stage#1

Stage#2
2

X(0)=1

X(2)=1
W

-4

X(1)=1+j2

j4

X(3)=1-2j
0

1
~

1
4

Divided by N=4 x(n)={1,-1,0,1}

19

(2) Decimation in Frequency domain

20

Decimation in Frequency domain

Example

find DFT for first 4-points

0 1

0
1
2
3

00
01
10
11

W4 e

00
10
01
11
j

2
N

0
2
1
3
j

2
4

j
21

Stage#2
Stage#1

Stage#1

x(0)=1

10 = X(0)

x(1)=2

-2 = X(2)

x(2)=3

x(3)=4
1

W 40

W 40

-2
1

-2+2j = X(1)

2j

-2-2j = X(3)

W 41 j

W 40

X(k)={10,-2+2j,-2,-2-2j}
22

Decimation in Frequency domain

Example

x(n)={ 1,1,3,5,0,0,1,3} find DFT for first 8-points

W8 e

2
8

(1 j )
2

W 80 1
1
W
(1 j )
2
W 82 j
1
8

W8

(1 j )
2
23

Stage#1
x(0)=1
x(1)=1

x(6)=1

x(7)=3

X(0)

X(4)

0
W
8
-3

W 80
X(2)

-1
2

-7 W 8

x(3)=5

x(5)=0

Stage#3

-1

x(2)=3

x(4)=0

Stage#2

-1

X(6)

-1

0
W
8
1

1+2W

1
1 W8

W+2W

W 80

X(1)

X(5)

-1
-1

-1
2
W
2 8

-1

1-2W W 80

X(3)

-1
3
W
8
2

-1

W 80

2
W
8
W-2W

-1

X(7)
-1

W 80

X(k)={14,0.3-j4.12,-3+j7,1.7-j0.121,-4,1.7+j0.121
,-3-j7,0.3+j4.12}
24

Decimation in Frequency domain

Example

X(k)={ 10,-2+j2,-2,-2-j2} find x(n) IDFT for 4-points

~

2
N

2
4

X(0) =10

4
~

-4

X(1) = -2+2j

12

X(2) =-2
X(3) = -2-2j

-1
-1

j4

W40 1

1/4

12

1/4

x(2) = 3

1/4

x(1) = 2

16

1/4

x(3) = 4

-1

W40 1

x(0) = 1

W40 1

W j
1
4

-1

x(n)={ 1,2,3,4}
25

Decimation in Frequency domain

For 8-point IDFT

1/N

X(0)

x(0)

W80

X(1)

-1

-1
~

-1

-1

W80

-1
-1

W80
~

2
8

-1

-1

-1

1/N

x(1)

1/N x(5)
1/N x(3)

0
8
~

3
8

-1

x(6)

x(2)

1/N

-1

W81

X(5)

x(4)

2
8

W80

X(4)

X(7)

X(3)

X(6)

1/N

W80

X(2)

1/N

W80

2
8

-1

1/N x(7)