DFT & FFT

PREPARED BY
KAZI AFRA NAWER
LECTURER, DEPT. OF EEE
NORTH WESTERN UNIVERSITY KHULNA
Fourier Transform (FT)
The Fourier transform of a discrete time signal 𝑥 𝑛 is given by,
∝
𝜔 = −𝜋 𝑡𝑜 𝜋
𝑋 𝜔 = ෍𝑥 𝑛 𝑒 −𝑗𝜔𝑛 ,
𝑜𝑟, 𝜔 = 0 𝑡𝑜 2𝜋
−∝

Kazi Afra Nawer, Lecturer, Dept of EEE, NWU, Khulna. 1

Discrete Fourier Transform (DFT)
When Fourier transform is calculated at discrete points then it is called discrete
Fourier transform (DFT) and is denoted by,
𝑁−1
2𝜋𝑘
−𝑗 𝑁 𝑛
𝑋 𝑘 = ෍𝑥 𝑛 𝑒 ; 𝑘 = 0, 1, 2, 3, … … (𝑁 − 1)
𝑛=0
𝑁. 𝐵. : 𝐻𝑒𝑟𝑒 𝑤𝑒 𝑟𝑒𝑝𝑙𝑎𝑐𝑒 𝜔 𝑖𝑛 𝐹𝑇 𝑏𝑦 2𝜋𝑘 Τ𝑁

DFT is also known as N-point DFT.

Kazi Afra Nawer, Lecturer, Dept of EEE, NWU, Khulna. 2

Properties of DFT
• Periodicity
• Linearity
• Time reversal of the sequence
• Circular frequency shift
• Complex conjugate properties
• Circular convolution
• Circular correlation
• Multiplication of two sequences
• Perseval’s Theorem

Kazi Afra Nawer, Lecturer, Dept of EEE, NWU, Khulna. 3

 Prove
Show that, Fourier Transform of a discrete time signal is periodic with period 𝟐𝝅.

and
Kazi Afra Nawer, Lecturer, Dept of EEE, NWU, Khulna. 4
Prove(cont.)

Kazi Afra Nawer, Lecturer, Dept of EEE, NWU, Khulna. 5

Inverse Fourier Transform (IFT)

Kazi Afra Nawer, Lecturer, Dept of EEE, NWU, Khulna. 6

Relation between DFT and Z-Transform

causal

Kazi Afra Nawer, Lecturer, Dept of EEE, NWU, Khulna. 7

To be continued……

Kazi Afra Nawer, Lecturer, Dept of EEE, NWU, Khulna. 8

Fast Fourier Transform (FFT)
Let, 𝑥(𝑛) is a real value n-point sequence, If we develop a method of
computing n-point DFT 𝑋(𝑘) that contains only the odd harmonics by
using a real 𝑛/2 point DFT, then it is called FFT.
FFT is a highly efficient procedure of computing DFT of a finite series and
it requires less no. of computation than the discrete form of DFT.

Kazi Afra Nawer, Lecturer, Dept of EEE, NWU, Khulna. 9

Application of FFT
FFT may be used in the following fields:
• Digital spectrum analysis
• Filter simulation
• Auto correlation
• Pattern recognitaion

Kazi Afra Nawer, Lecturer, Dept of EEE, NWU, Khulna. 10

Twiddle Factor

Kazi Afra Nawer, Lecturer, Dept of EEE, NWU, Khulna. 11

Properties of FFT

2
𝑃𝑟𝑜𝑣𝑒 𝑡ℎ𝑎𝑡, 𝜔𝑁 = 𝜔𝑁
2

Kazi Afra Nawer, Lecturer, Dept of EEE, NWU, Khulna. 12

Properties of FFT(cont.)

Kazi Afra Nawer, Lecturer, Dept of EEE, NWU, Khulna. 13

Properties of FFT(cont.)

Kazi Afra Nawer, Lecturer, Dept of EEE, NWU, Khulna. 14

DFT-Problem

Kazi Afra Nawer, Lecturer, Dept of EEE, NWU, Khulna. 15

DFT-Problem(cont.)

Kazi Afra Nawer, Lecturer, Dept of EEE, NWU, Khulna. 16

DFT-Problem(cont.)

17
Kazi Afra Nawer, Lecturer, Dept of EEE, NWU, Khulna.
DFT-Problem(cont.)

Kazi Afra Nawer, Lecturer, Dept of EEE, NWU, Khulna. 18

DFT

Kazi Afra Nawer, Lecturer, Dept of EEE, NWU, Khulna. 19

Kazi Afra Nawer, Lecturer, Dept of EEE, NWU, Khulna. 20