Ho Chi Minh city of Technology

Faculty of Electrical and Electronics Engineering

Department of Electronics
Subject: DSP with FPGA

REPORT
32-Point FFT/IFFT
(Report 1st)
Lectured by: Dr. Pham Hung Thinh, Ph.D
By: Huynh Thanh Du
Le Quoc Phu
Nguyen Ngoc Son
Nguyen An Thien

FOURIERSepTRANSFORM
16th, 2016

Introduction of Team-work
Theory of Fourier Transform
FFT Algorithms
32-point FFT/IFFT

Altera StratixIVGX FPGA

 Introduction of Team-work

Facebook Group

Google search

Introduction of Team-work
Discussions:
A Picture of FT Team

Works for 4 members

References
Discussion: Offline, Online

PowerPoint

Introduction of Team-work
References:

Websites:
www.altera.com
www.cmlab.csie.ntu.edu.tw/cml/dsp/trai
ning/coding/transform/fft.html
Books:
W.M Gentleman, G. Sande,
Fast Fourier Transform: for
fun and profit

 Introduction of Team-work
Software: The Quartus II software version 9.0sp1

Theory of Fourier Transform

Time-domain

Frequency-domain

2.5
2
1.5
1

Periodic FS

0.5
0
0

time, t

Continuous

2.5

(period T)

Aperiodic FT

2
1.5
1
0.5

T
1
j k t dt
Discrete ck T s(t) e
0
j2 f t

dt
Continuous S(f) s(t) e

0
0

time, t

10

12

2.5
2

Periodic DFS

1.5
1
0.5

time, tk

Discrete
2.5

Aperiodic

2
1.5

Discrete

(period T)

0
0

time, tk
6

10

12

s[n] e j 2 f n

DTFT Continuous

S(f)

DFT

2kn
N

j
~c 1 s[n] e
N

k
N
n 0

1
0.5

2kn
N

j
~c 1 s[n] e
N

k
N
n0

Discrete

Fourier series - FS
Tn hiu x(t) tun hon, chu k Tp , tn s F0 = 1/Tp

x(t )

j 2kF0t
c
e
k

1
ck x(t )e j 2kF0t dt
Tp Tp
X(f)

x(
t)

f
Tp

T
p

- F
F 0
0

Fourier transform - FT
Tn hiu x(t) khng tun hon

x(t ) X F e

j 2ft

df

X f x t e j 2ft dt

X(
)

x(t
)

- /2
/2

t
2/

2
/

10

Discrete Time Fourier Transform (DTFT)

Bin i Fourier thi gian ri rc

Tn hiu x(n) ri rc, khng tun hon

1
x ( n)
2
X

X e

j n

j n

x
n
e

11

Discrete Fourier Sequence (DFS)

Chui Fourier ri rc

Tn hiu x(n) ri rc, tun hon vi chu k N

N 1

x(n) ck e j 2kn / N
k 0

1 N 1
ck x n e j 2kn / N
N n 0

12

Discrete Fourier Transform (DFT)

Bin i Fourier ri rc
Cng thc bin i DFT N-im cho chui chiu di L:
DFT

N 1

X (k) x(n)e

j 2 kn / N

, k 0,1,2,..., N 1

IDFT

1 N 1
x n X k e j 2kn / N
N k 0

, n 0,1,2,..., N 1

13

FFT Algorithms

Fast Fourier Transform (FFT) - Gii thut bin i Fourier nhanh

Tnh trc tip DFT N im ca x(n):
Tnh trc tip cn:
2N2 php tnh hm lng gic
4N2 php nhn thc
4N(N-1) php cng thc

Chi ph tnh ton ln

t:

W N e j 2 / N
N 1

X k x(n)WNnk

Tnh i xng:
Tnh tun hon:

n 0

kN /2
M
kN
M

W
W

W
k
WN

k
N

14

Gii thut FFT phn chia theo thi gian

(Decimation in time DIT)

Xt chui x(n) c chiu di N = 2K

t g(n) = x(2n) g(n) = {x(0), x(2), }
t h(n) = x(2n + 1) h(n) = {x(1), x(3), }
DFT N im ca x(n):

X (k ) G (k ) W H (k )
k
N

N
X (k ) G (k ) W
2

N
2
N

N
, k 0,1,..., 1
2

N
H (k )
2

N
, k ,..., N 1
2

G(k), H(k) : DFT N/2 im ca g(n), h(n)

 32-point FFT/IFFT

15

8-Point FFT - Bin i Fourier nhanh 8 im

S php ton nhn: 12

S php ton cng: 24

16

32-Point FFT - Bin i Fourier nhanh 32 im

S php ton nhn: 80

S php ton cng: 160

17

Gii thut bin i Fourier ngc nhanh

Inverse Fast Fourier Transform (IFFT)
t

Wn e

X k

j 2 / N

N 1

nk
x
(
n
)
W
N
n 0

Tnh i xng:
Tnh tun hon:

kN /2
M

kN
M

Lm tng t FFT

W
W

k
N

k
N

18

Thank you for watching !