DIT Vs DIF
DIT Vs DIF
DIT Vs DIF
when k is even, e j k 1
The N - point DFT of x(n) can be written as N
1
2
N
2
1
N 1
X(2k) [x 1 ( n ) x 2 ( n )] W N2nk
X(k)
n 0
x(n) W nk
N N
x(n) W nk
N N
n0
1
n 2
[x ( n ) x 2 ( n )] W Nnk ........ (12) ( WN WN 2 )
2 2
N N 1
1 1 N n0 2
2 2 (n
)k
x 1 ( n ) W Nnk x2 (n) W N
2
This is the N/2-point
N/2 point DFT of the N/2-point
N/2 point sequence
n0 n0
N N
obtained by adding the first half and the last half of the
1 1
2 2 input sequence
Nk
X(k) x1 ( n ) W nk
N WN 2
x 2 ( n ) W Nnk N
1
2
n 0 n0
N N
X(2k) f ( n ) W N2nk
1 1 n 0
2 2
n 0
x 1 ( n ) W Nnk e j k n0
x 2 ( n ) W Nnk where f ( n ) x 1 ( n ) x 2 ( n ) n 0, 1, 2, ...,
N
1
2
[email protected] 3 [email protected] 4
when k is odd, e j k 1
N
Eq. (12) and Eq. (13) show that the even and odd samples
1
2 of the DFT can be obtained from the N/2-point DFTs of
X(2k 1) [x
n 0
1 ( n ) x 2 ( n )] W (2k 1)n
N
f(n) and g(n) respectively.
N
f ( n ) x 1 ( n ) x 2 ( n ) n 0, 1, 2, ..., 1
N
1 where
2
[x
n 0
1 ( n ) x 2 ( n )] W 2kn
N W n
N
g ( n) [ x1 (n) x2 (n)] WN n 0, 1, 2, ...,
n N
2
1
2
N N
1 1
2 2 This can be represented by a butterfly:
n 0
[ x 1 ( n ) x 2 ( n )] W Nn W Nnk
2
n 0
g ( n ) W Nnk ..... (13)
2
1
1/24/2014
n0 n0 n 0 n 0
f (0) f (1)W82 f (2)W84 f (3)W86 f (0) f (1)W82 f (2) f (3)W82 g (0) g (1)W82 g ( 2) g (3)W82
3 3 3
X (5) [ x1 ( n) x2 ( n)] W85 n g(n)W g(n) ( 1) n
3 3
X (4) [x1(n) x2 (n)]W84n f(n)W
4n
8
4n
f (0) f (1) f (2) f (3) 8
n 0 n 0 n 0
n0 n0
3 3 g (0) g (1) g ( 2) g (3)
X (6) [x1(n) x2 (n)]W 8
6n
f(n)(-W ) 8
2 n
f (0) f (1)W f (2) f (3)W
8
2
8
2
3 3 3
X (7) [ x1 ( n) x2 ( n)] W87 n g(n)W g(n) (-W82 ) n
n0 n0 6n
8
j 2 j 2 N n0 n 0 n 0
k
W84 (e ) e j 1, W88 (e
8 4 8 8
) e j 2 1,Symmetry WN 2
WNk g (0) g (1)W82 g ( 2) g (3)W82
[email protected] 7 [email protected] 8
[email protected] 9 [email protected] 10
[email protected] 11 [email protected] 12
2
1/24/2014
Flow graph of Complete decimation in frequency Basic Computational diagram for DIF - FFT
decomposition of an 8-point DFT computation
[email protected] 13 [email protected] 14
1. The number of input samples, N = 2M , M is an integer 8. The twiddle factor exponents are functions of stage
Nt
index m, k t 0, 1, 2, ......, 2 M - m 1 ……. (14)
2. The input sequence is in natural order 2 M m 1
3. The number of stages in the flow graph is M = log2N 9. The number of sets of sections of butterflies in each
5. Inputs/outputs for each butterfly are separated by 2M-m 10. The exponent repeat factor (ERF) – the number of
m represents the stage index. ie; for first stage m = 1 times the exponent sequence associated with m is
3
1/24/2014
N 1
(15 ) Nx * ( n )
k0
X * ( k )W Nnk .....( 16 )