Fourier
X DFT k x n e
j 2 nk N
n 0
, k = 0, 1, 2, , N 1
N 1
j 2 nk
X
k
e
DFT
, n = 0, 1, 2, , N 1
k 0
e j 2 n k
e j 2 n N k
e j 2 n k N
the DFT and its inverse are also periodic with period N
and it is sufficient to compute the results for only one
period (0 to N - 1), with a starting index of zero.
Example 4.1
Solution
j 2nk
e
With N = 4, and,
e jnk
k = 0, XDFT[0] =
k = 1, XDFT[1] =
k = 2, XDFT[2] =
x
n
e
1 2 1 0 4
n 0
jn 2
j 2
j
x
n
e
2
e
e
0 j2
n 0
3
jn
j
j 2
x
2
e
e
00
n 0
k = 3, XDFT[3] =
j 3 n
x
1 2e j 3 2 e j 3 0 j 2
n 0
j 2 1
e j
jk
cos k
Example:
e j3 = cos (3) = 1
2e j3/2 = 2(e j / 2 )3 = 2 ( j)3 = 2j3
= 2j( 1) = j2
All right reserved. Copyright 2013. Sharifah Saon
Exercise 4.1
a)
b)
Signal
Shift
x[n - no]
Shift
x[n 0.5N]
Modulation
x n e j 2nko / N
Modulation
1 n x n
Folding
x[-n]
Product
x[n]y[n]
Convolution
x[n] y[n]
Correlation
x[n] y[n]
Central Ordinates
1 N 1
x 0
X DFT k
N k 0
k
1 N 1
N
(N even)
x 1 X DFT k
Central Ordinates
Parsevals
Relation
N 1
DFT
k 0
x n
n 0
Remarks
X DFT k e j 2kno
No change in magnitude.
1 k X DFT k
X DFT k 0.5 N
X DFT k ko
X DFT k
1
X DFT k YDFT k The convolution is periodic.
N
The convolution is periodic.
X
kY
k
DFT
*
k
X DFT k YDFT
DFT
N 1
X
k 0
DFT
k 2
X DFT 0
N 1
x n
n 0
n
N 1
N
1 x n
X DFT
2
n 0
(N even)
9
Symmetry
10
The
Conjugate
symmetry
Conjugate
symmetry
X [k ] X * [ N K ]
X [k ] X * [ N K ]
N=
7
N1
N=
8
N/2
N1
N/2
11
n 0
1
x[0]
N
N 1
X DFT [k ]
k 0
N 1
N
DFT 2
1
N
x 2
N
x[n]
n 0
N 1
1
X DFT [k ]
k 0
12
Circular Shifting
The
13
generating
14
Circular Folding
generates
15
Circular Symmetry
for
16
17
Periodic Convolution
18
Periodic Correlation
If x[n] and h[n] are real, the final rxh[n] must also be
real.
All right reserved. Copyright 2013. Sharifah Saon
19
20
Example 4.2
a)
21
b)
N 1
x n
n 0
1 N 1
2
X DFT k Parsevals relation
N k 0
22
Solution
All right reserved. Copyright 2013. Sharifah Saon
23
i. Time shift
To find y[n] = x[n - 2], the last two samples are moved to
the beginning to get
24
25
ii. Modulation
Its IDFT is
z[n] = x[n] ej2n/4 = x[n] ejn/2 = {1, j2, -1, 0}.
26
Notes:
n = 0, (ej/2)n = (ej/2)0 = 1
n = 1, (ej/2)n = (ej/2)1 = j
n = 2, (ej/2)n = (ej/2)2 = ej = cos() = -1
n = 3, (ej/2)n = (ej/2)3 = j3 = -j
27
iii. Folding
g[n] = {x[0], x[- 3], x[- 2], x[- 1]} = {1, 0, 1, 2}.
Its
DFT equals
28
iv. Conjugate
Its DFT is
PDFT[k] =
* [-k]
DFT
29
v. Product
Its DFT is
HDFT[k]
= 1 X k X k
DFT
DFT
4
1
= {4, -j2, 0, j2}{4,
-j2, 0, j2}.
4
30
XDFT[k]
-j2
j2
XDFT[k]
-j2
j2
16
-j8
j8
-j8
-4
j8
-4
j16
-4
H[n]
16
-j16
-4
31
K
First half of y[k]
Wrap around half of y[k]
Periodic convolution yp[k]
16
-j16
-4
j16
-4
24
-j16
-8
j16
32
33
Notes:
n
x[n]
0
1
1
2
2
1
3
0
x[n]
y[n]
34
35
SDFT[k] = {16,
-2.35 -jl0.28, -2.18 + j1.05,
0.02 + j0.03, 0.02 - j0.03, -2.18 -j1.05,
-2.35 + j10.28}.
All right reserved. Copyright 2013. Sharifah Saon
36
Notes:
4
SDFT[k]
j 2nk 7
s
n
e
=
, k = 0, 1, 2, , 6.
n 0
SDFT[0] = 1 + 4 + 6 + 4 + 1 = 16
SDFT[1] = 1 + 4e-j2/7+ 6e-j2(2)/7 + 4e-j2(3)/7 + e-j2(4)/7
= 1 + 4(cos2/7 - jsin2/7) + 6(cos4/7 - jsin4/7) +
4(cos6/7 - jsin6/7) + 4(cos2/7 - jsin2/7) +
cos8/7 - jsin8/7
37
1 3
x[0] = X DFT k (4 - j2 + 0 + j2) = (4) = 1
4 k 0
3
x n
XDFT[0] =
=1+2+1+0=4
n 0
x n
n 0
1 N 1
2
X DFT k
N k 0
x n = 1 + 4 + 1 + 0 = 6 J
n 0
2
DFT
-4, 0, 4},
=
{16,
k
1 3
2 = (16 + 4 + 0 + 4) = 6 J
X DFT k
4 k 0
All right reserved. Copyright 2013. Sharifah Saon
38
j 2 k f o t
X
k
e
1
j 2 k f o t
x
t
e
dt
p
T T
39
N 1
x n e
n 0
j 2 k f o n t s
1
ts
N
N 1
x n e
j 2 n k N
k 0, 1, , N - 1
n 0
40
x n X DFS n e
n 0
j 2 k f o n t s
N 1
X DFS k e j 2 n k N ,
n 0, 1, , N 1
k 0
41
42
43
44
The computation is carried out separately on even-indexed and oddindexed samples to reduce the computational effort.
All algorithms allocate storage for computed results.
The less the storage required, the more efficient is the algorithm.
Many FFT algorithms reduce storage requirements by performing
computations in place by storing results in the same memory
locations that previously held the data
2 types of FFT algorithm
DIF decimation in frequency
DIT decimation in time
45
Fundamental Results
Consider
results.
46
N 1
N
2
n 0
n 0
N
2
n 0
N
2
n 0
N 1
2
N
2
n 0
n 0
Note:
WN2 WN 2
WN2 nk WNnk2
All right reserved. Copyright 2013. Sharifah Saon
47
48
Separating
X DFT 2k x a x b WN2 nk , k = 0, 1, 2, , N2 1
n 0
N
2
X DFT 2k 1 x a x b WNnWN2 nk ,
n 0
k = 0, 1, 2, , N2 1
49
The
Inputs:
Outputs:
WNn
50
51
The
52
53
54
55
Example 4.3
56
57
At
as
X DFT k X e k WNk X o k ,
N
X DFT k X e k WNk X o k ,
2
k = 0, 1, 2, ,
N
2
k = 0, 1, 2, , N2 1
58
59
As
Values
60
Stage 1:
P = 2i - 1 = 21 - 1 = 1. Thus Q = 0.
i = 1,
t = 2m - iQ = 23 - 1(0) = 0
61
Stage 2:
P = 2i - 1 = 22 - 1 = 2. Thus Q = 0, 1.
i = 2,
t = 2m - iQ = 23 - 2(0) = 0
t = 23 - 2(1) = 2
62
Stage 3:
P = 2i - 1 = 23 - 1 = 4. Thus Q = 0, 1, 2, 3.
i = 3,
t = 2m - iQ = 23 - 3(0) = 0
t = 23 - 3(1) = 1
t = 23 - 3(2) = 2
t = 23 - 3(3) = 3
63
Example 4.4
The DFT of a discrete signal, y[n] is given by
YDFT k {6, 3 j , 8, 3 j}
Apply Decimation in Time (DIT) Fast Fourier
Transformation (FFT) algorithm to determine its
discrete signal, y[n].
64
65