Summary

DFT x(n) X (k ) N
N 1 n =0

x (0) x(4)
x(2) x (6)

F2

2-Point 2 P i t DFT 4-Point DFT

G2

F1

X (k ) = x ( n )W Nkn
Here f l (n) = x(2n)

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

2-Point DFT
F3 G1

& g l (n) = x(2n + 1) , n = 0,1,....,

x (1 ) x (5)

2-Point DFT

Combine to find 8 point DFT 4-Point DFT

k X (k ) = Fl (k ) + WN Gl (k )

N k X k + = Fl (k ) WN Gl (k ) 2

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

x (3) x (7 )

2 Point 2-Point DFT STAGE-1

G3

STAGE-2
JIIT Noida, Slide 2

STAGE-3

JIIT Noida, Slide 1

Flow Graph Notations*: p

Computing 2-Point DFT 2 Point

F2 ( k ) = f 2 (n)W2kn
n=0 1

a+b a Wk aWk

, k =0

F2 (k ) = f 2 (0) + W2k f 2 (1) , k = 0 F2 (0) = f 2 (0) + f 2 (1) F2 (1) = f 2 (0) f 2 (1) Similarly, G2 (0) = g 2 (0) + g 2 (1) G2 (1) = g 2 (0) g 2 (1)
g 2 ( 0)
W20

f 2 ( 0)
W20

F2 (0)

a-b

f 2 (1)

F2 (1)

G 2 ( 0)

* This graph notations are used in [ ] g p [2].

g 2 (1)

G2 (1)

JIIT Noida, Slide 3

JIIT Noida, Slide 4

Combining two 2-Point DFTs

F1 (k + 2 ) = F2 ( k ) W 4k G 2 ( k ) F1 (k ) = F2 ( k ) + W 4k G 2 ( k )
F2 (0)

Combining two 4 Point DFTs 4-Point

X (k + 4) = F (k) W8kG1(k) 1
F1 (0)

k = 0,1

X (k) = F (k) +W8kG1(k) 1

G1(0)
F1 ( 0 ) F1 (1)
F1 ( 2 ) F1 ( 3 )

, k = 0,1,2,3

X (0) = F1(0) +

F1 ( 0 ) = F2 ( 0 ) + F1 (1) = F2 (1) F1 (3) = F2 (1)

1 4

G 2 (0)
F2 (1) F1 (1)

X (1) = F1(1) + W81G1(1) X (2) = F1(2) + W82G1(2) X (3) = F1(3) + W83G1(3)

W
G2 (0)
0 4

X (0)
X (1)
X (2) X (3)
W
0 8

+ W G 2 (1) G 2 (0) W 41G 2 (1)

F1 ( 2 ) = F2 ( 0 )

X (4) = F1(0)
W
1 4

G1(0)
G1 (0 )

F1 (2)

X (5) = F1(1) W81G1(1) X (6) = F1(2) W82G1(2) X (7) = F1(3) W G (3)

3 8 1

W 81 W 82 W 83

X (4)

G 1 (1)
G1 ( 2 ) G1 (3)

X (5 )
X (6) X (7 )

Similarly, Similarly G1(k) may be computed computed.

G2 (1)

F1 (3)

JIIT Noida, Slide 5

JIIT Noida, Slide 6

Flow Diagram for 8-point Radix-2 Decimation in ti D i ti i time FFT algorithm l ith
x(0)
x(4)
x(2)
W
0 2

SIMILARLY Radix-2 DIF FFT Algorithm can be implemented

X(0)

0 2

X(1 )
W40

W41

X(2) X(3)
W80

x(6)

x(1 )
W0 2

W81
W
0 4

X(4) X(5) X(6) X(7)

x(5) x(3)
W20

W82
W
3 8

x ( 0) x (1) x ( 2) x (3) x ( 4) x ( 5) x ( 6) x (7 )

Radix-2
Decimation in Frequency

FFT Algorithm

X(0) X(4) X(2) X(6) X(1) X(5) X(3) X(7)

Bit Reversing Algorithm

X (0) X (1) X (2) X (3) X (4) X (5) X (6) X (7 )

W41

x(7)
JIIT Noida, Slide 7

JIIT Noida, Slide 8

Computational Complexity of Radix-2 DIT FFT Algorithm It may be noted that v stages are required to compute N=2v point DFT using Radix-2 DIT FFT algorithm. For example to compute 8 point DFT 3 stages are required 8-point required. Let us find the computation required to combine two M/2 point DFTs DFT to get M i DFT M-point DFT,
k X (k ) = Fl (k ) + WM Gl (k )

Computations required to combine two M/2 point DFTs to get M-point DFT M point DFT,
k X (k ) = Fl (k ) + WM Gl (k )

M X k + 2

k = Fl (k ) WM Gl (k )

k = 0,1,...........,

M 1 2

One combining operation requires: M tions Complex Multiplica 2 Complex Additions -M

M k X k + = Fl (k ) WM Gl (k ) 2

k = 0,1,...........,

M 1 2

JIIT Noida, Slide 9

JIIT Noida, Slide 10

Say N=8 (CM : Complex Multiplication, CA : Complex Addition) y p p p

From the discussion it may be concluded that:

N Complex Multiplications : Every stage required 2 Complex Additions : N

x (0) x(4)

2-Point 2 P i t DFT CM = 1 CA = 2

F2

x(2) x (6)

2-Point 2 P i DFT G 2 CM = 1 CA = 2 2-Point DFT F 3 CM = 1 CA = 2 2-Point DFT G3 CM = 1 CA = 2 STAGE-1 CM = 4 CA = 8

4-Point DFT F 1 CM = 2 CA = 4

Combine to find 8 point DFT CM = 4 CA = 8

x (1) x (5 )

x (3) x (7 )

4-Point DFT G 1 CM = 2 CA = 4

Total Number of stages = v = log 2 N N N Complex Multiplications : v = log 2 N Total Computations p 2 2 Complex Additions : Nv = N log 2 N

STAGE-2 CM = 4 CA = 8
JIIT Noida, Slide 11

STAGE-3 CM = 4 CA = 8

JIIT Noida, Slide 12

Eight-point radix-2 decimation-in-frequency FFT

Therefore, Computations required to N-point DFT using radix-2 DIT FFT algorithms are:
N Complex Multiplications : log 2 N 2 Complex Additions : N log 2 N

Computational Complexity = O(N log2N) C t ti lC l it l

JIIT Noida, Slide 13

JIIT Noida, Slide 14

JIIT Noida, Slide 15

JIIT Noida, Slide 16

9-point radix-3 decimation-in-time FFT(for X(0), X(2),X(3) etc X(2) X(3) etc. do yourself)

JIIT Noida, Slide 17

JIIT Noida, Slide 18

9-point radix-3 decimation-in-frequency FFT (for x(0), x(2),x(3) etc. do yourself)

Full decimation-in-time FFT implementation of a 8-point DFT i l t ti f 8 i t

JIIT Noida, Slide 19

JIIT Noida, Slide 20

FFT example
Lets take an example of continuous input signal containing components at 1khz and 2 g g p khz.

Input Signal Waveform

x(n) = sin(2.1000.t ) + 0.5(2.2000.t + 3 / 4) ( ( )

Now we will sample it with frequency 8000 Hz and take p q y 8 point DFT i.e. N=8.

x(n) = xin(nts) = sin(2.1000.nts) +0 5(2.2000.nts +3/ 4) t i (2 1000 t 0.5(2 2000 t

JIIT Noida, Slide 21

JIIT Noida, Slide 22

Values of x(n)
VALUE OF ADDITION SAMPLES AFTER
Now we will give these input values to our previous figure.

x(0) =3.535534e-001 (0) 3 535534 001 x(1) =3.535534e-001 x(2) =6.464466e-001 x(3) =1.060660e+000 (3) .060660e 000 x(4) =3.535534e-001 x(5) =-1.060660e+000 (5) 1 060660e+000 x(6) =-1.353553e+000 x(7) =-3.535534e-001
JIIT Noida, Slide 23 JIIT Noida, Slide 24

Stage 1

Stage 2

Stage 3

0.3535 X(0) (0) 0.3535 X(4) 0.6464 X(2) -1.3535 1 3535 X(6) 0.3535 X(1) -1.0607 X(5) 1.0607 X(3) -0.3535 X(7)

.707
1 -1

A(0)

X(0) W08 X(1) W18 X(2) W28 X(3) W38 W48 W58 W68 W78 X(4) X(5) X(6) X(7)

The output of the second stage FFT are:

0.3535 X(0) 0.3535 0 3535 X(4) 0.6464 0 6464 X(2) -1.3535 X(6) ( ) .707
1 -1

W04 .0

A(1)

A(0)

W14 W24 W34

A(2) A(3)

W04 .0 W14 W24 W34

A(1)

-.707
1 -1

-.707 707
1 -1

A(2) A(3)

1.999 -.707 .707

1 -1

B(0) ( )

W04 W14B(1) W24B(2) W34B(3)

JIIT Noida, Slide 25

1.999

1.414 .707
1 -1 1

1.414

JIIT Noida, Slide 26

Calculating the outputs of the third stage of the FFT to arrive at our final answer:
0.3535 X(1) -1.0607 X(5) 1.0607 1 0607 X(3) -0.3535 X(7) -.707
1 -1

B(0)

A(0)

X(0) ( ) W08 X(1) W18 X(2) W28 X(3) W38 W48 X(4) X(5) X(6) X(7)

W04 W14 W24 W34

B(1) ( ) B(2) B(3)

A(1)

1.414 .707
1 -1

A(2) A(3)

1.414

B(0)

B(1) B(2) B(3) JIIT Noida, Slide 27 JIIT Noida, Slide 28

W58 W68 W78

Result of FFT = DFT

So, the FFT gives us the correct results, and again we pp remind that the FFT is not an approximation to a DFT; it is the DFT with a reduced number of necessary arithmetic operations. We've W ' seen f from the above example that the 8 i h b l h h 8-point FFT example required less effort than the 8-point DFT Example Example.

JIIT Noida, Slide 29

JIIT Noida, Slide 30