DIGITAL

DIGITAL SIGNAL
SIGNAL PROCESSING
PROCESSING
ICE
ICE 517
517
MODULE
MODULE 44
(ANALYTICAL
(ANALYTICAL TOOLS)
TOOLS)
DISCRETE
DISCRETE FOURIER
FOURIER ANALYSIS
ANALYSIS
Lecturer(s): Dr. A.A Adewale, Engr. Akua Collins
 Learning
Learning Outcomes
Outcomes
Discrete Fourier Analysis

 Discrete Fourier Transform and properties

 4-Point DFT & 8-point DFT

 inverse DFT
 Discrete
Discrete Fourier
Fourier Transform
Transform (DFT)
(DFT)
DFT is used for analyzing discrete-time finite duration signals in the frequency
domain.
Let
Outside
The DFT pair of is
 Discrete
Discrete Fourier
Fourier Transform
Transform (DFT)
(DFT) Cont’d
Cont’d
The DFT X(k) & IDFT x(n) of a finite-length sequence x(n) are given as follows

is known as the TWIDDLE FACTOR,

It is a Fast Fourier Transform algorithm
& a constant coefficient that can be
multiplied by the data in the course of the
algorithm =
For example, if N = 4
K= 0,1,2,3
Where K and n are in the range of 0 ,1,2…… N= 0,1,2,3
N-1

Alternative Formula:
 Properties
Properties of
of Discrete
Discrete Fourier
Fourier Transform
Transform (DFT)
(DFT)
Periodicity property:
If X(k) is the N-point DFT of x(n), then X(k + N) =X(k)
Linearity property:
If X1(k)=DFT[x1(n)] & X2(k)=DFT[x2(n)], then DFT[a1x1(n)+a2x2(n)]=a1X1(k)
+a2X2(k)
Convolution property:
If X1(k) = DFT[x1(n)] & X2(k) = DFT[x2(n)], then
DFT[x1(n ) x2(n)] = X1(k)X2(k) Where indicates N-point circular convolution.

Multiplication property:
If X1(k) = DFT[x1(n)] & X2(k) = DFT[x2(n)], then
DFT[x1(n)x2(n)] = (1/N)[X1(k) X2(k)] Where Indicates N-point circular convolution
Time reversal property:
If X(k) is the N-point DFT of x(n), then
DFT[x(N-n)] = X(N-k)
 Properties
Properties of
of Discrete
Discrete Fourier
Fourier Transform
Transform (DFT)
(DFT)
Time shift property:
If X(k) is the N-point DFT of x(n), then
DFT [x(n-m)] = X(k)
Problem 1:
Find the DFT of a sequence x(n)= {1,1,0,0} and find the IDFT of Y(K)= {1,0,1,0}

X
 Discrete
Discrete Fourier
Fourier Transform
Transform (DFT)
(DFT)
X

X
 Inverse
Inverse Discrete
Discrete Fourier
Fourier Transform
Transform (IDFT)
(IDFT)
y

y
 Inverse
Inverse Discrete
Discrete Fourier
Fourier Transform
Transform (IDFT)
(IDFT)
y

y
 Using
Using Twiddle
Twiddle factors
factors to
to solve
solve DFT
DFT Problems
Problems
Problem 2:
Find the 4-point DFT of this sequence x(n)= {1,1,0,0} using the Twiddle
factors
, 1,

{
𝑁 −1

𝑋 ( 𝑘) = ∑ 𝑥 ( 𝑛) 𝑊 𝑘𝑛
𝑁 ,0≤𝑘≤𝑁 −1
𝑛=0
0 , 𝑜𝑡h𝑒𝑟𝑤𝑖𝑠𝑒
3
𝑋 ( 𝑘) =∑ 𝑥 ( 𝑛 ) 𝑊 =𝑥 ( 0 ) 𝑊 +𝑥 ( 1 ) 𝑊 +𝑥 ( 2 ) 𝑊 +𝑥 (3)𝑊
𝑘𝑛
𝑁
0
4
𝑘
4
2𝑘
4
3𝑘
4
𝑛=0
 Using
Using Twiddle
Twiddle factors
factors to
to solve
solve DFT
DFT Problems
Problems

𝑤h𝑒𝑛 𝑘= 0 , 𝑋 ( 0 )=1+1=2

𝑤h𝑒𝑛 𝑘=1 , 𝑋 ( 1 ) =1 − 𝑗

𝑤h𝑒𝑛 𝑘=2 , 𝑋 ( 2 )=1 −1=0

𝑤h𝑒𝑛 𝑘=3 , 𝑋 ( 3 ) =1+ 𝑗

X
 TUTORIAL
TUTORIAL QUESTIONS
QUESTIONS
Derive the twiddle factors of a 4-point DFT

 Find the 4-point DFT of

 Derive the twiddle factors of an 8-point DFT

 Compute the 8-point DFT of the discrete time signal Using the
direct method

 Show that the Fourier transform of