dce

2011

Chng 6

Gii thut cho bin i Fourier

(FFT)
BK
TP.HCM

2011, TS. inh c Anh V

dce

2011

Ni dung
Tnh
DFT & IDFT

Tnh
trc tip

Bin i
WN

Lc
tuyn tnh

Chia-Tr

C s 2

C s 4

DSP Gii thut cho Bin i Fourier

Tch c s

Goertzel

Chirp-z

2011, inh c Anh V

dce

2011

DFT & IDFT

Tnh DFT: xc nh chui N gi tr phc {X(k)} khi bit trc chui {x(n)}
chiu di N
N 1

DFT

X (k ) = x(n)WNkn

0 k N 1

IDFT

1
x ( n) =
N

0 n N 1

n =0
N 1

kn
X
k
W
(
)

N
k =0

Gii thut tnh DFT cng c p dng cho vic tnh IDFT

Tnh trc tip

N2 php nhn phc
N(N-1) php cng phc
phc tp : O(N2)

Bin i WN

2N2 php tnh lng gic

4N2 php nhn s thc
4N(N-1) php cng s thc
Mt s php ton ch s
v a ch np x(n)

DSP Gii thut cho Bin i Fourier

N 1

2kn
2kn
X R (k ) = [ xR (n) cos( N ) + xI (n) sin( N )]

n =0

N 1
X (k ) = [ x (n) sin( 2kn ) x (n) cos( 2kn )]

R
I
N
N
I
n =0

Gii thut tnh DFT ti u mi php ton

theo nhng cch khc nhau

Doi xung

WNk + N /2 = WNk

Tuan hoan

WNk + N = WNk
2011, inh c Anh V

dce

2011

Phng php chia-tr (1)

Nguyn tc: phn r nh vic tnh DFT N im thnh vic tnh cc DFT kch thc
nh hn cc gii thut FFT
Phng php
Gi s N=L.M
Lu tr x(n) vo mng 2 chiu L M (l: ch s hng, m: ch s ct)

N-1

x(0)

x(1)

x(2)

x(N-1)

Cch lu tr

Theo dng n = Ml + m
Theo ct n = l + mL

l
m

M-1

x(0,0)

x(0,1)

x(0,M-1)

x(1,0)

x(1,1)

x(1,M-1)

x(2,0)

x(2,1)

x(2,M-1)

x(L-1,0)

x(L-1,1)

x(L-1,M-1)

L-1

Tng t, cc gi tr DFT X(k) tnh c cng s c lu tr trong ma trn L M

(p: ch s hng, q: ch s ct)
Theo dng k = Mp + q
Theo ct k = p + qL

DSP Gii thut cho Bin i Fourier

2011, inh c Anh V

dce

2011

Phng php chia-tr (2)

N 1

X (k ) = x(n)WNkn

0 k N 1

n =0

Vi:

M 1 L 1

x(n)
X(k)

X ( p, q ) = x(l , m)WN( Mp + q )( mL +l )

: theo ct
: theo hng

m =0 l =0

WN( Mp + q )( mL +l ) = WNMLmpWNmLqWNMplWNlq
lq M 1
mq
X ( p, q ) = WN x(l , m)WM WLlp
l =0
m =0

L 1

1
2
3

DFT M im
F(l,q)
G(l,q)
DFT L im
X(p,q)

DSP Gii thut cho Bin i Fourier

WNNmp = 1
WNmqL = WNmq/ L = WMmq
WNMpl = WNpl/ M = WLpl

(1): Tnh L DFT M im

Nhn phc : LM2
Cng phc : LM(M-1)

(2): Tnh G(l,q)

Nhn phc : LM

(3): Tnh X(p,q)

Nhn phc : ML2
Cng phc : ML(L-1)

phc tp
Nhn phc : N(M+L+1)
Cng phc : N(M+L-2)
2011, inh c Anh V

dce

2011

Phng php chia-tr (3)

Hiu qu
PP tnh trc tip
Nhn phc : N2
Cng phc : N(N-1)

PP chia-tr
Nhn phc : N(M+L+1)
Cng phc : N(M+L-2)

N=1000 L=2, M=500

106 nhn phc 503,000 (~ N/2)

PP chia-tr rt hiu qu khi

Gii thut

Phn r nh hn n (v-1) ln

n = l + mL
k = Mp + q

N= r1r2r3rv
n = Ml + m
k = qL + p
Gii thut 2

Gii thut 1
1.
2.
3.
4.
5.

Lu tr t/h theo ct
Tnh DFT M im ca mi hng
Nhn ma trn kt qu vi h s pha WNlq
Tnh DFT L im ca mi ct
c ma trn kt qu theo hng

DSP Gii thut cho Bin i Fourier

1.
2.
3.
4.
5.

Lu tr t/h theo hng

Tnh DFT L im ca mi ct
Nhn ma trn kt qu vi h s pha WNpm
Tnh DFT M im ca mi hng
c ma trn kt qu theo ct

2011, inh c Anh V

dce

2011

Phng php chia-tr (4)

M hnh tnh ton DFT 6 im thng qua vic tnh DFT 3 im v DFT 2 im
W6lq
X(2)

x(2)x(5)

X(5)
X(1)
DFT 2 im

x(4)

x(0)x(3)
x(1)

X(4)
X(0)
X(3)

Gii thut tnh FFT c s 2

Nu N = r1r2r3rv = rv m hnh tnh DFT c cu trc u (ch dng 1 DFT r im)

r = 2 FFT c s 2
Chn M = N/2 v L = 2
x(0)

Gii thut
chia theo thi gian

m=0

x(1)

x(2)

m=1

x(N-1)

m=M-1

l=0

x(0)

x(2)

x(N-2)

f1(2n)

l=1

x(1)

x(3)

x(N-1)

f2(2n+1)

DSP Gii thut cho Bin i Fourier

n= 0,1, , N/2-1

2011, inh c Anh V

dce

2011

FFT c s 2 (1)
N 1

X (k ) = x(n)WNkn

k = 0,1,..., N 1

n =0

kn
kn
+
(
)
(
)
x
n
W
x
n
W

N
N

n even

n old

( N / 2 ) 1

x(2m)W

m =0

X (k ) =

2 mk
N

( N / 2 ) 1

m =0

f1 (m)W

km
N /2

( N / 2 ) 1

+W

x(2m + 1)W

m =0

k ( 2 m +1)
N

WN2 = WN / 2

( N / 2 ) 1

k
N

m =0

= F1 (k ) + WNk F2 (k )

f 2 (m)WNkm/ 2

k = 0,1,..., N 1

f1 (m)

F1 (k )
DFTN / 2

k = 0,1,..., N / 2

f 2 (m)

F2 (k )
DFTN / 2

k = 0,1,..., N / 2

(
)
=
(
)
+
X
k
F
k
W
k = 0,1,.., N2 1

1
N F2 ( k )

k
N
(
+
)
=
(
)

X
k
F
k
W
k = 0,1,.., N2 1

1
N F2 ( k )
2

DSP Gii thut cho Bin i Fourier

F1(k), F2(k) tun hon

chu k N/2
F1(k+ N/2) = F1(k)
F2(k+ N/2) = F2(k)

WNk + N / 2 = WNk
2011, inh c Anh V

dce

2011

FFT c s 2 (2)

G1 (k ) = F1 (k )

G2 (k ) = WNk F2 (k )

k = 0,1,.., N2 1
k = 0,1,.., N2 1

G1(k)
G2(k)

X (k ) = G1 (k ) + G2 (k )

N
X
k
(
+
2 ) = G1 ( k ) G2 ( k )

DFT2

k = 0,1,..., N2 1

X(k)
X(k+ N/2)
k=0,1,,(N/2-1)

k = 0,1,..., N2 1

DFT
2 im
DFT
DFT
2 im
DFT
2 im
2 im
DSP Gii thut cho Bin i Fourier

2011, inh c Anh V

dce

2011

FFT c s 2 (3)
Tip tc phn f1(n) v f2(n) thnh cc chui N/4 im

v11 (n) =

v12 (n) =

v21 (n) =
v (n) =
22

f1 (2n)

n = 0,1,..., N4 1

f1 (2n + 1)

n = 0,1,..., N4 1

f 2 ( 2n )

n = 0,1,..., N4 1

f 2 (2n + 1)

n = 0,1,..., N4 1

F1 (k ) = V11 (k ) + WNk / 2V12 (k )

k
N
F1 (k + 4 ) = V11 (k ) WN / 2V12 (k )

k
F
k
V
k
W
=
+
(
)
(
)
2
21
N / 2V22 ( k )
F (k + N ) = V (k ) W k V (k )
21
N / 2 22
4
2

vij(n)

DFT
N/4 im

Vij(k)

k = 0,1,..., N4 1
k = 0,1,..., N4 1
k = 0,1,..., N4 1
k = 0,1,..., N4 1

Hiu qu
DFT trc tip N=2v im
Nhn phc: N2
Cng phc: N2 N
DSP Gii thut cho Bin i Fourier

FFT c s 2

Cc DFT 2 im
Nhn phc: (N/2)log2N
Cng phc: Nlog2N
2011, inh c Anh V

10

dce

2011

FFT c s 2 (4)
V d: tnh DFT 8 im
x(0)

x(1)

x(2)

x(3)

Phn theo thi gian

x(0)

x(2)

x(4)

x(6)

x(1)

x(3)

x(5)

x(7)

x(4)

x(5)

x(6)

x(7)

[0,1,2,3,4,5,6,7]
x(0)

x(4)

x(2)

x(6)

x(1)

x(5)

x(3)

x(7)

DSP Gii thut cho Bin i Fourier

[0,2,4,6]
[0,4]

[1,3,5,7]
[2,6]

[1,5]

[3,7]

2011, inh c Anh V

11

dce

2011

FFT c s 2 (5)
Khi tnh ton c bn cho DFT 2 im (hnh con bm)
a

A = a+WNb

B = aWNb

W N

phc tp
1 nhn phc
2 cng phc

N= 2v:
+ Log2N
: tng tnh ton
+ N/2
: khi tnh ton c bn cho mi lp
B nh:
+ Vo
: (a,b) s phc
+ Ra
: (A,B) s phc
+ C th lu (A,B) ln (a,b)
Ch cn N nh phc (2N nh thc)
Tnh ton ti ch
DSP Gii thut cho Bin i Fourier

2011, inh c Anh V

12

dce

2011

FFT c s 2 (6)

x(0)

X(0)

x(4)
0
8

X(1)

-1

x(2)
0
8

W
x(6)

0
8

-1

2
8

X(2)

-1

X(3)

-1

x(1)
0
8

-1

1
8

-1

2
8

-1

W
x(5)
0
8

-1

x(3)
0
8

-1

2
8

-1

x(7)
0
8

-1

DSP Gii thut cho Bin i Fourier

3
8

-1
2011, inh c Anh V

X(4)
X(5)
X(6)
X(7)
13

dce

2011

Baseline Parallel Architecture

Size

16

8192

Pins

448

229K

Fly

32

53K

Mult

Add

Shift

10

10

10

10

11

11

11

11

12

12

12

12

13

13

13

13

14

14

14

14

15

15

15

15

16

16

16

16

DSP Gii thut cho Bin i Fourier

Parallel FFT
Butterfly structure
Removes redundant
calculation

2011, inh c Anh V

14

dce

2011

Parallel-Pipelined Architecture
Size

16

8192

Pins

448

229K

Fly

32

53K

Mult

96

159K

Add

288

480K

Shift

10

10

10

10

11

11

11

11

12

12

12

12

13

13

13

13

14

14

14

14

15

15

15

15

16

16

16

16

DSP Gii thut cho Bin i Fourier

A pipelined version
IO Bound
100% Efficient

2011, inh c Anh V

15

dce

2011

FFT c s 2 (7)
Th t chui d liu vo sau khi phn (v-1) ln

Biu din cc ch s dng nh phn

Chui sau khi phn chia s l ly theo th t o cc bit
B
nh

a
ch

B
nh

a
ch

B
nh

a
ch

x(0)

000

x(0)

000

x(0)

000

x(1)

001

x(2)

010

x(4)

100

x(2)

010

x(4)

100

x(2)

010

x(3)

011

x(6)

110

x(6)

110

x(4)

100

x(1)

001

x(1)

001

x(5)

101

x(3)

011

x(5)

101

x(6)

110

x(5)

101

x(3)

011

x(7)

111

x(7)

111

x(7)

111

Phn
chia

DSP Gii thut cho Bin i Fourier

Phn
chia

2011, inh c Anh V

16

dce

2011

FFT c s 2 (8)

Phn chia theo tn s

Phng php chia v tr

M = 2, L = N/2
Chui d liu nhp c sp xp theo ct
Phn chia X(k) thnh X(2k) v X(2k+1)
Sau c th phn chia tip tc mi X(k chn) v X(k l)

x(0)

X(0)

x(1)

DFT
4 im

x(2)
x(3)
-1
x(5)
-1
x(6)

-1

x(7)
-1

0
8
1
8
2
8
3
8

W
W
W
W

A = (a+b) WN

X(2)
X(4)
X(6)

x(4)

a
b

W N

B = (ab)WN

X(1)
DFT
4 im

DSP Gii thut cho Bin i Fourier

X(3)
X(5)
X(7)
2011, inh c Anh V

17

dce

FFT c s 4 (1)

2011

x(0)

x(2)

x(4)

x(N-1)

l,p = 0,1,2,3
m,q = 0,1,,N/4 1

L = 4, M = N/4

N = 4v

n = 4m + l
k = (N/4)p + q

m=0

m=1

m=(N/4)-1

l=0

x(0)

x(4)

x(N-4)

x(4n)

l=1

x(1)

x(5)

x(N-3)

x(4n+1)
n = 0,1,,N/4-1

l=2

x(2)

x(6)

x(N-2)

x(4n+2)

l=3

x(3)

x(7)

x(N-1)

x(4n+3)

DSP Gii thut cho Bin i Fourier

2011, inh c Anh V

18

dce

2011

FFT c s 4 (2)
lq M 1
mq lp
X ( p, q ) = WN x(l , m)WM WL
l =0
m =0

L 1

X ( p, q ) = WNlq F (l , q ) W4lp

p = 0,1,2,3

l =0

DFT N/4 im

l = 0,1,2,3

N
=
q
0
,
1
,..,
(
4 1)

N /4

F (l , q ) = x (l , m)WNmq/ 4
m =0

x(l , m) = x(4m + l )

N
X ( p, q ) = X ( 4 p + q )

X (0, q ) 1 1
X (1, q ) 1 j

=
X (2, q ) 1 1

j
X (3, q ) 1

1
1 WN0 F (0, q )

j WNq F (1, q )
1
1 1 WN2 q F (2, q )

3q
1 j WN F (3, q )

DSP Gii thut cho Bin i Fourier

2011, inh c Anh V

19

dce

2011

FFT c s 4 (3)
WN0

WNq

-j
-1
j
-1
1

WN2 q

-1
j
-1

WN3q

0
-j

q
2q

Dng rt gn
3q
DSP Gii thut cho Bin i Fourier

2011, inh c Anh V

20

dce

2011

FFT c s 4 (4)
phc tp: 1 khi tnh ton cn
+ 3 nhn phc
+ 12 cng phc
N=4v
+ Tng tnh ton
: v = log4N
+ Mi tng c
: N/4 khi tnh ton
3vN/4 = (3N/8)log2N
12vN/4 = (3N/2)log2N

: Nhn phc
: Cng phc

(gim 25% vs FFT2)

(tng 50% vs FFT2)

Biu din li nhn ma trn

X (0, q ) 1
X (1, q ) 0
=

X (2, q ) 1

X (3, q ) 0
(3N/8)log2N
Nlog2N

0 1
0 1 0 1 0 WN0 F (0, q )

1 0 j 1 0 1 0 WN F (0, q )
0 1 0 0 1 0 1 WN2 q F (0, q )

3q

j 0 1 0 1 WN F (0, q )
1 0
: Nhn phc
: Cng phc

DSP Gii thut cho Bin i Fourier

(gim 25% vs FFT2)

(bng FFT2)
2011, inh c Anh V

21

dce

2011

Hin thc cc gii thut FFT

FFT c s 2

Tnh ton hnh bm: (N/2)log2N ln

H s quay WNk: c tnh mt ln v lu trong bng
B nh: 2N nu mun vic tnh ton c thc hin ti ch

4N nu mun n gin ha cc tc v ch s v iu khin; ng thi cho php

chui nhp v xut theo ng th t

IDFT

1
x ( n) =
N

N 1

kn
X
(
k
)
W

0 n N 1

k =0

Khc nhau c bn gia vic tnh DFT v IDFT l h s 1/N v du ca h s

pha WN
o chiu s tnh DFT, i du h s pha, v chia kt qu cui cng cho N
IDFT

DFT vi s im khc 2v hoc 4v m thm cc s 0

phc tp
Tc v s hc (nhn phc, cng phc)
Cu trc hin thc ca gii thut (qui tc vs bt qui tc)
Kin trc ca cc b DSPs (x l song song cc tc v)

DSP Gii thut cho Bin i Fourier

2011, inh c Anh V

22

dce

2011

ng dng ca cc gii thut FFT

Tnh DFT ca 2 chui thc
x1(n) v x2(n): chui thc di N cn tnh DFT
nh ngha chui x(n) = x1(n) + jx2(n)
0nN1
X(k) = X1(k) + jX2(k)
(tnh tuyn tnh ca DFT)

x ( n) + x * ( n)
x1 (n) =
2
x ( n) x * ( n)
x2 ( n ) =
2j
DFTN
x* (n)
X * ( N k )

DSP Gii thut cho Bin i Fourier

]}

]}

1
X 1 (k ) = DFT [x(n)] + DFT x* (n)
2
1
X 2 (k ) = DFT [x(n)] DFT x* (n)
2

X 1 (k ) =

1
2

X 2 (k ) =

1
2

[X (k ) + X ( N k )]
[X (k ) X ( N k )]
*

2011, inh c Anh V

23

dce

2011

ng dng ca cc gii thut FFT

Tnh DFT ca chui thc 2N im

g(n): chui thc di 2N cn tnh DFT

0 n N-1
Tch thnh 2 chui x1(n) = g(2n) v x2(n) = g(2n+1)
nh ngha chui x(n) = x1(n) + jx2(n)
0 n N-1
X(k) = X1(k) + jX2(k)(tnh tuyn tnh ca DFT)

X 1 (k ) =

1
2

X 2 (k ) =

1
2

G (k )

[X (k ) + X ( N k )]
[X (k ) X ( N k )]
*

N 1

N 1

n =0

n =0

= g (2n)W22Nnk + g (2n + 1)W2(N2 n +1) k

N 1

= x1 (n)W
n =0

nk
N

+W

k
2N

N 1

nk
x
n
W
(
)
2 N
n =0

G (k )

= X 1 (k ) + W2kN X 2 (k ) k = 0,1, , N 1

G (k + N )

= X 1 (k ) W2kN X 2 (k ) k = 0,1, , N 1

DSP Gii thut cho Bin i Fourier

2011, inh c Anh V

24

dce

2011

ng dng ca cc gii thut FFT

Lc tuyn tnh cc chui d liu di

Overlap-add
Overlap-save

DFT + FFT

Phng php

h(n) p ng xung n v ca b lc (chiu di M)

c m thm L-1 s khng sao cho N = L + M 1 = 2v

H(k): DFT N im ca h(n), theo th t o nu h(n) c sp theo th t thun
(Gii thut FFT suy gim theo tn s)

xm(n) khi d liu chiu di L ( c phn ct)

c m thm M1 im (gi tr ty theo PP lc c dng)

Xm(k): DFT N im ca xm(n), cng theo th t o (Gii thut FFT suy gim theo
tn s)

Ym(k) = H(k)Xm(k)

H(k) v Xm(k) cng c th t o Ym(k) theo th t o

ym(n) = IDFTN{Ym(k)} s ng theo th t thun nu dng gii thut FFT suy gim
theo thi gian

Khng cn thit o v tr cc d liu trong vic tnh DFT v IDFT

Tnh tng quan (tng t)

DSP Gii thut cho Bin i Fourier

2011, inh c Anh V

25

dce

2011

Phng php lc tuyn tnh

FFT khng hiu qu khi tnh DFT (IDFT) ti mt s im (< log2N) tnh
trc tip
Gii thut Goertzel
Da vo tnh chu k ca WNk v biu din vic tnh ton DFT nh lc tuyn
tnh

X (k ) = W

kN
N

N 1

x(m)W

m =0

N 1

km
N

= x(m)WN k ( N m )
m =0

N 1

t yk (n) = x(m)WN k ( n m ) = x(n) * hk (n)

H k ( z) =

1
1 WN k z 1

m =0

vi

hk (n) = WN knu (n)

Mt pole trn vng trn n v

ti tn s k=2k/N

X ( k ) = y k ( n) n = N

Thay v tnh tng chp trc tip, ta c th dng PTSP

yk (n) = WN k yk (n 1) + x(n)
DSP Gii thut cho Bin i Fourier

yk (1) = 0

Vic tnh DFT ti mt im k c th

c thc hin bng cch cho t/h
i vo b cng hng mt pole
ti tn s k=2k/N
2011, inh c Anh V

26

dce

2011

Gii thut Goertzel

Kt hp tng cp cc b cng hng c pole lin hp phc

1 WN k z 1
H k ( z) =
1 2 cos(2k / N ) z 1 + z 2

Hin thc bng dng chun tc (dng II)

vk (n) = 2 cos 2Nk vk (n 1) vk (n 2) + x(n)

n = 0,1,..., N

yk (n) = vk (n) WNk vk (n 1)

n=N

Vi /k u

vk (1) = vk (2) = 0

x(n)

2 cos( 2Nk )

yk(n) c tnh duy nht mt ln cho n = N

1

Z1

vk(n) c lp li cho n = 0, 1, , N
Mi vng cn 1 php nhn thc

vk(n)

yk(n)

Wnk
Z1

Nu x(n) l t/h thc, cn N+1 php nhn thc tnh X(k) v X(N-k)
{do tnh i xng}
Gii thut Goertzel ch thch hp khi s gi tr DFT cn tnh kh nh ( log2N)

DSP Gii thut cho Bin i Fourier

2011, inh c Anh V

27

dce

2011

Gii thut B Chirp-z (1)

DFT N im ~ X(zk) vi zk = ej2kn/N , k=0,1,,N-1 (cc im cch u trn vng

trn n v)
N 1
x(n) z k n
k = 0,1,..., L 1
B Z ca x(n) ti cc im zk X ( z k ) =

n =0

Nu zk = rej2kn/N (zk l N im cch u nhau trn vng trn bk r)

N 1

X ( z k ) = [ x(n)r n ]e j 2kn / N k = 0,1,..., N 1

n =0

Vic tnh DFT c th c thc hin bng gii thut FFT cho chui x(n)r-n

Vng trn
n v

j 0
z
=
r
e
Tng qut, zk nm trn cung xon c bt u t im 0
0

i ra gc to )
Im(z)

z k = r0 e

j 0

k = 0,1, , L 1

Im(z)

Im(z)

r0

r0

Re(z)

R0 = r0 = 1
0 = 0 = 0

( R0 e

j 0 k

Re(z)

R0 = 1, r0 < 1
0 = 0 = 0

DSP Gii thut cho Bin i Fourier

(i vo hoc
Im(z)

Re(z)

R0 < 1

Re(z)

R0 > 1
2011, inh c Anh V

28

dce

2011

Gii thut B Chirp-z (2)

y (k )
X ( zk ) =
k = 0,1, , L 1
h( k )

B chirp-z

V = R0 e j0
h( n) = V

n2 / 2

g (n) = x(n)(r0 e

j 0 n

) V

n2 / 2

N 1

y ( k ) = g ( n) h( k n)

k = 0,1, , L 1

n =0

R0 = 1 h(n) = e

= n0 / 2

j 0 n 2 / 2

= e j ( n 0 / 2 ) n e j n

Tn s ca t/h m phc h(n), tng tuyn tnh theo thi gian

h(n): chirp signal

DSP Gii thut cho Bin i Fourier

2011, inh c Anh V

29

dce

2011

Gii thut B Chirp-z (3)

Xc nh tng chp vng ca chui g(n) N im v chui h(n) M im (M > N)

N-1 im u l cc im lp li
M-(N-1) im cn li cha kt qu
N 1

y ( k ) = g ( n) h( k n)

k = 0,1, , L 1

n =0

Gi s M = L + (N1)
M im ca chui h(n) c xc nh (N1) n (L1)
n = 0,1,,M1
nh ngha chui M im h1(n) = h(nN+1)
H1(k) = DFTM{h1(n)}
G(k) = DFTM{g(n)} (sau khi m thm vo g(n) L-1 s 0)
Y1(k) = G(k)H(k) y1(n) = IDFT{Y1(k)} n = 0,1,,M1
N-1 im u tin ca y1(n) l cc im lp loi b chng
Cc im kt qu l gi tr ca y1(n) khi N1 n M1
y(n) = y1(n+N-1)

X(zk)= y(k)/h(k)

n = 0,1,,L1

k = 0,1,,L1

DSP Gii thut cho Bin i Fourier

2011, inh c Anh V

30