FFT FFT

Decimation in Frequency Decimation in Frequency

Spring
2009
Ammar Abu-Hudrouss -Islamic
University Gaza
Slide
Digital Signal Processing
Decimation in Frequency

1
0
1 ,....., 2 , 1 , 0 ) ( ) (
N
n
kn
N
N k W n x k X

1 2 /
0
1
2 /
) ( ) ( ) (
N
n
N
N n
kn
N
kn
N
W n x W n x k X

1 2 /
0
1 2 /
0
) 2 / (
) 2 / ( ) ( ) (
N
n
N
n
N n k
N
kn
N
W N n x W n x k X
N j
N
e W
/ 2

The discrete Fourier transform can be found using

Where N = 2, 4, 8, 16, and
X (k ) can be expressed as

1 2 /
0
1 2 /
0
2 /
) 2 / ( ) ( ) (
N
n
N
n
kn
N
kN
N
kn
N
W N n x W W n x k X

Slide
Digital Signal Processing
Decimation in Frequency
k k N N k k N
N
e e W ) 1 (
/ ) 2 / ( 2 ) 2 / (

1 2 /
0
2
) 2 / ( ) ( ) 2 (
N
n
mn
N
W N n x n x m X

1 2 /
0
1 2 /
0
) 2 / ( ) 1 ( ) ( ) (
N
n
N
n
kn
N
k kn
N
W N n x W n x k X
But
Then
If k = 2m or an even number

1 2 /
0
2 /
) ( ) 2 (
N
n
mn
N
W n a m X
Slide
Digital Signal Processing
Decimation in Frequency
mn
N
N mn j N mn j mn
N
W e e W
2 /
) 2 / /( 2 / 2 2 2


Noting That
) 2 / ( ) ( ) ( N n x n x n a

1 2 /
0
2
) 2 / ( ) ( ) 1 2 (
N
n
mn
N
n
N
W W N n x n x m X
) 2 / ( ) ( ) ( N n x n x n b

1 2 /
0
2 /
) ( ) 1 2 (
N
n
mn
N
n
N
W W n b m X
If k = 2m+1 (odd number) and using the same method
Then X(2m) is N/2-point DFT for a(n)
X(2m+1) is N/2-point DFT for
n
N
W n b ) (

Slide
Digital Signal Processing
Decimation in Frequency
2
8
W
1
8
W
3
8
W
N/2-point
DFT
X(0)
X(2)
X(4)
X(6)
a(0)
a(1)
a(2)
a(3)
N/2-point
DFT
X(1)
X(3)
X(5)
X(7)
b(0)
b(1)
b(2)
b(3)
x(0)
x(1)
x(2)
x(3)
x(4)
x(5)
x(6)
x(7)
0
8
W
-1
-1
-1
-1
Slide
Digital Signal Processing
Decimation in Frequency
2
8
W
1
8
W
3
8
W
X(0)
X(4)
X(2)
X(6)
x(0)
x(1)
x(2)
x(3)
X(1)
X(5)
X(3)
X(7)
x(4)
x(5)
x(6)
x(7)
0
8
W
N/4 point
DFT
N/4 point
DFT
N/4 point
DFT
N/4 point
DFT
2
8
1
4
W W
0
8
0
4
W W
-1
-1
-1
-1
-1
-1 -1
-1
2
8
1
4
W W
0
8
0
4
W W

Slide
Digital Signal Processing
Decimation in Frequency
X(0)
X(4)
X(2)
X(6)
X(1)
X(5)
X(3)
X(7)
0
8
W
0
8
W
0
8
W
0
8
W
-1
-1
-1
-1
2
8
W
1
8
W
3
8
W
x(0)
x(1)
x(2)
x(3)
x(4)
x(5)
x(6)
x(7)
0
8
W
0
8
W
2
8
W
0
8
W
2
8
W
-1
-1
-1
-1
-1
-1 -1
-1
Slide
Digital Signal Processing
Decimation in Frequency
Using the previous algorithm , the complex multiplications
needed is only 12. While using the normal DFT would
require 64 complex multiplications
In general
Complex multiplication of DFT is: N
2
Complex multiplication of FFT is (N/2) log
2
(N)
If N = 1024
Complex multiplication of DFT is: 1,048,576
Complex multiplication of FFT is: 5,120

Slide
Digital Signal Processing
Decimation in Frequency
Index mapping for Fast Fourier Transform
Input Data
index
n
Index Bits Reversal
Bits
Output data
index
k
0 000 000 0
1 001 100 4
2 010 010 2
3 011 110 6
4 100 001 1
5 101 101 5
6 110 011 3
7 111 111 7
Slide
Digital Signal Processing
Decimation in Frequency
Example Given a sequence x(n) where x(0) = 1, x(1) = 2, x(2) = 3,
x(3) = 4 and x(n) = 0 elsewhere ,find DFT for the first four points
solution
X(0)
X(2)
X(1)
X(3)
x(0) =1
x(1) =2
x(2) =3
x(3) =4
1
0
4
W
j W
1
4
1
0
4
W
1
0
4
W -2 6
-2
-2
4 10
-2+2j
-2-2j
-1
-1
-1
-1

Slide
Digital Signal Processing
Inverse Fourier Transform

1
0
1 ,....., 2 , 1 , 0 ) (
1
) (
N
k
kn
N
N n W k X
N
n x

1
0
~
1 ,....., 2 , 1 , 0 ) (
1
) (
N
k
kn
N
N n W k X
N
n x
The inverse discrete Fourier transform can be found using
Which can be expressed as
where
kn
N
kn
N
W W

~
We can see that the difference between the inverse discrete
Fourier and forward Fourier transform is the twiddled factor
and the division by 1/N
is called the twiddled factor
Slide
Digital Signal Processing
Inverse Fourier Transform
~
2
8
W
~
1
8
W
~
3
8
W
x(0)
x(4)
x(2)
x(6)
X(0)
X(1)
X(2)
X(3)
x(1)
x(5)
x(3)
x(7)
X(4)
X(5)
X(6)
X(7)
~
0
8
W
~
0
8
W
~
2
8
W
~
0
8
W
~
2
8
W
~
0
8
W
~
0
8
W
~
0
8
W
~
0
8
W
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
1/N
1/N
1/N
1/N
1/N
1/N
1/N
1/N

Slide
Digital Signal Processing
Inverse Fourier Transform
Example Given a sequence X(n) given in the previous example.
Find the IFFT using decimation in frequency method
solution
x(0) = 1
x(2) = 3
x(1) = 2
x(3) = 4
X(0) =10
X(2) =-2
X(1) = -2+2j
1
~
0
4
W
j W
~
1
4
1
~
0
4
W
1
~
0
4
W 12
-4
12
j4
8
4
8
16
X(3) = -2-2j
-1
-1
1/4
1/4
1/4
1/4
-1
-1