DISCRETE FOURIER TRANSFORM

BY:
DR.AZURA BINTI HAMZAH
PROF.DR.SHOZO KOMAKI
PROF.DR.NOZOMU HAMADA
Fourier Family
The Discrete Fourier Transform
The sequence X[k] is called the discrete Fourier
transform (DFT) of the sequence x[n].
Using the commonly used notation

We can rewrite as

Inverse discrete Fourier transform (IDFT)


2 / j N
N
W e
t
=
1
0
[ ] [ ] , 0 1
N
kn
N
n
X k x n W k N

=
= s s

The Discrete Fourier Transform

Matrix Relations
The DFT samples defined in can
be expressed in matrix form as

where X is the vector composed of the N DFT
samples,

x is the vector of N input samples,
1
0
[ ] [ ]
N
kn
N
n
X k x n W

=
=

X x
N
D =
| | | | | |
X 0 1 1
T
X X X N ( =

| |
x [0] [1] [ 1]
T
x x x N =
The Discrete Fourier Transform
is the DFT matrix given by





IDFT relations
N
D N N
1 1 1
1
1

1
N
D

(
(
(
(
=
(
(
(
(

1 2 N- 1
N N N
2 4 2( N- 1)
N N N
N- 1 2( N- 1) ( N- 1) ( N- 1)
N N N
1
W W W
W W W
W W W
1 *
1
x X X
N N
D D
N

= =
6
Summary of Properties of the Discrete
Fourier Transform
7
Summary of Properties of the Discrete
Fourier Transform
8
Periodic Convolution
| | | | | | n x n x n x
2 1 3
~ ~ ~
=
| | | | | |

=
=
1
0
2 1 3
~ ~ 1 ~
N
l
l k X l X
N
k X
| | | | | | k X k X k X
2 1 3
~ ~ ~
=
| | | | | |

=
=
1
0
2 1 3
~ ~ ~
N
m
m n x m x n x
9
Periodic Convolution
| | | | | |
1
3 1 2
0
1 1
N
m
x x m x m

=
=

| |
1
x m
| |
2
x m
| |
2
x m
| |
2
1 x m
| |
2
2 x m
| | | | | |
1
3 1 2
0
2 2
N
m
x x m x m

=
=