Discrete Fourier Transform

Youssef Jaffal

Phoenicia University
Electrical & Communication Engineering
EENG 233: Digital Signal Processing

References: [Proakis & Manolakis] Chapter: 7

The figures in this presentation are taken from “Proakis & Manolakis, Digital Signal Processing, 4th edition.”
1/10
Youssef Jaffal Discrete Fourier Transform
Review: DTFT
The DTFT of x[n] is defined as follows:
∞
X(e jω ) = ∑ x[n]e− jωn
n=−∞

The frequency ω is continuous

There are an infinite number of possible values of ω from 0 to 2π or from
−π to π.
Therefore, X(e jω ) can be computed only at a finite set of frequencies:
∞
X(e jωk ) = ∑ x[n]e− jωk n
n=−∞

As a special case, we use N samples equally spaced around the unit circle:

2πk
ωk = , k = 0, 1, ..., N − 1
N

We can not always recover x[n] perfectly from the samples of the DTFT.
2/10
Youssef Jaffal Discrete Fourier Transform
Review: The Fourier Series for Discrete-Time Periodic
Signals
If x[n] is discrete-time periodic signal with period N then:
N−1
x[n] has a Fourier series representation: x[n] = ∑ ck e j2πkn/N
k=0
N−1
The Fourier coefficients ck are: ck = 1
N ∑ x[n]e− j2πkn/N
n=0
Spectrum of a periodic signal x[n] with period N is a periodic sequence as
well with a period N.

3/10
Youssef Jaffal Discrete Fourier Transform
The Discrete Fourier Transform
Consider a DT signal x[n] of length L .
Define the periodic version of x[n]: x p [n] with period N such that N ≥ L.
x p [n] has a discrete Fourier series decomposition
N−1
1 1  
ck =
N ∑ x[n]e− j2πkn/N = N X e j2πk/N
n=0

And
N−1 N−1
1  
x[n] = ∑ ck e j2πkn/N = N ∑ X e j2πk/N e j2πkn/N
k=0 k=0

Definition: Define the DFT and its inverse IDFT as follows:

N−1
DFT X[k] = ∑ x[n]e− j2πkn/N , k = 0, 1, ..., N − 1
n=0
N−1
1
IDFT x[n] =
N ∑ X[k]e j2πkn/N , n = 0, 1, ..., N − 1
k=0

4/10
Youssef Jaffal Discrete Fourier Transform
Example 1
A finite-duration sequence of length L is given as

1 0 ≤ n ≤ L−1
x[n] =
0 otherwise
Determine the N-point DFT of this sequence for N ≥ L.
Solution: The DTFT of x[n] is
sin(ωL/2) − jω(L−1)/2
X(ω) = e
sin(ω/2)

For L = 10

5/10
Youssef Jaffal Discrete Fourier Transform
Example 1 (cont’d)

6/10
Youssef Jaffal Discrete Fourier Transform
Multiplication of Two DFTs and Circular Convolution
Suppose that we have two finite-duration sequences of length N, x1 [n]
and x2 [n]. Their respective N-point DFTs are
N−1
X1 [k] = ∑ x1 [n]e− j2πkn/N , k = 0, 1, ..., N − 1
n=0

N−1
X2 [k] = ∑ x2 [n]e− j2πkn/N , k = 0, 1, ..., N − 1
n=0

If
X3 [k] = X1 [k]X2 [k], k = 0, 1, ..., N − 1
The IDFT of X3 [k] is
N−1
x3 [m] = ∑ x1 [n]x2 [(m − n)N ], m = 0, 1, ..., N − 1
n=0

We write the circular convolution as x3 [n] = x1 [n] ~ x2 [n].

N

7/10
Youssef Jaffal Discrete Fourier Transform
Example 2
Perform the circular convolution of the following two sequences:

x1 [n] = {2̂, 1, 2, 1}
x2 [n] = {1̂, 2, 3, 4}

Solution:

ˆ 16, 14, 16}

x3 [n] = {14,

8/10
Youssef Jaffal Discrete Fourier Transform
Properties of the DFT

9/10
Youssef Jaffal Discrete Fourier Transform
Symmetry Properties of the DFT

10/10
Youssef Jaffal Discrete Fourier Transform