Xulythso 9682

Bi ging x l
tn hiu s
BM K Thut My Tnh - Trung tm K Thut My Tnh - H KTCN Thi Nguyn

Bi ging X L Tn Hiu S
http://www.ebook.edu.vn
Chng
1
Tn hiu v h thng ri rc
I. M u
Tn hiu s l tn hiu c biu din bng mt dy s. X l tn hiu s bao hm
mi php x l cc dy s c c cc thng tin cn thit nh phn tch, tng hp, m
ho, c bit l loi b giao thoa tn hiu, loi b nhiu, nhn c ph tn hiu, bin i
tn hiu sang dng mi ph hp hn. Nhn chung, cc h thng x l tn hiu phc tp u
da trn cc php x l c bn sau:
1. Tch chp.
2. Tng quan, bao gm hai loi: t tng quan v tng quan cho. Hm tng
quan cho dng o mc tng t nhau gia hai tn hiu. N c dng phn tch
ph cho, pht hin tn hiu trn mt nn nhiu nh vic pht hin tn hiu phn hi
trong k thut rada, tm mu tng ng nhau trong nhn dng, o tr.
3. Lc s: l mt thao tc c bn, thng c s dng nhm kh nhiu, chn bng
thng.
4. Cc php bin i ri rc: cho php biu din tn hiu ri rc trong khng gian
tn s hoc chuyn i gia thi gian v tn s. Ph ca tn hiu c th nhn c bng
cch phn nh n thnh cc thnh phn tn s.
5. iu ch. Tn hiu s thng khng c truyn i trn ng di hoc lu tr
vi s lng ln. Tn hiu thng c iu ch lm cho c tnh tn s ca n ph hp
vi cc c tnh ca ng truyn hoc ca phng tin lu tr nhm lm gim ti thiu
mo, nhm s dng bng tn mt cch c hiu qu hoc nhm m bo tn hiu c mt s
tnh cht mong mun.
X l tn hiu s ngy cng c s dng trong nhiu lnh vc m trc y tn
hiu tng t c dng l chnh; ngay c trong nhng lnh vc rt kh hoc khng th p
dng vi tn hiu tng t. X l tn hiu s c nhng im u vit sau:
1. chnh xc cao: chnh xc ph thuc vo s bits dng biu din tn hiu
s.
2. Sao chp trung thc nhiu ln.
3. Tnh bn vng: cc h thng x l tn hiu s khng b nh hng bi nhit
hay thi gian nh cc h thng tng t.
4. Tnh linh hot v mm do: chc nng x l ca cc h thng x l tn hiu s
hon ton c th can thip bng phn mm, do m bo tnh linh hot v mm do.
I.1. Cc nh ngha
a. Tn hiu
Tn hiu l biu din vt l ca thng tin.
V d:
- Cc tn hiu nhn thy l cc sng nh sng mang thng tin ti mt ta.
Ng Nh Khoa - Photocopyable

- Cc tn hiu nghe thy l cc s bin i ca p sut khng kh truyn thng tin

ti tai.
b. Biu din ton hc ca tn hiu
V mt ton hc, tn hiu c biu din bi mt hm ca mt hoc nhiu bin c
lp.
V d: Tn hiu ca tai nghe Sa(t) l hm mt bin s (bin thi gian t), c biu din
nh sau:
Sa(t)
Hnh 1.1. Tn hiu tai nghe.

c. nh ngha tn hiu lin tc
- Nu bin c lp ca s biu din ton hc ca mt tn hiu l lin tc, th tn
hiu c gi l lin tc.
Da vo bin , tn hiu lin tc c phn thnh thnh tn hiu tng t v tn
hiu lng t ho.
+. Tn hiu tng t:
Nu bin ca tn hiu lin tc l lin tc th tn hiu c gi l tn hiu
tng t.
+. Tn hiu lng t ho:
Nu bin ca tn hiu lin tc l ri rc th tn hiu c gi l tn hiu lng
t ho.
V d: Biu din cc tn hiu tng t v tn hiu lng t ho nh cc hnh 1.2a v 1.2b
Xd(t)
xa(t)
99
69
39
9
0
(a)
(b)
Hnh 1.2. tn hiu tng t (a) v tn hiu lng t ho (b).

d. nh ngha tn hiu ri rc
- Nu tn hiu c biu din bi hm ca cc bin ri rc, th tn hiu c gi
l tn hiu ri rc.
Da vo bin , tn hiu ri rc c phn thnh tn hiu ly mu v tn hiu s.
- Tn hiu ly mu
Nu bin ca tn hiu ri rc l lin tc (khng c lng t ho) th c
gi l tn hiu ly mu, tn hiu ny thu c nh ly mu t tn hiu tng t.
- Tn hiu s
Nu bin ca tn hiu ri rc l ri rc, th tn hiu c gi l tn hiu s.
xs(nTs)
xd(nTs)
99
69
39
9
(a)
(b)
Hnh 1.3. tn hiu ly mu (a) v tn hiu s (b).
II. Tn hiu ri rc
II.1. Biu din tn hiu ri rc.
a. Biu din ton hc
Tn hiu ri rc c biu din bng mt dy cc gi tr thc hoc phc, nu n
c hnh thnh bi cc gi tr thc, th n c gi l tn hiu thc; cn nu c hnh
thnh bi cc gi tr phc, th c gi l tn hiu phc.
Ta a vo cc k hiu nh sau: xs(nTs): tn hiu ly mu; xd(nTs): tn hiu s v
x(nTs): l tn hiu ri rc ni chung. tin cho cch biu din tn hiu ri rc, chng ta
s chun ho bin s c lp nTs bi chu k ly mu Ts (tng ng trong min tn s,
chun ho theo tn s ly mu Fs) nh sau:
x(nTs)
chun ho bi Ts
x(n)
Cch biu din ton hc tn hiu ri rc x(n) c th nh sau:
Math Equation
x (n ) =
0
N1 n N 2
n < N1 and n > N 2
(1.2.1)
b. Biu din th
V d:
Biu din ton ca mt tn hiu ri rc nh sau:

n
1
x (n ) = 4
0
0n4
n < 0 and n > 4
Biu din th ca tn hiu ri rc trn nh hnh 1.4.
x(n)
1
0,5
-1 0
Hnh 1.4. Biu din th tn hiu ri rc.

II.2. Mt s dy c bn.
a. Dy xung n v.
Trong min n, dy xung n v c nh ngha nh sau:
1 n = 0
0 n 0
(n ) =
(1.2.2)
b. Dy nhy n v.
Trong min n, dy nhy n v c nh ngha nh sau:
1 n 0
u (n ) =
0 n < 0
(1.1.3)
c. Dy ch nht.
Trong min n, dy ch nht c nh ngha nh sau:
1 0 n N1
rect N (n ) =
0 n < 0 and n > N1
(1.2.4)
d. Dy hm m thc.
Trong min n, dy hm m thc c nh ngha nh sau:
a n 0 n
e( n ) =
0 n < 0
(1.2.5)
Dy ny tng hoc gim tu thuc vo tham s a ln hn hay nh hn 1. nh hnh 1.5(a

v b)

e(n)
e(n)
1
1
0
(a). a<1
(b). a>1
Hnh 1.5. Biu din th dy hm m thc.
e. Dy sin.
Trong min n, dy sin c nh ngha nh sau:
s(n) = sin(0n).
th ca s(n) c biu din trn hnh 1.6, vi 0 =
sin(
(1.2.6)
2
8
2
n)
8
-1
Hnh 1.6. Biu din th dy sin.
II.3. Cc php ton i vi tn hiu ri rc.
a. Tng ca hai dy.
nh ngha: Tng ca hai dy nhn c bng cch cng tng i mt cc gi tr
mu i vi cng mt tr s ca bin c lp.
b. Tch ca hai dy.
Tch ca hai dy nhn c bng cch nhn tng i mt cc gi tr mu i vi
cng mt tr s ca bin c lp.
y(n)
x(n)
x(n) +y(n)
c. Tch vi hng s.
Tch ca mt dy vi mt hng s nhn c bng cch nhn tt c cc gi tr mu
ca mt dy vi chnh hng s .
y(n)
x(n)
x(n).y(n)
5

d. Tr (php dch)
Ta ni rng dy x2(n) l dy lp li tr ca dy x1(n) khc nu ta c:

x2(n) = x1(n-n0):
vi mi n, n0 nguyn.
V d trn hnh 1.7 biu din th hai dy x1(n) v x2(n), vi x2(n) = x1(n-1).
x1(n)
x2(n)
1
0
1
1
6 n
Hnh 1.7. Biu din tn hiu tr.

III. Cc h thng tuyn tnh bt bin
Do tnh kh hin ca h thng tuyn tnh bt bin v c l thuyt v thc hnh,
nn trong gio trnh ny, chng ta ch hn ch nghin cu cc h tuyn tnh bt bin.
III.1. Cc h thng tuyn tnh
a. nh ngha
Mt h thng tuyn tnh c c trng bi ton t T (lm nhim v bin i dy
vo x(n) thnh dy ra y(n)) tho mn nguyn l xp chng, tc l:
T[ax1(n) + bx2(n)] = aTx1(n) + bTx2(n) = ay1(n) + by2(n)
(1.3.1)
trong : a, b l cc hng s, y1(n) l p ng ca kch thch x1(n) v y2(n) l p ng ca
kch thch x2(n).
b. p ng xung ca h thng tuyn tnh.
Mt dy bt k x(n) c th c biu din bng tng:
x (n ) =
x (k ) (n k )
k =
Vi h thng tuyn tnh, ta c:
y(n ) = T[x (n )] = T x (k ) (n k ) = x (k )T[ (n k )]

k =
k =
(1.3.2)
Nu k hiu hk(n) l p ng ca h thng vi kch thch (n-k), c ngha: hk(n) =

T[(n-k)].
Vo (n-k)
Ra
T
T[(n-k)] = hk(n)

Cui cng ta c: y(n ) =
x (k )h
k =
(n ) . p ng hk(n) c gi l p ng xung ca
h thng tuyn tnh.

Nhn xt:
- Cc h thng tuyn tnh c c trng hon ton bi p ng xung ca n.
- hk(n) l hm ca k v n, nh vy cc gi tr k khc nhau s cho ta cc p ng
xung khc nhau, h thng tuyn tnh ny s ph thuc vo bin k, nu k l bin thi
gian, th ta c h thng tuyn tnh ph thuc thi gian.
Sau y chng ta s kho st h thng tuyn tnh bt bin theo k.
III.2. Cc h thng tuyn tnh bt bin.
a. nh ngha.
Nu y(n) l p ng ca kch thch x(n), th h thng tuyn tnh gi l tuyn tnh
bt bin (TTBB) khi y(n-k) l p ng ca kch thch x(n-k): (k nguyn).
V d: H thng y(n) = 2x(n) +3x(n-1) l h thng TTBB.
b. Tch chp.
Khi h thng l TTBB th ta c quan h sau:
T[(n)] = h(n)
T[(n-k)] = h(n-k) = hk(n).
v:
y( n ) =
x (k )h k (n ) =
k =
x (k )h (n k )
(1.3.3)
k =
Khi , hk(n) l p ng xung ca h thng tuyn tnh. Cn h(n) l p ng xung

ca h thng TTBB, khng ph thuc vo k, tc l nu bin l thi gian th ti mi thi
im khc nhau p ng xung ca h thng TTBB lun l h(n). Nh vy, p ng xung
h(n) s c trng hon ton cho mt h thng TTBB.
v ta c quan h:
y( n ) =
x (k )h (n k ) = x (k ) * h (n )
(1.3.4)
k =
Quan h (1.3.3) c gi l tch chp ca x(n) v h(n).

Ch : Tch chp ny ch ng vi h thng TTBB, v n c nh ngha ch cho h
thng ny.
V d:
n
1
4
0
Cho x(n) = rect5(n) v h ( n ) =
0n4
n < 0, n > 4
Tnh tch chp x(n)*h(n).

Gii:
T cng thc tch chp (1.3.3):
y( n ) = x ( k ) * h ( n ) =
x (k )h (n k )
k =
ta thc hin cc bc:

- i bin s n thnh k
x(k) = rect5(k)

nk
0 nk 4
1
h (n k ) =
4
0
n k < 0, n k > 4
0k4
k < 0, k > 4
1
x (k ) =
0
Nn ta c: Tng k ch cn tnh t 0 n 4 v n ch xc nh t 0 n 8.
- Vi n = 0 ta c: y(0) =
x (k )h (k ) =1.1 + 1.0 + 1.0 + 1.0 + 1.0 = 1

k =0
4
x (k )h (1 k ) =1.0,75 + 1.1 + 1.0 + 1.0 + 1.0 = 1,75
- Vi n = 1 ta c: y(1) =
k =0
- Vi n = 2 ta c: y( 2) =
x (k)h (2 k ) =1.0,5 + 1.0,75 + 1.1 + 1.0 + 1.0 = 2,25

k =0
- Vi n = 3 ta c: y(3) =
x (k )h (3 k) =1.0,25 + 1.0,5 + 1.0,75 + 1.1 + 1.0 = 2,5

k =0
- Vi n = 4 ta c: y( 4) =
x (k )h (4 k ) =1.0 + 1.0,25 + 1.0,5 + 1.0,75 + 1.1 = 2,5

k =0
- Vi n = 5 ta c: y(5) =
x (k )h (5 k ) =1.0 + 1.0 + 1.0,25 + 1.0,5 + 1.0,75 = 1,5

k =0
- Vi n = 6 ta c: y(6) =
x (k )h (6 k ) =1.0 + 1.0 + 1.0 + 1.0,25 + 1.0,5 = 0,75

k =0
- Vi n = 7 ta c: y(7) =
x (k )h(7 k ) =1.0 + 1.0 + 1.0 + 1.0 + 1.0,25 = 0,25

k =0
- Vi n = 8 ta c: y(8) =
x (k )h (8 k ) =1.0 + 1.0 + 1.0 + 1.0,25 + 1.0 = 0

k =0
Cui cng, ta c y(n) c biu din bng th sau:
x(n)
y(n) = x(n)*h(n)
1
0
h(n)
2,5
1,5
1
1 2
3 4
Hnh 1.8. th p ng ra ca h thng TTBB


c. Cc tnh cht ca tch chp

- Tch chp c tnh cht giao hon.
y(n) = x(n)*h(n) = h(n)*x(n).
Chng minh: T biu thc: y(n ) =
(1.3.5)
x (n k )h (k ) .
k =
Thay bin: n - k = l k = n - l; k : - -> l : + v k : + -> l : -
x (n l)h (l) =
l = +
h(l)x (n l)
y(n) = h(n)*x(n).
l =
- Tch chp c tnh kt hp.

y(n) = x(n)*[h1(n) * h2(n)] = [x(n)*h1(n)]*h2(n).
(1.3.6)
Quan h (1.3.6) cho thy vic mc ni tip hai h thng TTBB c p ng xung
h1(n) v h2(n) s tng ng vi mt h thng TTBB c p ng xung l tch chp ca
h1(n) v h2(n).
Chng minh:
x (n ) * [h 1 (n ) * h 2 (n )] =
x (k )[h (n k ) * h
1
k =
x (k )[h
k =
(n k ) * h 1 (n k )]
x (k ) h
k =
( n k )]
l =
(l)h 1[(n k ) l]
x(k )h [(n l) k]h

1
l = k =
(l)
= [x (n ) * h 1 (n )]* h 2 (n )
- Tch chp c tnh phn phi.

y(n) = x(n)*[h1(n) + h2(n)] = [x(n)*h1(n)] + [x(n)*h2(n)]
(1.3.7)
Quan h (1.3.7) cho thy vic mc song song hai h thng TTBB c p ng xung
h1(n) v h2(n) s tng ng vi mt h thng TTBB c p ng xung l tng ca h1(n) v
h2(n).
Chng minh:
x (n ) * [h 1 (n ) + h 2 (n )] =
x (k )[h (n k ) + h
1
k =
x (k )h 1 (n k ) +
k =
(n k )]
x (k )h
k =
(n k )
= [x (n ) * h 1 (n )] + [x (n ) * h 2 (n )]
V d: Cho ba h thng tuyn tnh bt bin h1(n), h2(n) v h3(n), theo s sau (hnh 1.9):
h1(n)
h3(n)
h2(n)
Hnh 1.9. S h thng TTBB

n
1
Vi: h 1 ( n ) = 2
0
0n2
h2(n) =
1
(n 1) + u (n 2) u (n 6)
2
v h3(n) = rect11(n). Tnh h(n) ca h thng.

Gii: T s ca h thng ta c p ng xung ca h thng xc nh nh sau:
h(n) = [h1(n) + h2(n)]*h3(n). Biu din cc p ng xung dng th nh sau (hnh
1.10):
h1(n)
1
0,5
0 1 2
h2(n)
0 1 2 3 4 5 6
h1(n)+h2(n) = rect6(n)
0 1 2 3 4 5 6
h3(n)=rect11(n)
0 1 2 3 4 5 6 7 8 9 10
6
h(n)
5
4
3
2
1
0
2 3 4
5 6 7
8 9 10 11 12 13 14 15 16
Hnh 1.10. Biu din p ng xung ca h thng.
10

III.3. H nhn qu.
a. nh ngha
Mt h thng TTBB gi l nhn qu nu p ng ra ca n mt thi im bt k

ch ph thuc vo kch thch ca n trong qu kh hoc hin ti (c lp cc thi im
tng lai).
b. p ng xung ca h nhn qu.
nh l:
p ng xung ca h nhn qu phi bng 0 (h(n) = 0) vi mi n < 0.
Chng minh:
Gi s ta c hai kch thch x1(n) v x2(n): x1(n) = x2(n)
vi n<n0.
vi nn0.
x1(n) x2(n)
Ta c p ng ra ca h thng TTBB:
y1 ( n ) =
y 2 (n ) =
x (k )h (n k )
k =
k =
(k )h (n k )
Nu h ny l h nhn qu th ta c: y1(n) = y2(n) vi n < n0. Bin i tng trn ta c:
y1 ( n ) =
y 2 (n ) =
n 0 1
k =
k =n 0
n 0 1
k =
k =n 0
x 1 (k )h (n k ) + x 1 (k )h (n k )
x 2 (k )h (n k ) + x 2 (k )h (n k )
Vi k < n0 ta c:
y1 ( n ) y 2 ( n ) =
=
x (k )h (n k ) x
k =n 0
k =n 0
[x (k ) x
k =n 0
(k )h (n k )
( k ) ]h ( n k )
V vi k n0 ta c: x1(k) x2(k); mt khc vi n < n0 th y1(n) = y2(n). Do , h(n-k) =

h(m) = 0 vi m = n - k < 0.
- i vi h TTBB v nhn qu, dng chung ca cng thc tnh tng chp s n
gin thnh:
y( n ) =
k =
k =
k =0
x (k )h (n k ) = x (k )h (n k ) = x (n k )h (k )
(1.3.8)
- Nu p ng xung c di hu hn N th:
N
y( n ) = x ( n k ) h ( k )
(1.3.9)
k =0
III.4. H thng tuyn tnh bt bin n nh.

a. nh ngha:
Mt h thng c gi l n nh, nu v ch nu vi dy u vo hu hn, ta c
dy u ra hu hn.
b. nh l:
Mt h thng TTBB l n nh khi v ch khi p ng xung ca n tho mn iu
kin sau:
11

S=
h (n ) <
(1.3.10)
n =
Chng minh: Ta cn chng minh iu kin cn v h thng n nh.

- iu kin : nu vi x(n) b chn vi mi n m ta c:
S=
h (n ) <
th y(n) < vi mi n.
n =
k =
k =
k =
Ta c: y( n ) =
h ( k ) x ( n k ) y( n ) = h ( k ) x ( n k ) h ( k ) x ( n k )
Nh vy, nu kch thch x(n) b hn ch, th ta c: x(n) M <: vi mi n (n). Khi

: y(n ) M
h (k )
k =
Theo gi thit, nu:
h (k ) <
th : y( n ) < vi mi n.
k =
- iu kin cn: theo nh ngha h n nh, ta phi c y(n) < vi mi n. Do iu kin

cn c th c chng minh ti mt mu n no m y(n) khng b chn vi gi thit tng
khng b chn.
Ta xt mu n = 0.
y( n ) =
x (k )h (n k ) :
n = 0 y(0) =
k =
x (k )h ( k )
k =
Gi s cho tc ng x(0) = 1 nu h(-n) > 0 v ngc li: x(0) = -1 nu h(-n) < 0.

Khi : y(0) =
k =
k =
x (k )h (k ) = h (k ) = . Do vy tn hiu ra khng b chn nu
khng tho mn iu kin (1.2.10).

V d:
Vi h c p ng xung dng h(n) = an.u(n).
Ta thy: p ng xung ca h h(n) = 0 vi n < 0; do y l h nhn qu. xt tnh n
nh ta c:
S=
n =
n =0
h ( n ) = a .
n
Chui lu tha ny s hi t v S = 1/(1-a) vi a<1. N s phn k nu a> 1. Do

vy h ch n nh nu a<1.
IV. Cc phng trnh sai phn tuyn tnh h s hng
IV.1. Phng trnh sai phn tuyn tnh
V mt ton hc, kch thch vo x(n) v p ng ra y(n) ca hu ht cc h thng
tuyn tnh tho mn mt phng trnh sai phn tuyn tnh sau:
N
k =0
r =0
a k ( n ) y( n k ) = b r ( n ) x ( n r )
(1.4.1)
Trong N, M nguyn dng, N l bc ca phng trnh sai phn. Trong phng

trnh ny, tp hp cc h s ak(n) v br(n) s biu din ton b hnh vi ca h thng vi
mt gi tr n cho trc.
IV.2. Phng trnh sai phn tuyn tnh h s hng
12

a. Dng tng qut
Trong chng trnh, i tng nghin cu l cc h thng TTBB. Cc h thng ny

c dy vo v ra ca h thng lin h vi nhau bi mt phng trnh sai phn tuyn tnh
h s hng bc N nh sau:
N
a
k =0
y( n k ) = b r x ( n r )
(1.4.2)
r =0
Khi , tp hp cc h s ak v br c trng cho h thng TTBB.

T (1.4.2), nu a0 0 th ta c:
M
r =0
k =1
y( n ) = b' r x ( n r ) a ' k y( n k )
b
a
b' r = r ; a ' k = k
a0
a0
(1.4.3)
V d:
Xt phng trnh sai phn bc nht: y(n) = ay(n-1) + x(n). Tm p ng xung ca
h thng vi iu kin u y(n) = 0 vi n <0.
Gii:
Gi thit kch thch l dy xung n v: x(n) = (n). khi p ng ra chnh l p
ng xung ca h thng: y(n) = h(n).
- Vi iu kin u: y(n) = 0
vi
n<0 ta c:
h(n) = 0
vi
n < 0.
(1)
h(0) = ah(-1) + (0) = a.0 + 1 = 1.
h(1) = ah(0) + (1) = a.1 + 0 = a.
h(2) = ah(1) + (2) = a.a + 0 = a2.
(2)
h(3) = ah(2) + (3) = a.a2 + 0 = a3.
h(n) = ah(n-1) + (n) = an.

Kt hp (1), (2) ta c: h(n) = an u(n). y l h thng nhn qu.
b. Nghim tng qut ca phng trnh sai phn tuyn tnh (PTSPTT) h s hng.
Cc bc gii h PTSPTT h s hng:
1. Tm nghim tng qut ca phng trnh thun nht
Phng trnh sai phn thun nht c dng:
N
a k y( n k ) = 0
(1.4.4)
k =0
Thng thng, nghim ca (1.4.4) c dng m: y0(n) = n. Thay vo (1.4.4) ta c:

(1.4.5)
a0N + a1N -1 + a2N - 2 +aN-1 + aN = 0
Phng trnh ny gi l phng trnh c trng ca h thng, a thc v tri gi l a
thc c trng bc N.
Phng trnh c trng s c N nghim, cc nghim c th l thc hoc phc. Nu
cc nghim trng nhau, ta c nghim bi. Nu cc h s ai ca phng trnh l thc th cc
nghim phc s l cc cp lin hp.
Gi i : i = [1, N] l cc nghim n, ta s c nghim tng qut ca phng trnh sai
phn thun nht di dng sau:
13

y 0 (n ) = A1 1n + A 2 2n + ... + A N Nn = a k kn
(1.4.6)
k =1
trong : Ai l cc hng s c xc nh theo cc iu kin u.

2. Tm nghim ring ca phng trnh sai phn khng thun nht.
Nghim ring yp(n) thng c chn ging nh dng ca x(n).
3. Tm nghim tng qut ca phng trnh sai phn.
Nghim tng qut ca PTSPTT s l tng ca nghim tng qut ca PTSPTT
thun nht v nghim ring ca PTSPTT.
y(n) = y0(n) + yp(n).
(1.4.7)
4. Tm cc h s nh cc iu kin u.
V d: Gii phng trnh sai phn sau: y(n) + 2y(n-1) = x(n), vi iu kin u y(-1) = 0 v
x(n) = n.
Gii:
- Tm nghim tng qut ca phng trnh thun nht: y(n) + 2y(n-1) = 0
qut y0(n) c dng: n. Thay vo ta c (*) :
n + 2n-1 = 0 n-1( +2 ) = 0 = -2.
Nh vy phng trnh c trng ch c mt nghim n 1 = -2.
y0(n) = A11n = A1(-2)n

- Tm nghim ring, dng ging x(n) = n:
yp(n) = Bn + C
trong : B v C l cc hng s cn xc nh.
Thay vo PTSPTT ta c:
Bn + C + 2B(n-1) + 2C = n 3Bn + 3C - 2B = n.
1
3
ng nht cc h s ta c: B = ;
y p (n ) =
C=
(*)
, nghim tng
(a)
2
9
n 2
+
3 9
(b)
- Tm nghim tng qut y(n):
n
3
2
9
y(n) = y0(n) + yp(n) = A1 ( 2) n + ( + )
(c)
- Xc nh h s A1:
Theo gi thit, y(-1) = 0. Thay vo (c) ta c:
2
1 2
+ ) = 0 A1 =
3 9
9
1
2
Vy nghim ca PTSPTT l: y( n ) = n + 1 ( 2) n
3
9
y(1) = A1 (2) 1 + (
IV.3. p ng xung hu hn v v hn
Trong thc t k thut, ngi ta thng phn bit hai trng hp ca p ng
xung: h c p ng xung hu hn v h c p ng xung v hn. Ta s kho st cc h
trn ng vi cc trng hp PTSPTT h s hng sau:
N
T PTSPTT h s hng ca h:
a
k =0
y( n k ) = b r x ( n r )
r =0
14

br
x (n r ) ;
r =0 a 0
y( n ) =
+. Nu N = 0, th phng trnh tr thnh:
h (n ) =
t:
a0 0.
M
bn
; Ta s c: y( n ) = h ( r ) x (n r )
a0
r =0
y chnh l tch chp gia h(n) v x(n) khi h(n) l nhn qu v c chiu di hu
hn: L[h(n)] = M+1; h(n) chnh l p ng xung ca h thng khng quy hay h thng
c p ng xung chiu di hu hn (FIR system).
+. Nu N 0, th phng trnh tr thnh:
M
r =0
k =1
y( n ) = b' r x ( n r ) a ' k y( n k )
a0 0.
b
a
b' r = r ; a ' k = k
a0
a0
Trong quan h trn ta thy rng br v ar l cc hng s, vy h thng ny c p

ng ra ph thuc vo kch thch thi im hin ti v qu kh v vo c p ng ra
thi im qu kh.
Nu gii phng trnh trn vi x(n) = (n) xc nh p ng xung h(n) ta s thy
p ng xung ca h thng ny c chiu di v hn. H thng ny c gi l h thng
quy hay h c p ng xung di v hn (IIR system).
IV.4. Cc phn t thc hin h thng TTBB.
Nh c PTSPTT h s hng, chng ta c th thc hin trc tip cc h thng s
bng cc phn t sau:
a. Cc phn t thc hin.
Cc phn t trn c biu din nh trong cc hnh sau:
x(n)
y(n) = x(n-1)
D
x(n)
Phn t tr
y(n)= a.x(n)
Phn t nhn vi hng s
x1(n)
y( n ) = x i ( n )
x2(n)
i =1
Phn t cng
xn(n)
Hnh 1.11. Cc phn t c bn.
b. Phng trnh sai phn ca cc h thng.
M
- H thng khng quy:
y( n ) = b 0 x ( n ) + b r x ( n r )
r =1
- H thng quy:
r =1
k =1
y( n ) = b 0 x ( n ) + b r x ( n r ) + ( a k ) y( n k )
15

y( n ) = b 0 x ( n ) + ( a k ) y( n k )
- H thng quy thun tu:
k =1
c. Thc hin cc h thng ri rc

Mt h thng TTBB nhn qu v n nh l h thng thc hin cc v mt vt
l, cho d l h thng l khng quy, quy hay quy thun tu.
Da vo phng trnh sai phn h s hng ca tng h thng ny, ta c th xy
dng s khi tng qut ca chng nh sau (hnh 1.12):
M
y( n ) = b 0 x ( n ) + b r x ( n r )
r =1
1
4
4244
3
- H thng khng quy:
F1 [x ( n 1),..., x ( n M ) ]
y( n ) = b 0 x ( n ) +
- H thng quy
b r x ( n r ) + ( a k ) y( n k )
r =1
k =1
1
42
4 43
4 1
442443
F1 [x ( n 1),..., x ( n M ) ]
F2 [y ( n 1),..., y ( n N ) ]
y( n ) = b 0 x ( n ) + ( a k ) y( n k )
k =1
1
442443
- H thng quy thun tu
F2 [ y ( n 1),..., y ( n N ) ]
y(n)
x(n)
+
b0
F[x(n-1), x(n-2),, x(n-M)]
F[x(n), x(n-1), x(n-2),, x(n-M)]

Hnh 1.12a. H thng khng quy
y(n)
x(n)
b0
F1[x(n-1), x(n-2),, x(n-M)]
F2[y(n-1), y(n-2),, y(n-N)]
F[y(n-1),, y(n-N), x(n), x(n-1), x(n-2),, x(n-M)]

Hnh 1.12b. H thng quy
V d: Cho phng trnh sai phn tuyn tnh h s hng:
y(n) = b0x(n) + b1x(n-1) + b2x(n-2) + b5x(n-5)
V s thc hin h thng m t bi phng trnh ny.
Gii:
y l h thng khng quy: N = 0, M = 5. S ca h thng nh sau:
16

x(n)
b1
b2
b5
b0
+
y(n)
V. tng quan ca cc tn hiu

V.1. M u
Trong vic x l tn hiu, chng ta lun cn phi so snh cc tn hiu vi nhau,
chng hn nh trong k thut raa, raa s pht tn hiu tm mc tiu l x(n), tn hiu
ny nu gp mc tiu s phn x tr li nhng b tr i mt thi gian D = n0Ts (Ts l chu
k ly mu), suy gim ca tn hiu vi h s A, tc l tn hiu nhn c l A.x(n - n0).
Ngoi tn hiu phn x ny cn c cc tn hiu nhiu cng can thip (n). Vy tn hiu tng
cng m raa nhn c s l:
y(n) = ax(n - n0) + (n).
Nu khng c mc tiu th :
y(n) = (n).
So snh hai tn hiu x(n) v y(n) ta s pht hin c c mc tiu hay khng, t
c th xc nh c v tr cng nh tnh cht ca mc tiu. Mt phng php so snh
thng c s dng nht l tng quan, s trnh by di y.
V.2. Tng quan cho v t tng quan
a. Tng quan cho
Gi s ta c hai dy x(n) v y(n), ti thiu mt trong hai dy c nng lng hu
hn. Tng quan cho ca x(n) v y(n) c nh ngha nh sau:
rxy (n ) =
x ( m) y( m n )
(1.5.1)
m =
b. T tng quan
Trong nh ngha v tng quan cho, nu x(n) = y(n) th quan h trn tr thnh t
tng quan. T tng quan c nh ngha nh sau:
rxx (n ) =
x ( m) x ( m n )
(1.5.2)
m =
17

chng
2
Php bin i Z
I. M u
Trong chng 1, chng ta kho st tn hiu v h thng ri rc trong min bin
s c lp t nhin. y l cch kho st trc tip, tuy nhin trong nhiu trng hp cch
ny gp kh khn v ni chung hiu qu khng cao.
Ngoi phng php ny, chng ta c th dng nhiu phng php kho st gin
tip khc thng qua cc k thut bin i. Cc bin i ny lm nhim v chuyn min
bin s c lp t nhin sang cc min khc v nh vy tn hiu v h thng ri rc s
c biu din trong cc min mi vi cc bin s mi. Mi cch bin i s c nhng
thun li ring ca n, tu tng trng hp c th m ta ng dng chng. Sau khi
kho st xong tn hiu v h thng ri rc trong min cc bin s mi ny, nu cn thit
chng ta li c th dng cc php bin i ngc a chng v min bin s c lp t
nhin.
Cc phng php kho st gin tip ni chung s lm n gin rt nhiu nhng
kh khn m ta gp khi s dng php kho st trc tip. Mt trong cc phng php kho
st gin tip thng c s dng l php bin i Z m ta s nghin cu trong ni dung
ca chng ny.
Php bin i Z ng vai tr nh php bin i Laplace trong vic phn tch tn
hiu v h thng lin tc.
Quan h gia min t nhin n v min Z c minh ho nh hnh 2.1 sau:
ZT
min Z
min n
IZT
Hnh 2.1. Quan h gia min n v min Z

II. Php bin i Z (ZT - Z Transform)
II.1. nh ngha php bin i Z hai pha v mt pha
a. Bin i Z hai pha.
nh ngha. Bin i Z hai pha ca dy x(n) c nh ngha nh sau:
X ( Z) =
x (n ) Z
(2.2.1)
n =
ZT
K hiu: ZT[x(n)] = X(Z), hay x ( n )
X( Z)
trong Z l bin s phc.

18

Nh vy bin i Z l bin i vic biu din tn hiu x(n) trong min bin s c
lp t nhin thnh vic biu din tn hiu X(Z) trong min phc Z v X(Z) l mt hm
phc.
Bin i Z l mt chui lu tha v hn, n ch tn ti vi cc gi tr ca Z m ti
chui hi t.
V d: Tm bin i Z ca cc tn hiu c chiu di hu hn sau:
x1(n) = (n)
x2(n) = 2(n+2) +(n) + 3(n-1)
Gii: X1 ( Z) =
X1 ( Z) =
(n ) Z
= 1.Z 0 = 1
n =
[2 (n + 2) + (n) + 3 (n 1)]Z
= 2 Z 2 + 1.Z 0 + 3.Z 1
n =
Nhn xt:
- X1(Z) tn ti vi mi gi tr ca Z, tc l trong ton b mt phng Z. Khi ta ni
ZT[x1(n)] hi t trong ton mt phng Z.
- X2(Z) tn ti vi mi gi tr ca Z, tr Z = 0 v Z = , tc l ZT[x2(n)] hi t trong
ton mt phng Z, tr gc 0 v im v cc .
b. Bin i Z mt pha
nh ngha. Bin i Z mt pha ca dy x(n) c nh ngha nh sau:
X1 ( Z) = x (n ) Z n
(2.2.2)
n =0
K hiu: ZT1[x(n)] = X1(Z)

Ch :
- Bin i Z mt pha khng biu din c tn hiu x(n) i vi min bin s c
lp m.
- i vi tn hiu nhn qu th bin i Z mt pha l duy nht, v tn hiu nhn
qu bng khng vi n < 0.
V d: Tm bin i Z mt pha ca cc tn hiu c chiu di hu hn sau:
x1(n) = (n)
x2(n) = 2(n+2) +(n) + 3(n-1)
Gii:
X11 ( Z) = (n ) Z n = 1.Z 0 = 1 tn ti vi mi gi tr ca Z
n =0
X12 ( Z) = [2 (n + 2) + (n ) + 3 (n 1)]Z n = 1.Z 0 + 3.Z 1 = 1 + 3Z 1 tn ti vi mi gi tr

n =0
ca Z, tr Z = 0.
c. Mt phng Z
Mt phng phc Z c to bi trc tung ng vi trc o v trc honh l trc thc
nh hnh 2.2
19

Im[Z]
r
Re[Z]
Hnh 2.2. Mt phng Z

Biu din Z trong cc h to nh sau:
Z = Re[Z] + j.Im[Z]
(2.2.3)
j
hoc trong to cc:
Z = z.e
(2.2.4)
Trong mt phng Z cn ni n vng trn n v, l vng trn ng vi Z=1. y
l vng trn c bit quan trng trong vic nh gi cc c tnh ca h thng s da vo
cc v tr ca im cc, im khng i vi vng trn n v; m ta s kho st trong ni
dung tip theo.
II.2. S tn ti ca php bin i Z
a. Min hi t ca bin i Z
nh ngha 1:
Tp hp cc gi tr ca Z m ti chui X ( Z) =
x (n ) Z
= ZT[x (n )] hi t c
n =
gi l min hi t ca bin i Z (hai pha).

nh ngha 2:
Tp hp cc gi tr ca Z m ti chui X1 ( Z) =
x (n ) Z
= ZT1 [x (n )] hi t
n =0
c gi l min hi t ca bin i Z mt pha.

V d: Cho tn hiu ri rc sau:
2 n
x (n ) =
0
with : n 2
other
Xc nh bin i Z hai pha, mt pha v xc nh min hi t.

Gii:
Tn hiu x(n) l khng nhn qu, c chiu di v hn: L[x(n)]=[-, 2] = v c
biu din trn hnh 2.3a sau:
x(n)
Im[Z]
r=
4
2
1
-2
Re[Z]
0
(a)
Min hi
(b)
Hnh 2.3. Biu din x(n) (a) v min hi t ca X(Z) (b).
20

- Xc nh bin i Z hai pha.
x (n ) Z n =
Ta c: X ( Z) =
n =
2 n Z n = 4Z 2 + 2Z 1 + 1 +
n =
Z n
n =
X ( Z) = 4 Z 2 + 2 Z 1 + 1 + 2 m Z m = X 2 ( Z) + X1 ( Z)
i bin m = - n ta c:
m =1
X1 ( Z) = 2 m Z m =
trong :
m =1
2 Z
1 2 1 Z
vi Z<2
X 2 ( Z) = 4 Z 2 + 2 Z 1 + 1
X ( Z) = 4 Z 2 + 2 Z 1 + 1 +
Vy:
vi Z 0.
1
2 Z
1 2 1 Z
vi Z<2 v Z 0.
Hnh 2.3b biu din min hi t ca X(Z0 trong mt phng Z, l hnh trn Z<2,
tr gc to .
- Xc nh bin i Z mt pha.
Ta c: X1 ( Z) =
n =0
n =0
x (n )Z n = 2 n Z n = 4Z 2 + 2Z 1 + 1
Min hi t l ton b mt phng Z tr gc to .

b. Tiu chun Cauchy (Csi)
Mt chui c dng:
x (n ) = x (0) + x (1) + ... + x (n ) + ...
(2.2.5)
n =0
hi t nu tho mn iu kin:
(2.2.6)
limx(n)1/n < 1
n
c. p dng tiu chun Cauchy
p dng tiu chun Cauchy chng ta c th phn chui X(Z) hai pha thnh hai
chui nh sau:
X1 ( Z) =
x (n ) Z n =
n =
n =
n =0
x (n )Z n + x (n )Z n = X1 (Z) + X 2 (Z)
- Xt chui X2(Z):
limx(n)Z-n1/n
limx(n)1/n Z-1
n
t
Rx-=
limx(n) 1/n
n
p dng tiu chun Cauchy cho chui X2(Z) ta c:

Rx-Z-1<1 Z> Rx- .
Vy chui X2(Z) s hi t vi Z> Rx-, tc min hi t s l min ngoi vng trn
tm gc to c bn knh Rx- (hnh 2.4).
- Xt chui X1(Z), qua php i bin m = - n:
X1 ( Z) =
x (n ) Z n =
n =
n =
m =0
x (n )Z n x (0) = x (m)Z m x (0)
Nu x(0) l hu hn, ta xt gii hn:
limx(-m)Zm1/m
m
limx(-m)1/m Z
m
21

t
Rx+ =
1/m -1
[limx(-m)
]
m
p dng tiu chun Cauchy cho chui X1(Z) ta c: Z< Rx+.

Vy chui X1(Z) s hi t vi Z< Rx+, tc min hi t s l min trong vng trn
tm gc to c bn knh Rx+ (hnh 2.4).
Cui cng, nu Rx- < Rx+ th min hi t ca bin i Z hai pha l mt hnh vnh khn c
bn knh trong Rx- v bn knh ngoi Rx+ (hnh 2.4).
Im(Z)
Min hi t
RxRe[Z]
Rx+
Hnh 2.4. Min hi t ca bin i Z hai pha.

Nhn xt:
- V Rx- v Rx+ c xc nh t x(n) vy hai gii hn ny c trng cho tn hiu
x(n).
- i vi tn hiu nhn qu c chiu di v hn L[x(n)] =[0, ], min hi t ca bin
i Z hai pha X[Z] nm ngoi vng trn bn knh Rx-.
- i vi tn hiu phn nhn qu c chiu di v hn L[x(n)] =[-, 0], min hi t
ca bin i Z hai pha X[Z] nm trong vng trn bn knh Rx+.
- Nu nu Rx- Rx+ th X(Z) khng tn ti.
- Chui X ( Z) =
x (n ) Z
c tn l chui Laurent, n l mt hm gii tch. V vy
n =
trong min hi t, bin i Z v tt c cc o hm ca n l hm lin tc ca Z.

V d:
3
4
Cho chui x ( n ) =
vi mi gi tr ca n. Tm bin i Z v min hi t.
Gii:
ZT[x (n )] = X( Z) =
3 n
Z
n = 4
Ta c:
n
1
1
3
X ( Z) = Z 1 + Z 1
n = 4
n =0 4
Gi:
22

+. X1 ( Z) =
1
3
3 1
vi Z 1 < 1
Z =
4
1 3 Z 1
n =0 4
4
Theo tiu chun Cauchy, xt vi chui X1(Z) ta c: R x =
Z>
3
, hay min hi t l
4
3
.
4
3
m
Z
3
3
vi : Z < 1
= Z = 4
3
4
m =1 4
1 Z
4
4
Theo tiu chun Cauchy, xt vi chui X2(Z) ta c: R x + = , hay min hi t l
3
n
1

3 1 1
3 1
+. X 2 ( Z) = Z
Z
=

m =1 4
n = 4
Z<
4
.
3
Cui cng, ta c:
3
Z
4
3
1
, vi < Z < l min hi t.
+ 4
X(Z) = X1(Z) + X2(Z) =
3
3
3
4
1 Z 1 1 Z
4
4
II.3. im cc v khng
Trong thc t chng ta thng gp cc bin i Z cho di dng mt thng s ca
hai a thc, nh vy X(Z) l hm hu t ca Z:
X( Z) =
N( Z)
D( Z)
Do tn ti cc gi tr (im) Z lm cho X(Z) bng 0 hoc v nh; cc im ny

cn c k n trong cc php bin i, l cc im khng v im cc c xt di y.
a. im khng.
Ti cc im Z = Z0r ta c X(Z0r) = 0 th cc im gi l cc khng ca X(Z).
b. im cc.
Ti cc im Z = Zpk ta c X(Zpk) = th cc im gi l cc cc ca X(Z).
III. Php Bin i Z ngc.
Thng thng khi chng ta c bin i Z: X(Z) ca mt dy no , tc l chng ta
c biu din ca dy x(n) trong min Z, sau khi kho st gin tip dy x(n) trong min Z
th ta cn phi a n tr v min bin s c lp t nhin, tc l tm x(n) hay t bin i
Z X(Z) ca n. Php i Z ngc s cho php thc hin iu ny.
Php bin i Z ngc c xy dng trn c s ca nh l Cauchy, mt nh l
quan trng trong l thuyt bin s phc.
III.1. nh l Cauchy.
nh l Cauchy v tch phn trn ng cong kn trong mt phng phc c pht
biu nh sau:
I=
1, n = 0
1
Z n 1dZ =
2j c
0, n 0
(2.3.1)
23

trong c l ng cong khp kn bao quanh gc to ca mt phng phc theo chiu

dng (ngc chiu kim ng h).
III.2. Bin i Z ngc
Theo nh ngha ca bin i Z ta c:
X ( Z) =
x ( m) Z
m =
- Nhn hai v ca quan h ny vi
Z n 1
v ly tch phn theo chiu di ca mt
2j
ng cong kn c bao quanh gc to v nm trong min hi t ca X(Z), ta c:
1
1
n 1
X
(
Z
)
Z
dZ
=
x (m) Z m+ n 1dZ
2j c
2j c n =
- i th t ca tng v tch phn v phi trong quan h trn:
1
1
n 1
X
(
Z
)
Z
dZ
x ( m)
=
Z m+ n 1dZ
2j c
2j c
m =
theo nh l Cauchy ta c:
1, ( m + n ) = 0 m = n
1
Z n +l1dZ =
2j c
0, (m + n ) 0 m n
Vy vi m = n ta c:
x (n ) =
1
X( Z) Z n 1dZ
2j c
(2.3.2)
biu thc (2.3.2) chnh l biu thc ca bin i Z ngc.

tnh bin i Z ngc chng ta c ba phng php sau:
- Tnh trc tip tch phn dng l thuyt thng d (PP thng d).
- Phng php khai trin thnh chui lu tha theo Z hoc Z-1.
- Phng php khai trin thnh tng cc phn thc ti gin.
III.3. Phng php thng d
Theo l thuyt thng d ca hm bin phc th tch phn trong biu thc bin i
Z ngc c th c nh gi bng tng cc thng d sau:
x (n ) =
1
X( Z) Z n 1dZ = Re s X( Z) Z n 1
2j c
k
Z= Z pk
(2.3.3)
trong : +. Zpk l cc im cc ca X(Z)Zn-1 trong ng cong kn c.

+. Thng d ti im cc k: Zpk, bc sk ca X(Z)Zn-1 trong ng cong kn c l:
Re s X( Z) Z n 1
Z= Zpk
] = lim
Z Z pk
1
d sk 1
X( Z) Z n 1 ( Z Z pk ) s k
(s k 1)! dZsk 1
(2.3.4)
(2.3.5)
i vi cc im cc n:
Re s X( Z) Z n 1
Z= Zpk
n 1
= lim ZZpk X( Z) Z ( Z Z pk )
V d:
Cho: X ( Z) =
1
; min hi t RC[X(Z)] : Z> 0,5. Tm x(n).
1
1 Z 1
2
24

Gii: - Xc nh cc im cc Zpk ca X(Z)Zn-1 trong min hi t Z> 0,5:
Zn
X ( Z) Z n 1 =
Ta c:
Z
1
2
1
2
T y, vi ta c Zp1= 0,5 l mt cc n.
n gin, ta c th chn ng cong c l ng trn bn knh R > 0,5. Nh vy
ta c:
Re s X( Z) Z n 1
Z=0 , 5
1
2
] = lim
1
2
1
Zn
( Z 0,5) =
Z0 , 5
Z 0,5
2
Vy x ( n ) = vi .
Vi n < 0, t n = -m (m > 0) ta s c:
x (m) = Re s X( Z) Z m 1
k
Z= Zpk
1
= Re s
1
k
Zm (Z )
2
Z= Z pk
y ta c mt cc n ti Zp1= 0,5 v mt cc bi bc m ti Zp2 = 0.

Tnh cc thng d ti cc cc ta c:
- Ti cc n
Re s X( Z) Z n 1
Z=0 , 5
] = lim
Z= Zpk
] = lim
- Ti cc bi
Re s X( Z) Z n 1
Z 0 , 5
Z0
1
m
Z m ( Z 0,5) ( Z 0,5) = 2
1
d m1
(m 1)! dZ m1
1
m
Z m ( Z 0,5) Z
1 (1) m1 (m 1) !
= 2 m
m
(m 1)! (0,5)
Vy vi n < 0 ta c: x(n) = 0.
III.4. Phng php khai trin thnh chui lu tha.
Trong min hi t ca X(Z) th X(Z) l mt hm gi tch ca Z, nh vy hon ton
c th khai trin X(Z) thnh chui lu tha c dng:
X ( Z) =
n =
Z n
theo nh ngha ta c: X ( Z) =
(2.3.6)
x (n ) Z
. C hai chui ny u hi t trong min hi t
n =
ca X(Z), vy ng nht ho cc h s ca chui cho ta:

x(n) = a(n)
V d:
Cho X ( Z) =
(2.3.7)
Z
. Tm x(n) vi min hi t ca X(Z) nh sau:RC[X(Z)] : Z>2
Z+2
Gii:
25

RC[X(Z)] : Z>2 hay min ngoi vng trn bn knh 2.
X ( Z) =
Z
1
=
Z + 2 1 + 2 Z 1
Nh chia a thc t cho mu ta nhn c X(Z) dng chui lu tha nh sau:
X ( Z) = (2) n Z n
n =0
Cui cng ta c: x(n) = (-2)nu(n).

III.5. Phng php khai trin thnh phn thc ti gin.
y l mt trong cc phng php thng dng. Nguyn tc ca phng php ny
l nu X(Z) c dng t s hai a thc theo Z th ta c th khai trin X(Z) thnh cc phn
thc hu t ti gin. Khi bin i Z ngc ca X(Z) s l tng cc bin i Z ngc ca
cc phn thc ti gin
Gi s X(Z) c dng:
X( Z) =
C( Z)
D( Z)
trong , C(Z) l a thc bc M, D(Z) l a thc bc N.

- Nu M N, tin hnh chia hai a thc v kt qu c dng:
X( Z) = S( Z) +
P( Z)
Q( Z)
(2.3.8)
trong , S(Z) l a thc bc M-N c dng:
S( Z) = B M N Z M N + B M N 1 Z M N 1 + ... + B1 Z1 + B 0
(2.3.9)
- Nu M < N th S(Z) = 0.
- Khai trin thng s
P( Z)
thnh cc phn thc ti gin nh sau:
Q( Z)
- Trng hp X(Z) ch c N cc cc n:
P( Z) N A k
=
Q( Z) k =1 Z Z pk
(2.3.10)
trong , Zpk l cc cc n ca X(Z) v Ak c xc nh theo biu thc:
A k = ( Z Z pk )
P( Z)
Q( Z)
(2.3.11)
Z = Z pk
- Trng hp X(Z) c mt cc bi bc s v N-s cc n:

s
cj
P( Z) N s A k
=
+
Q( Z) k =1 Z Z pk j=1 (Z Z pl )j
(2.3.12)
k l
khi , cj c xc nh nh sau:
cj =
1
d s j
P( Z)
( Z Z pk ) s
s j
(s j)! dZ
Q( Z) Z= Z
(2.3.13)
pl
Cui cng, sau khi khai trin xong X(Z) ta s tm bin i Z ngc ca tng phn
thc mt ri tng hp kt qu ta s c c x(n).
Bin i ngc (IZT) ca cc phn thc ti gin c th tham kho theo mt s dng
nh sau:
26

Z
n
= Z pk u (n )
Z
Z
pk
+. IZT
1
n 1
= Z pk u (n 1)
Z
Z
pk
+. IZT
(2.3.14)
n (n 1)(n 2)...(n m + 1) n m
Z
=
Z pk u (n )
m +1
m!
(Z Z pk )
+. IZT
(2.3.15)
vi Z>Zpk.
n (n 1)(n 2)...(n m + 1) n m
Z
=
Z pk u (n 1)
m +1
m!
(Z Z pk )
+. IZT
(2.3.16)
vi Z<Zpk.
V d:
Cho X ( Z) =
Z+2
. Tm x(n) bng phng php khai trin ti gin.
2Z 7 Z + 3
2
Gii:
X ( Z) =
Z+2
1
2( Z )( Z 3)
2
vy X(Z) c hai im cc n l: Z p1 =
1
v Zp2 = 3.
2
Vy ta c:
2
Ak
k =1 Z Z pk
X ( Z) =
trong :
A1 = ( Z 0,5)
A 2 = ( Z 3)
Z+2
= 0,5
2( Z 0,5)( Z 3) Z=0,5
Z+2
=1
2( Z 0,5)( Z 3) Z=3
Vy:
X ( Z) =
1
0,5
+
Z 0,5 Z 3
p dng biu thc (2.3.14) ta c:
x (n ) = 0,5(0,5) n 1 u (n 1) + 3 n 1 u (n 1) = 3 n 1 u (n 1) 0,5 n u (n 1)
IV. Tnh cht ca cc bin i Z
Cc tnh cht ca bin i Z s h tr nhiu trong vn x l tn hiu s.
V d Tnh cht tuyn tnh di y s cho ta cch tnh bin i Z ngc thng qua vic
phn tch thnh cc hm n gin.
IV.1 Tnh tuyn tnh
27

Nu ta c hai dy x1(n), x2(n) v cc bin i Z ca n nnhw sau:
ZT[x1(n)] = X1(Z) =
x (n ) Z
1
n =
RC[X1(Z)]:
Rx1-<Z< Rx1+
ZT[x2(n)] = X2(Z) =
n =
(n ) Z n .
RC[X2(Z)]:
Rx2-<Z< Rx2+
Gi s ta c dy x(n) l t hp tuyn tnh ca hai dy x1(n), x2(n) nh sau:
x(n) = ax1(n) + bx2(n), a v b l cc hng s.
Bin i Z ca x(n) s l:
ZT[x(n)] = X(Z) =
[ax (n ) + bx
1
n =
=a
x (n ) Z
n =
(n )]Z n
+ b x 2 (n ) Z n = aX1 ( Z) + bX 2 ( Z)
n =
Min hi t:
RC[X(Z)]:
Rx-<Z< Rx+
trong :
Rx- = max[R1x-, R2x-] v Rx+ = min[R1x+, R2x+].
Ch : Nu nh t hp tuyn tnh li a vo mt s im khng, kh i mt s im cc
th min hi t (Rx-, Rx+) c th s rng ra.
V d:
Cho cc dy: x1(n) = anu(n);
a > 0.
n
x2(n) = a u(n-1);
a > 0.
x(n) = anu(n) - anu(n-1);
Xc nh min hi t ca X1(Z), X2(Z) v X(Z).
Gii:
X1 ( Z) =
X 2 ( Z) =
n =
n =0
x1 (n )Z n = (aZ1 ) n =
n =
1
;
1 aZ 1
Z> a.
aZ 1
;
1 aZ 1
Z> a.
n
= (aZ 1 ) n =
2 ( n )Z
n =1
p dng tnh cht tuyn tnh ta c:
X ( Z) =
1
aZ 1
1 aZ 1
=1
=
1 aZ 1 1 aZ 1 1 aZ 1
Vy min hi t ca X(Z) l ton b mt phng Z.

IV.2 Tnh dch chuyn theo thi gian.
Gi s c mt dy x(n) v ZT[x(n)] = X(Z); RC[X(Z)] :
Nu ta c dy y(n) l tn hiu x(n) dch i mt on n0 mu:
y(n) = x(n-n0)
Y ( Z) =
Th:
y(n )Z n =
n =
= Z n 0
x (n n
n =
x (n n
n =
Rx-<Z< Rx+.
) Z n =
) Z ( n n 0 ) = Z n 0 X ( Z)
28

Vy:
- Vic dch i n0 mu sang phi, tc l to ra tn hiu tr n0 mu s tng ng vi

n
vic nhn vi Z 0 trong php bin i Z.

- Vi n0 = 1, ta c ton t Z-1 tng ng vi ton t tr i mt mu, l ton t c
dng rt rng ri trong vic biu din cc h thng x l tn hiu s.
n
- Min hi t c th b thay i nu vic nhn vi Z 0 vi X(Z) gy trit tiu i

hoc a thm vo mt s im cc ti Z = 0 hoc im khng ti Z = .
IV.3 nhn vi dy hm m an.
Nhn dy x(n) vi dy hm m an ta c:
y(n) = x(n)an.
ZT[y(n)] = Y(Z) =
a n x (n )Z n =
n =
Z
x (n )
a
n =
Z
= X
a
Z
. Vi X(Z) = ZT[x(n)].
a
Vy: ZT[anx(n)] = X
a R x < Z < a R x+
v: RC X :
a
IV.4 o hm ca bin i Z.
Ly o hm ca bin i Z ta c:
dX( Z)
= (n ) x (n )Z n 1
dZ
n =
Vi Z 0, nhn c hai v vi -Z ta c:
dX( Z)
= nx (n )Z n
dZ
n =
Cui cng: ZT[nx(n)] = Z
dX( Z)
dZ
V d: Tm bin i Z ca dy x2(n) = n2x1(n) theo hm ca X1(Z) = ZT[x1(n)].

Gii:
p dng biu thc o hm ca bin i Z ta c:

ZT[nx1(n)] = Z
v:
dX1 ( Z)
dZ
ZT[n2x1(n)] = Z
2
dX1 ( Z)
dX1 ( Z)
d
2 d X1 ( Z)
Z
Z
Z
=
+
dZ
dZ
dZ
dZ 2
IV.5. nh l gi tr u.
nh l ny cho php xc nh gi tr gc ca mt dy khi bit bin i Z ca n.
i vi dy nhn qu th: x (0) = lim X( Z)
Z
H qu: Nu X(Z) hi t khi Z>Rx- v: lim Z n 0 X( Z) = A < th: x(n0) = A v x(n)

Z
= 0 vi n < n0.
IV.6.Tch chp ca hai dy
Gi s x3(n) l tch chp ca hai dy x1(n) v x2(n): x3(n) = x1(n)*x2(n)
th trong min Z ta c:
X3(Z) = X1(Z).X2(Z).
Chng minh:
29

X 3 ( Z) =
[x (n ) * x
n =
(n )]Z n =
k =
n = k =
x (k ) x
x (k )x
n =
(n k ) Z n
(n k )Z n
i bin: m = n-k n = m+k
X 3 ( Z) =
Ta c:
k
m
x
(
k
)
Z
1
x 2 (m)Z = X1 ( Z).X 2 ( Z)
k =
m =
Min hi t ca tch chp hai dy c xc nh:

RC[X3(Z)] = RC[X1(Z)] RC[X1(Z)]
Ch : min hi t ca X3(Z) c th rng hn giao ca min hi t X1(Z) v X2(Z) nu c cc
im khng ca bin i Z ny b cho cc im cc ca bin i Z kia hoc ngc li.
V d: Cho hai dy: x1(n) = n.u(n) v x2(n) = n.u(n). Tm tch chp ca hai dy trn.
Gii:
- Tm X3(Z):
X1 ( Z) =
[x (n )]Z
n =
= Z
X 2 ( Z) =
n.u (n )Z
= Z
n =
d 1
d n
Z = Z
dZ 1 Z 1
dZ n =0
d Z
( Z 1) Z
Z
= Z
=
2
dZ Z 1
(Z 1)
(Z 1)2
[x
n =
n
=
2 ( n ) ]Z
u (n ) Z
= Z n =
n =
X 3 ( Z) = X1 ( Z).X 2 ( Z) =
n =0
Z
Z 1
Z
Z
Z2
.
=
(Z 1)2 Z 1 (Z 1)3
- Tm x3(n) t X3(Z) qua php bin i Z ngc.
Z2
Z2
Z n +1
n 1
=
=
IZT
Re
s
Z
Re
s
(Z 1)3
k (Z 1)3
3
( Z 1) k
Z= Zpk
Z= Zpk
Cc im cc y l 1 im cc bi bc 3: Zpk = 1.
Vy:
Z n +1
1 d2
Re s
=
3
2
( Z 1) Z= Zpk 2! dZ
Cui cng ta c: x 3 = (n )
Z n +1
n (n + 1)
3
( Z 1) 3 ( Z 1) =
2
Z=1
n (n + 1)
2
IV.7.Tch ca hai dy
Gi s ta c x3(n) l tch ca hai dy x1(n) v x2(n) nh sau: x3(n) = x1(n). x2(n)
Th trong min Z ta c quan h sau:
Vi min hi t:
RC[X1(Z)]:
RC[X2(Z)]:
RC[X3(Z)]:
Chng minh:
X 3 ( Z) =
1
Z
X1 ( v)X 2 ( ) v 1dv
2j c
v
Rx1-< Z<Rx1+
Rx2-< Z<Rx2+
RC[X1(Z)] RC[X2(Z)]
30

X 3 ( Z) =
Ta c :
n =
(n ) Z n =
n =
x 1 (n ) =
Mt khc:
x (n ) x
1
(n ) Z n
1
X1 ( v)v n 1dv
2j c
n
1
1
Z
n 1
n
X 3 ( Z) = x 2 ( n )
=
X
(
v
)
v
dvZ
x 2 (n ) X1 ( v) v 1dv
2j c
2j n =
v
n =
c
=
n
1
1
Z
Z
1
x
(
n
)
X1 ( v)X 2 v 1dv
X1 ( v) v dv =
2j c n =
2j c
v
v
Ch : ng cong kn c phi c chn trong min giao ca hai min hi t ca X1(Z) v

X2(Z), hay chnh l min hi t ca X3(Z).
IV.8.Tng quan ca hai tn hiu
Hm tng quan cho ca hai tn hiu x(n) v y(n) c nh ngha bi quan h
rxy (n ) =
sau:
x ( n ) y( m n )
m =
1
R xy ( Z) = X( Z)Y
Z
Trong min Z quan h tng ng l:
Rx-< Z<Rx+
Min hi t c xc nh: RC[X(Z)]:
1
:
Z
RC Y
1
1
< Z<
R y
R y+
RC[Rxy(Z)]:
RC[X(Z)] RC Y
IV.9.Tng kt cc tnh cht ca bin i Z

Min n
x (n ) =
y( n ) =
Min Z
1
X( Z) Z n 1dZ
2j c
X ( Z) =
1
Y ( Z) Z n 1dZ
2j c
Y ( Z) =
ax(n) + by(n)
x(n-n0)
x (n ) Z
Min hi t
n
n =
y( n ) Z
n =
aX(Z) + bY(Z)
Z n 0 X ( Z)
Rx-< Z<Rx+
Ry-< Z<Ry+
RC[X(Z)] RC[Y(Z)]
Rx-< Z<Rx+
X(a-1Z)
anx(n)
lim X( Z)
x(0) (nu x(n) l nhn qu)

x(n)*y(n)
rxy (n ) =
X(Z).Y(Z)
1
Z
X( v)Y( ) v 1dv
v
2j c
1
R xy ( Z) = X( Z)Y
Z
x(n).y(n)
x ( n ) y( m n )
m =
Rx-< a-1Z<Rx+
RC[X(Z)] RC[Y(Z)]
RC[X(Z)] RC[Y(Z)]
RC[X(Z)] RC Y
31

IV.10. Mt s bin i Z thng dng

Min n
(n)
(n-n0)
Min Z
Ton b mt phng Z
Ton b mt phng Z
n0
1
1 Z 1
1
1
Z 1
u(n)
u(-n-1)
Z 1
(1 Z 1 ) 2
nu(n)
1
1 aZ 1
1
1 aZ 1
anu(n)
-anu(-n-1)
Z 1
n anu(n)
Min hi t
(1 aZ )
Z> 1
Z< 1
Z> 1
Z> a
Z< a
Z> a
1 2
Z 1
-nanu(-n-1)
(1 aZ )
Z< a
(cos0n).u(n)
1 Z 1 cos 0
1 2Z 1 cos 0 + Z 2
Z> 1
1 2
1 Z 1 sin 0
1 2Z 1 cos 0 + Z 2
(sin0n).u(n)
Z> 1
V. Biu din h thng ri rc trong min Z

Trong min n, mt h thng tuyn tnh bt bin c c trng bi p ng xung
h(n) ca n hoc c c trng bi phng trnh sai phn tuyn tnh h s hng. Nhng
vic phn tch h thng ni chung gp nhiu kh khn nh vic tnh tch chp, gii
phng trnh sai phn, xt n nh, .
gii quyt nhng kh khn trong min bin s c lp t nhin n, chng ta
chuyn cch biu din h thng sang min Z, sau u ta nghin cu khi nim hm
truyn t ca h thng.
V.1. Hm truyn t ca h thng ri rc
a. nh ngha:
Hm truyn t ca mt h thng ri rc chnh l bin i Z ca p ng xung h(n)
v c k hiu l H(Z).
H(Z) = ZT[h(n)]
b. M t qua phng trnh sai phn hm truyn t ca h thng ri rc.
Quan h gia u vo v u ra ca mt h thng ri rc tuyn tnh bt bin v
nhn qu c cho bi phng trnh sai phn sau:
N
k =0
r =0
a k y( n k ) = b r x ( n r )
32

Ly bin i Z hai v ca phng trnh ta c:
n =
k =0
y(n k )Z n = b r x (n r )Z n
n = r = 0
S dng cc tnh cht tuyn tnh v tnh cht tr ca bin i Z ta c:

M
a k ZT[y(n k )] = b r ZT[x (n r)]

k =0
r =0
a
k =0
r =0
k =0
r =0
Z k Y ( Z) = b r Z r X( Z) Y ( Z) a k Z k = X( Z) b r Z r
M
X( Z)
=
H ( Z) =
Y( Z)
b Z
r =0
N
k =0
(2.5.1)
k
c. Biu din hm truyn t bng cc im cc v im khng.

Ging nh tn hiu ri rc, hm truyn t H(Z) ca mt h thng ri rc c th
c biu din bng cc im cc v im khng ca n nh sau:
(1 Z
0r
(1 Z
1
pk Z )
H ( Z) = c
r =1
N
Z 1 )
= cZ
(Z Z )
N M r =1
N
0r
(Z Z )
(2.5.2)
pk
k =1
k =1
V.2. Phn tch h thng trong min Z

a. Cc phn t thc hin
- Phn t tr:
Gi x(n) l u vo, y(n) l u ra; quan h gia u vo v u ra ca phn t tr
trong min Z c xc nh nh sau:
T:
y(n) = x(n-1)
Ly bin i Z ta c:
Y(Z) = Z-1X(Z)
Nh vy php tr trong min bin c lp t nhin n c thay bng php nhn vi
Z-1 trong min Z.
- Phn t cng:
Gi xi(n) (i = 1.. M) l cc u vo, y(n) l u ra; quan h gia u vo v u ra ca
phn t cng trong min Z c xc nh nh sau:
M
T:
y(n) =
x (n )
i =1
Ly bin i Z ta c:
M
Y ( Z) =
x i (n )Z n = X i (Z)
i =1 n =
i =1
- Phn t nhn vi hng s (phn t khuch i)

Gi x(n) l u vo, a l hng s v y(n) l u ra; quan h gia u vo v u ra
ca phn t nhn vi hng s trong min Z c xc nh nh sau:
T:
y(n) = ax(n)
Ly bin i Z ta c:
Y(Z) = aX(Z)
33

Cc phn t trn c biu din nh trong cc hnh sau:
X(Z)
Y(Z) = Z-1X(Z)
-1
Phn t tr
X1(Z)
Y( Z) = X i ( Z)
X2(Z)
i =1
+
Xn(Z)
X(Z)
Phn t cng
Y(Z)= a.X(Z)
Phn t nhn vi hng s
Hnh 2.5. Cc phn t c bn.
b. Phn tch h thng ri rc

Vic phn tch h thng ri rc da trn cc nguyn tc sau:
- Phn tch h thng tng qut thnh cc h thng (khi) nh v n gin hn.
- Tm quan h ghp ni gia cc khi (h thng) ny.
- Tm hm truyn t Hi(Z) ca tng khi nh.
- Ghp cc hm truyn t trn theo cc quan h xc nh.
V d: Cho h thng nh hnh v, phn tch v tm hm truyn t ca h thng.
H2(Z)
H3(Z)
Y(Z)
X(Z)
H1(Z)
H4(Z)
Gii: Cc khi 2 v 3 ni tip nhau v ghp song song vi khi 4, khi 1 ghp ni tip vi
h thng ny.
Do ta c:
H(Z) = H1(Z)[ H2(Z) H3(Z) + H4(Z)]
V.3. Gii phng trnh sai phn tuyn tnh h s hng
V cc iu kin u ca cc phng trnh sai phn tuyn tnh h s hng l khc
khng, v vy ta ch dng bin i Z mt pha trong cc ng dng ny.
Xt bin i Z ca thnh phn x(n - m) vi m c nh v n 0.
ZT[x (n 1)] = x (n 1) Z n
n =0
= x (1) + Z 1 x (0) + x (1) Z 1 + x (2) Z 2 + ...

= Z 1X( Z) + x (1)
34

ZT[x (n 2)] = Z 2 X( Z) + Z 1 x (1) + x (2)

ZT[x (n 3)] = Z 3 X( Z) + Z 2 x (1) + Z 1 x (2) + x (3)
ZT[x (n m)] = Z m X( Z) + Z m +1 x (1) + ... + Z 1 x ( m + 1) + x ( m)

m
= Z m X( Z) + x (r ) Z r
r =1
Biu thc trn s c p dng gii cc PTSPTT h s hng.

V d:
vi:
Gii h phng trnh sai phn sau:

y(n) - 3y(n-1) + 2y(n-2) = x(n)
x(n) = 3n - 2.
y(-2) = - 4/9 ; y(-1) = - 1/3.
Gii:
Ly bin i Z mt pha ca phng trnh:
ZT1[y(n)] - 3.ZT1[y(n-1)] + 2. ZT1[y(n-2)] = ZT1[3n-2]
) (
Y ( Z) 3 Z 1Y( Z) + y(1) + 2 Z 2 Y( Z) + Z 1 y(1) + y(2) = 32
Z
Z3
Thay y(-1) = -1/3 v y(-2) = -4/9 vo phng trnh trn ta c:
1 4
Z
Y ( Z) 3Z 1Y( Z) + 1 + 2 Z 2 Y( Z) Z 1 = 32
3 9
Z3
2 1
Z
Y( Z) 1 3Z 1 + 2 Z 2
+ =
3Z 9 9(Z 3)
( Z 1)( Z 2) 6( Z 3) Z( Z 3) + Z 2
Z2
=
=
2
9 Z(Z 3)
Z(Z 3)
Z
Y( Z)
Y ( Z) =
Z
( Z 1)(Z 3)
Tm bin i Z ngc ca Y(Z):

Dng phng php khai trin thnh phn thc ti gin:
A
A
Y ( Z)
= 1 + 2
Z
Z 1 Z 3
Vi Ak c tnh theo cng thc:
A k = ( Z Z pk )
ta c:
A1 = ( Z 1)
Vy:
Y ( Z) =
P( Z)
Q( Z) Z= Zpk
1
1
1
1
= v A 2 = ( Z 3)
=
( Z 1)(Z 3) Z=1
2
( Z 1)(Z 3) Z=3 2
Z
Z
+
Z 1 Z 3
Cui cng, ta c p ng ra y(n) h sau:
1
1
1
y(n ) = 1n u (n ) + 3n u (n ) = 3n 1 u (n )
2
2
2
35

V.4. n nh
a. S n nh ca mt h thng tuyn tnh bt bin
Khi khng c tn hiu u vo ca h thng s, nhng c th u ra ca h thng
xut hin tn hiu, l trng hp h thng khng n nh.
Tnh n nh ca mt h thng tuyn tnh bt bin (khng nht thit l nhn qu)
ph thuc vo p ng xung:
iu kin:
h (n) < l iu kin n nh trong min n.
n =
Chuyn iu kin ny sang min Z, lc hm truyn t H(Z) s c trng hon

ton cho h thng.
H( Z) =
h (n ) Z
Rh-<Z< Rh+
n =
tho mn iu kin n nh trong min n th hm truyn t H(Z) phi hi t

vi Z=1, v th min hi t ca H(Z) nnht thit phi cha vng trn n v Z=1.
T y ta c iu kin n nh ca h thng TTBB nh sau:
Mt h thng TTBB l n nh nu v ch nu vng trn n v nm trong min hi
t ca hm truyn t ca h thng.
b. S n nh ca h thng TTBB nhn qu
Trong thc t, vi cc h thng nhn qu ta c:
H ( Z) = h (n ) Z n
n =0
Min hi t ca H(Z) l min ngoi ca vng trn bn knh Rh -: Rh -<Z, trong :
R h = lim h (n )
n
theo tiu chun Cauchy.
Vy:
- Mt h thng TTBB l nhn qu nu v ch nu min hi t ca hm truyn t
ca h thng nm ngoi vng trn c bn knh Rh-.
- Mt h thng TTBB nhn qu l n nh nu v ch nu tt c cc im cc ca
hm truyn t H(Z) nm bn trong vng trn n v.
36

Chng
2
Biu din h thng v tn hiu ri rc
trong min tn s lin tc
I. M u.
Trong chng 1 trnh by v vic biu din tn hiu ca h thng ri rc trong
min bin s c lp t nhin (min n); y l phng php nghin cu trc tip. chng
2, thng qua bin i Z chng ta nghin cu tn hiu ca h thng ri rc trong min Z
v y l mt phng php nghin cu gin tip. Mt trong nhng phng php nghin
cu (biu din) gin tip khc thng c s dng l bin i Fourier (FT) chuyn vic
biu din tn hiu v h thng ri rc t min bin s c lp t nhin n sang min tn s
lin tc .
S lin h gia cc min c biu din qua hnh 3.1 sau:
Z
Min Z
IZ
Min n
F
IF
Min
Hnh 3.1. S lin h gia cc min.

II. Bin i Fourier ca cc tn hiu ri rc
II.1. nh ngha bin i Fourier.
a. nh ngha:
Bin i Fourier ca mt tn hiu ri rc x(n) c nh ngha nh sau:
X ( e j ) =
x (n )e
(3.2.1)
n =
b. Cc phng php th hin X(ej )

- Th hin di dng phn thc v phn o.
X(ej ) = Re[X(ej )] + j.Im[X(ej )]
trong :
Re[X(ej )] l phn thc ca X(ej )
Im[X(ej )] l phn o ca X(ej )
(3.2.2)
37

- Th hin di dng modun v argument
j
X(e j ) = X(e j ) e jarg[X ( e ) ]
X(ej ) gi l ph bin ca x(n).

arg[X(ej )] gi l ph pha ca x(n).
Quan h gia ph bin , ph pha vi phn thc v phn o ca X(ej ) nh sau:
trong :
X ( e j ) =
Re 2 X(e j ) + Im 2 X(e j )
(3.2.3)
j
Im X(e )
arg X(e j ) = arctg

j
Re X (e )
(3.2.4)
Thng dng k hiu () ch argument:

() = arg[X(ej )]
X ( e j ) = X ( e j ) e j ( )
Cui cng ta c:
(3.2.5)
- Th hin di dng ln v pha

Gi s ta biu din X(ej ) dng sau:
X ( e j ) = A ( e j ) e j ( )
(3.2.6)
khi :
A(ej ) l thc v:
A(ej ) = X(ej )
(3.2.7)
2k
arg A(e j ) =
(2k + 1)
: A(e ) 0; k = 0, 1, 2,...
(3.2.8)
: A(e j ) < 0
hay:
A(e j )
1
1
j
arg A(e ) = 2k + 1 sgn[ A(e )] = 2k + 1
2
2
A(e j )
Cn () s c th hin nh sau:
arg[X(ej )] = arg[A(ej )] + () = ()
() = () - arg[A(ej )]
V d:
Cho ph X(e ) c dng sau: X (e
j
Tm:
)=e
(3.2.9)
(3.2.10)
sin 3
a. Re[X(e )] v Im[X(e )]
b. A(ej ) v (). c. X(ej ) v ().
d. V A(ej ), (), X(ej ) v ().
Gii:
a. Ta c:
38

j
X (e ) = e
sin 3 = cos j sin sin 3

2
2
[
] 2 . sin 3
Im[X (e )] = sin . sin 3

2
Re X (e j ) = cos
j
A(ej ) = sin3 v ( ) =
b. T biu thc (3.2.6) ta c:

c.
X(ej ) = sin3
( ) =
1 sin 3
+ 2k + 1

2
2 sin 3
d. th ca A(ej ), (), X(ej ) v () c biu din trn cc hnh:
A(ej )
()
/2
-/2
X(ej )
- -2/3
/
3
2/3
()
39

Hnh 3.2. th ca A(ej ), (), X(ej ) v ()

II.2. S tn ti ca bin i Fourier.
Bin i Fourier ch tn ti nu chui trong (3.2.1) hi t. Ta c th pht biu iu
kin hi t ca chui ny nh sau:
Chui trong (3.2.1.1) hi t nu v ch nu x(n) tho mn iu kin sau y:
x (n ) <
(3.2.11)
n =
Nu iu kin ny c tho mn th chui (3.2.1) s hi t tuyt i v mt hm

lin tc ca .
Nhn xt:
V mt ton hc chng ta c quan h sau:
E x = x (n ) x (n )
n =
n =
Nu (3.2.11) tho mn th:

2
2
x (n ) < E x = x (n ) <
n =
n =
(3.2.12)
Vy: nu nng lng Ex ca tn hiu x(n) l hu hn th x(n) s tho mn iu kin

(3.2.11) hay: Bin i Fourier ca tn hiu c nng lng hu hn l lun hi t.
V d: Xt s tn ti ca bin i Fourier v tnh nng lng Ex ca cc dy x(n) sau:
b. x2(n) = r(n). c. x3(n) = (n). d. x4(n) = rectN(n).
a. x1(n) = u(n).
Gii:
a.
x 1 ( n ) = u ( n ) = 1 =
n =
E x1 =
n =
n =0
x ( n ) = 1
n =
n =0
Vy X1(ej ) khng tn ti.
b.
x 2 ( n ) = r ( n ) = n =
n =
Ex2 =
n =
n =
n =0
(n ) = n =
2
n =0
Vy X2(ej ) khng tn ti.
c.
x 3 (n ) = (n ) = 1
n =
E x3 =
n =
x 3 (n ) = (n ) = 1
n =
n =0
40

Vy X3(ej ) tn ti.
x 4 (n) = rect N (n ) = 1 = N
d.
n =
n =
E x4 =
n =
n =0
( n ) = 1 =
2
n =0
Vy X4(ej ) tn ti.
II.2. Bin i Fourier ngc.
V X(ej ) l mt hm tun hon ca bin tn s c chu k 2 v X(ej ) tn ti nu
tho mn iu kin (3.2.11). Nn ta c th khai trin hm X(ej ) thnh chui Fourier
trong khong (-, ) v c th coi cc h s ca khai trin chui Fourier ny chnh l x(n),
tc l ta c th tm c cc gi tr ca x(n) t X(ej ) xt trong khong (-, ).
T biu thc (3.2.1);
X ( e j ) =
x (n )e
n =
Nhn c hai v vi e
j m
ri ly tch phn trong khong (-, ) ta c:
n =
j n
j m
X ( e ) e d =
x (n )e j ( mn ) d =
n =
x ( n ) e j ( m n ) d
Mt khc ta c:
j ( m n )
2
d =
0
:m = n
:m n
2x (m)
x
(
n
)
e j ( m n ) d =
n =
0
:m = n
:m n
Cui cng ta c:
x ( m) =
x (n ) =
Hay:
1
2
1
2
X(e
)e jm d
X(e
)e jn d
(3.2.13)
y chnh l biu thc bin i Fourier ngc (IFT).

V d:
Cho:
e jn 0
X (e j ) =
0
Tm x(n), v X(ej ) v x(n) vi: c =
: c
: < c , > c
, n0 = 4 .
Gii:
x (n ) =
1
2
j
j n
X(e )e d =
1
2
j ( n n 0 )
1
1
1 sin[c (n n 0 )]
=
e j ( n n 0 )
=
2 j(n n 0 )
(n n 0 )
41

Vi: c =
, n 0 = 4 ta c:
:
e j4
X ( e j ) =
0
sin (n 4)
2
2 v x (n ) = 1
(n 4)
Biu din X(ej ) v x(n) bng th:

Ta c:
1
X ( e j ) =
0
4
2 v: arg X(e j ) =
0
X(ej )
1
-2
-3/2
-/2
arg[X(ej )]
10
8
6
4
2
-10
x(n)
1/
1/9
1/5
1/3
-1/5
-1/3
-1/5
-1/9
Hnh 3.3. th ca X(ej ) v x(n).
42

III. cc tnh cht ca Bin i Fourier

III.1. Tnh cht tuyn tnh.
Gi s c hai tn hiu x1(n) v x2(n) vi cc bin i Fourier tng ng l: X1(ej ) v
X2(ej).
Gi dy x(n) l t hp tuyn tnh ca x1(n) v x2(n):
x(n) = ax1(n) + bx2(n);
vi a, b l cc hng s.
th bin i Fourier ca x(n) nh sau:
X ( e j ) =
x ( n )e
jn
[ax (n) + b.x
n =
n =
= a x 1 ( n )e
+ b x 2 ( n )e
jn
n =
(n )]e jn
(3.3.1)
jn
n =
= aX1 (e ) + bX 2 (e )
III.2. Tnh cht tr.

Gi s y(n) l tn hiu tr ca x(n), tc l: y(n) = x(n- n0)
Ta c:
Y ( e j ) =
y ( n )e
jn
n =
=e
x (n n
n =
x (n n
jn 0
n n 0 =
)e
)e jn =
x (n n
n n 0 =
j ( n n 0 )
=e
jn 0
)e j ( n n 0 ) e jn 0
(3.3.2)
X (e )
Biu din di dng m un v argumen ta c:

Y(ej )= X(ej )
(3.3.3)
arg[Y(ej )] = - n0 + arg[X(ej )]
T biu thc (3.3.3) ta thy rng tn hiu x(n) b tr i n0 mu trong min bin s c lp,
th trong min tn s ph bin ca n khng i, cn ph pha ca n th s tng thm
mt lng -n0.
V d: Cho x(n) = rectN(n-n0).
- Tm X(ej )
- Tm ph bin v ph pha ca x(n).
Gii:
p dng tnh cht tr ta c:
X ( e j ) =
N + n 0 1
N 1
n =n 0
n =0
e jn = e jn0 e jn = e jn0
=e
jn 0
N
2
N
2
N
2
=e
1 e jN
1 e j
j ( n 0 +
N 1
)
2
sin
sin
Vy ta c ph bin v ph pha ca x(n) nh sau:
X ( e j ) =
sin
sin
43

N
sin 2
N
1
arg X(e j ) = (n 0 +
) + arg

2
sin
2
trong :
N
sin
sin 2
1
2
= 2k + 1 sig
arg
2
sin
sin
2
2
III.3. Tnh cht i xng.

Trong trng hp tng qut, tn hiu x(n) l tn hiu phc v ta c th vit:
x(n) = Re[x(n)] + j .Im[x(n)]
Vy dy lin hp phc ca x(n) l x*(n) c dng:
x*(n) = Re[x(n)] - j .Im[x(n)]
Khi , quan h gia cc bin i Fourier tng ng nh sau:
FT[x (n )] = X(e j ) =
x ( n )e
jn
n =
] x ( n )e
FT x (n ) =
*
jn
n =
*

= x * (n )e jn
n =

*
Vy:
= x (n )e jn = X(e jn ) = X * (e jn )
n =
FT x * (n ) = X * (e j )
(3.3.4)
Vi x(n) l thc, ta c quan h:

X*(e-j ) = X(ej ) hay X*(ej ) = X(e-j ).
(3.3.5)
Quan h (3.3.5) cho thy tnh cht i xng Hermit ca ph ca tn hiu thc.
T y thy rng, i vi x(n) thc ta c:
Re[X(ej )] = Re[X(e-j )]
(3.3.6)
Im[X(ej )] = - Im[X(e-j )]
Tng t, i vi modun v argument ta cng c:
X(ej )= X(e-j )
(3.3.7)
arg[X(ej )] =- arg[X(e-j )]
III.4. Tnh cht bin s n o
Gi s ta c tn hiu x(n) v bin i Fourier ca n l:
FT[x (n )] = X(e j ) =
x ( n )e
jn
j
= X(e j ) e arg [X ( e ) ]
n =
Xt bin i Fourier ca tn hiu x(-n):
FT[x ( n )] =
x ( n )e
jn
n =
i bin: m = - n ta c: FT[x ( n )] =
x ( m)e
j m
= X ( e j )
(3.3.8)
m =
44

Nu x(n) v x(-n) l thc th t tnh i xng Hermit ta c:
FT[x ( n )] = X(e j ) = X * (e j ) = X(e j ) e jarg [X ( e
] = X(e j ) e jarg [X ( e ) ]
j
III.4. Tch chp ca hai tn hiu

Xt hai dy x1(n) v x2(n) c bin i Fourier tng ng l X1(ej ) v X2(ej).
Ta c tch chp ca hai dy l:
x3(n) = x1(n)*x2(n)
Bin i Fourier ca x3(n) c xc nh nh sau:
FT[ x 3 (n )] =
[x1 (n ) * x 2 (n )]e jn = [x1 (k )x 2 (n k )]e jn
n =
x (k ) x
k =
n = k =
n =
(n k )e jn
p dng tnh cht tr ta c:
X 3 ( e j ) =
k =
k =
x1 (k )e jk X 2 (e j ) = X 2 (e j ) x1 (k )e jk = X1 (e j )X 2 (e j )
Vy:
X3(ej ) = X1(ej ).X2(ej).
V d:
Cho hai tn hiu: x1(n) = x2(n) = (n+2) + (n-2). Tnh tch chp: x3(n) = x1(n)*x2(n)
thng qua tnh cht bin i Fourier.
Gii:
Ta c:
X 1 ( e j ) = X 2 ( e j ) =
=e
j 2
+e
x (k )e
k =
j 2
jk
[(k + 2) + (k 2)]e
jk
k =
= 2 cos 2
j
X3(e ) = X1(e ).X2(e ) = 2cos2.2cos2 = 4cos22

= (ej 2 + e-j 2)2 = ej 4 + 2 + e-j 4.
p dng bin i Fourier ngc ta c:
x3(n) = (n+4) +2(n) + (n-4).
Vy
III.5. Tch ca hai dy

Nu ta c:
FT[x1(n)] = X1(ej ) v FT[x2(n)] = X2(ej ).
th:
FT[x1 (n ).x 2 (n )] = FT[x 3 (n )] = X 3 (e j ) =
1
2
X (e
j( ')
)X 2 (e j ' )d '
Chng minh:
X 3 (e ) =
[x (n ).x
n =
1
2
(n )]e
x (n )e
n =
jn
1
= x1 (n )
n =
2
j( ') n
(e j ' )e j 'n d 'e jn
X 2 (e j ' )d '
45

Vy:
X 3 ( e j ) =
1
2
X (e
j( ')
)X
(e j ' )d '
= X 1 ( e j ) * X 2 ( e j )
(3.3.9)
= X 2 ( e j ) * X 1 ( e j )
(3.3.10)
Quan h (3.3.9 v 3.3.10) c gi l tch chp lin tc v tun hon vo chu k 2.

Nhn xt:
Tch x3(n) = x1(n). x2(n) thng c dng trong trng hp nghin cu x1(n) c
chiu di rt ln, hn ch chiu di ca x1(n) ta s nhn n vi x2(n) c chiu di hu
hn, nh l ta dng mt ca s ch nht x2(n) = rectN(n). y gi l k thut ca s, c
dng tng hp b lc s FIR.
III.6. Vi phn trong min tn s
Nu:
FT[x(n)] = X(ej )
th:
FT[nx (n )] = j
dX(e j )
d
Chng minh:
X(e j ) =
x ( n ) e j n
n =
x ( n ) d e
jn
n =
Vy ta c: FT[nx ( n )] = j
dX(e j )
d
=
x (n )e jn
d
d n =
= j nx (n )e jn = j.FT[nx (n )]
n =
dX (e j )
d
III.7. Tr tn s
Nu ta c:
FT[x(n) ] = X(ej )
FT e j0n x (n ) = X(e j( 0 ) )
th:
(3.3.11)
Chng minh:
Theo nh ngha ca bin i Fourier ta c:
] x ( n )e
FT e j0n x (n ) =
j0 n jn
n =
x ( n )e
j( 0 ) n
= X(e j( 0 ) )
n =
Nhn xt:
Vic nhn dy x(n) vi e
j0n
trong min bin s n s tng ng vi vic dch
chuyn tn s ca ph X(e ) i mt lng 0.

V d:
Cho x(n) v FT[x(n)] = X(ej ). Tm ph ca x(n)cos0n = y(n) v minh ho ph ca
x(n) v y(n) vi 0 = /2.
Gii:
46

cos 0 n =
V:
e j0n + e j0n
2
Do :
FT[x (n ) cos 0 n ] =
x (n) cos 0 ne jn =
n =
e j0n + e j0n jn
e
2
x (n )
n =
1
1
1
= x (n ) e j( 0 ) n + e j( +0 ) n = X e j( 0 ) + X e j( +0 )
2
2
2 n =
Minh ho ph ca x(n) v y(n) vi 0 = /2.

X(ej )
-2
/2
-/2
Y(e )
1/2
X(ej ( + /2)/2
X(ej ( - /2)/2
III.8. Quan h parseval

Nu ta c:
FT[x1(n) ] = X1(ej )
FT[x2(n) ] = X2(ej )
x1 (n ).x *2 (n ) =
th:
n =
1
X1 (e j )X *2 (e j )d
2
(3.3.12)
Chng minh:
1
x1 (n ).x (n ) = x1 (n )
n =
n =
2
*
2
x1 (n )
n =
1
2
1
2
jn
( e )e
*
2
(e j )e jn d
*
j
X
(
e
)
x1 (n )e jn d =
2 n
2
=
*
2
(e j )X1 (e j )d
Trong trng hp x1(n) = x2 (n) = x(n), quan h Parseval cho ta:
n =
x (n ) =
1
2
X(e
) d
(3.3.13)
47

2
X(e j ) gi l ph mt nng lng ca x(n), n th hin s phn b nng lng

theo hm ca tn s; c k hiu l Sxx(ej ).
Sxx(ej ) = X(e j )
Vy:
(3.3.14)
Ex =
Mt khc nng lng ca tn hiu x(n) l Ex:
x (n )
n =
Nh vy quan h Parseval chnh l quan h gia nng lng ca tn hiu v ph

mt nng lng ca tn hiu .
Trong trng hp x(n) l thc th X(ej ) l i xng:
X(ej )=X(e-j )
Vy ta c th ni rng: nu x(n) thc th Sxx(ej ) cng l i xng:
(3.3.15)
Sxx(ej ) = Sxx(e-j )
III.9. nh l tng quan v nh l weiner khintchine
Nu ta c:
FT[x1(n) ] = X1(ej )
FT[x2(n) ] = X2(ej )
th:
] r
FT rx1x 2 (n ) = R x1x 2 (e j ) = X1 (e j )X 2 (e j )
(3.3.16)
Chng minh:
FT rx1x 2 (n ) =
n =
x1x 2
(n )e jn =
n = m =
x (m) x
m =
[x (m)x
n =
(m n )] e jn
(m n )e jn
i bin: m - n = k.
] x (m) x (k )e
FT rx1x 2 (n ) =
m =
k =
x (m)e
m =
j ( m k )
jm

jk jm
x
(
m
)
1
x 2 (k )e e
m =
k =
[X (e )] = X (e
j
)X 2 (e j )
Nhn xt:
Nu x2(n) l thc, ta c:
R x1x 2 (e j ) = X1 (e j )X*2 (e j )
Nu x1(n) = x2(n) = x(n) ta c hm t tng quan:
R xx (e j ) = X(e j )X(e j )
Nu hm t tng quan x(n) l thc, ta c:
2
R xx (e j ) = X(e j )X * (e j ) = X(e j ) = Sxx (e j )

Vy: Bin i Fourier ca hm t tng quan s bng ph mt nng lng ca tn
hiu.
R xx (e j ) = S xx (e j ) = X(e j )
(3.3.17)
48

Quan h (3.3.17) gi l nh l Weiner - Khintchine. nh l ny c ngha rt

quan trng v n chng t rng dy t tng quan v ph mt nng lng c cha cng
mt thng tin v tn hiu. Tuy vy, c hai u khng cha thng tin v pha, do vy vic
phc hi tn hiu t hm t tng quan hoc ph mt nng lng khng l duy nht.
i vi bin i Fourier ca hm tng quan cho ta cn gi R x1x 2 (e j ) l ph mt
nng lng cho ca x1(n) v x2(n), k hiu l Sx1x 2 (e j )
R x1x 2 (e j ) Sx1x 2 (e j ) = X1 (e j )X *2 (e j )
(3.3.18)
V d: Cho tn hiu x(n) l thc. Tnh gi tr ca hm t tng quan ca x(n) ti
n=0
v nhn xt v kt qu.
Gii:
Theo nh ngha hm t tng quan ta c:
rxx (n ) =
x ( m) x ( m n )
m =
Ti n = 0:
rxx (0) =
m =
m =
x ( m) x ( m) = x ( m)
= Ex
Theo cng thc bin i Fourier ngc ta c:
1
rxx (n ) =
2
rxx (0) =
1
2
xx
(e j )e jn d
xx
(e j )d
Theo gi thit x(n) l thc, nn:
rxx (0) =
1
2
X(e
) d
Cui cng ta c:
E x = rxx (0) =
x ( m)
m =
1
2
X(e
) d
49

III.10. Tng kt cc tnh cht ca bin i Fourier vi tn hiu ri rc

Tnh cht
Min tn s lin tc
Min bin s t nhin n
1
2
j
jn
X ( e ) e d
X ( e j ) =
x ( n )e
j n
FT v IFT
x (n ) =
Tuyn tnh
ax1(n) + bx2(n)
aX1(ej ) + bX2(ej )
Tnh cht tr
x(n - n0)
e jn 0 X(e j )
i xng
x(n) thc
X*(ej ) = X(e -j )
Re[X*(ej )] = Re[X(e -j )]
Im[X*(ej )] = -Im[X(e -j )]
n =
X ( e j ) = X ( e j )
arg[X*(ej )] = -arg[X(e -j )]
Lin hp phc
x*(n)
X*(ej )
Bin s o
x(-n)
X(e -j )
Tch chp
x1(n)*x2(n)
X1(ej ). X2(ej )
x1(n).x2(n)
1
2
Vi phn trong min
nx(n)
Tr tn s
e j 0 n x ( n )
X (e j( 0 ) )
x(n) cos0n
1
1
X(e j( +0 ) ) + X(e j( 0 ) )
2
2
Tch s
iu ch
Quan h Farseval
x (n ).x
n =
x (n )
*
2
1
2
n =
Tng quan
rx1x2 (n) =
X (e
j( ')
) X 2 ( e j ' ) d '
dX (e j )
d
1
2
(n )
*
2
(e j )X1 (e j )d
X(e
) d
x (m)x (m n)
m=
X1(ej ). X2(e -j )
rxx(n)
R xx (e j ) = Sxx (e j ) = X (e j )
50

IV. nh l ly mu
c th p dng cc k thut x l tn hiu s trong vic x l cc tn hiu tng
t th iu c bn u tin l cn chuyn i cc tn hiu tng t thnh dy cc s. Qu
trnh ny c thc hin bng cch ly mu tn hiu tng t theo chu k. Nu gi tn
hiu tng t l xa(t), x(n) l tn hiu ri rc theo thi gian thu c sau qu trnh ly
mu, T l chu k ly mu th:
x(n) = xa(nT) vi - < n <
(3.4.1)
Quan h (3.4.1) m t qu trnh ly mu trong min thi gian. qu trnh ly
mu khng lm mt mt thng tin ca ph tn hiu (khng gy ra hin tng trng ph )
th tn s ly mu Fs = 1/T phi c gi tr ln. Khi iu ny c m bo th tn hiu
tng t c th c khi phc chnh xc t tn hiu ri rc theo thi gian.
Nu xa(n) l tn hiu khng tun hon vi nng lng hu hn, th ph ca n c
th c xc nh bi quan h ca bin i Fourier :
X a (F) =
( t )e j2Ft dt
(3.4.2)
Ngc li, tn hiu xa(t) c th c khi phc t ph ca n qua bin i Fourier

ngc:
x a ( t ) = X a (F)e j2Ft dt
(3.4.3)
y, vic s dng tt c cc thnh phn tn s trong khong :- < F < l cn

thit c th khi phc c tn hiu xa(t) nu tn hiu ny c di tn v hn.
Ph ca tn hiu ri rc theo thi gian x(n) nhn c bng cch ly mu ca xa(t),
c biu din qua php bin i Fourier nh sau:
X ( ) =
x ( n )e
jn
(3.4.4)
n =
hoc : X (f ) =
x ( n )e
j2fn
(3.4.5)
n =
Ngc li, dy x(n) c th c khi phc li t X() hoc t X(f) qua bin i
ngc:
1
x (n ) =
2
X( )e
jn
d =
X ( f )e
j2fn
df
(3.4.6)
T quan h gia chu k ly mu T, cc bin c lp t v n:
t = nT =
n
Fs
(3.4.7)
Thay vo (3.4.2), ta suy ra quan h tng ng trong min tn s ca cc bin tn s

F v f gia Xa(t) v X(f) v ngc li:
x (n ) x a (nT) = X a (F)e
j 2n F
Fs
dF
(3.4.8)
T (3.4.6) v (3.4.8) ta c h thc quan h:
51

1
j 2fn
X(f )e df =
X a (F)e
j 2n F
Fs
dF
(3.4.9)
Khi qu trnh ly mu c thc hin tun hon th:
F
Fs
f=
(3.4.10)
Khi , h thc (3.4.9) tr thnh:
1
Fs
Fs
Fs
j 2n F
F j2n F Fs
Fs
X ( )e
dF = X a (F)e
dF
Fs
(3.4.11)
Bin i biu thc thuc v phi ca (3.4.11), ta c:
X a (F)e
j 2n F
Fs
dF =
( k + 1 ) Fs
2
k = ( k 1 ) F
2 s
X a (F)e
j2n F
Fs
dF
(3.4.12)
Thc hin vic i bin trong (3.4.12) v s dng tnh cht tun hon ca hm m:
j2 n
( F kFs )
Fs
=e
j2 n F
Fs
s cho ta: Xa(F) trong khong tn s (k-1/2)Fs n (k+1/2)Fs s hon ton tng ng vi
Xa(F - kFs) trong khong -Fs/2 n Fs/2. T , ta c:
( k + 1 ) Fs
2
k = ( k 1 ) F
2 s
X a (F)e
j 2n F
Fs
Fs
dF =
k = Fs
X a (F kFs )e
Fs
dF
Fs
(3.4.13)
2
j 2n F
Fs
k =
(F kFs ) e
j 2n F
Fs
dF
So snh (3.4.6) v (3.4.13) ta c:
F
X = Fs X a (F kFs )
k =
Fs
hoc:
X (f ) = Fs
(3.4.14)
X [(f k )F ]
k =
(3.4.15)
Cc h thc (3.4.14) v (3.4.15) a ra mi quan h gia ph X(F/Fs) hoc X(f) ca

tn hiu ri rc theo thi gian v ph Xa(F) ca tn hiu tng t. Thc cht, v phi ca
hai biu thc ny l s lp li c chu k ca ph c ly t l Xa(F) vi chu k Fs.
Xt quan h (3.4.14) v (3.4.15) vi cc tn s ly mu c gi tr khc nhau.
thc hin iu ny, ta xt vi v d l mt tn hiu tng t vi b rng ph hu hn. Tn
hiu ny c m t trn hnh (3.4a). Ph ca tn hiu s bng khng khi F B.
Nu chn tn s ly mu Fs 2B th ph X(F/Fs) ca tn hiu ri rc s c dng
nh trn hnh (3.4b). Nh vy, nu tn s ly mu Fs c chn sao cho Fs 2B, vi 2B l
tn s Nyquist th:
F
X = Fs X a (F)
Fs
(3.4.16)
52

trong trng hp ny hin tng trng ph s khng xy ra v v vy, trong min gii hn
ca tn s c bn F Fs/2 hoc f 1/2, ph ca tn hiu ri rc s ng nht vi ph
ca tn hiu tng t.
Nu chn tn s ly mu Fs< 2B th trong cng thc xc nh X , do c s lp

Fs
li c chu k ca Xa(F) nn s pht sinh hin tng trng ph, nh m t trn hnh (3.4c).
Khi ph X ca tn hiu ri rc theo thi gian s c cha cc thnh phn vi cc

Fs
tn s nhm ln ca ph tn hiu tng t Xa(F), v vy vic khi phc chnh xc tn hiu
gc t cc mu s khng th thc hin c.
xa(t)
Xa(F)
t
(a)
F
-B
x(n)
X(F/Fs)
FS Xa(F+Fs)
FS Xa(F-Fs)
FS Xa(F)
n
(b)
F
-Fs/2
-Fs
Fs/2
X(F/Fs)
x(n)
(c)
Fs
F
-Fs
Fs
Hnh 3.4. M t s ly mu tn hiu c b rng ph hu hn v s trm ph.

Trong trng hp khng c hin tng trng ph, tn hiu gc xa(n) c th c
khi phc li mt cch chnh xc t cc mu x(n):
1 F
X
X a (F) = Fs Fs
Fs
F>
Fs
(3.4.17)
Theo php bin i Fourier th:
j2F n
F
Fs
X = x (n )e
Fs n =
v bin i ngc Fourier s cho ta xa(t) t ph ca n Xa(F):

53

Fs
X (F)e
x a (t ) =
j 2Ft
Fs
dF
Gi s Fs= 2B, thay vo cc h thc trn, ta c:
1
x a (t) =
Fs
Fs
Fs
j 2F n

1
Fs
j 2Ft
x ( n )e
e dF = x F
n =
sin( / T )( t nT )
= x a ( nT )
( / T )( t nT )
n =
Fs
x (n )
n =
Fs
j 2F ( t n
Fs
dF
(3.4.18)
Cng thc (3.4.18) c cha hm:
g( t ) =
sin( / T ) t sin 2Bt

=
( / T ) t
2Bt
(3.4.19)
c dch bi cc lng nT, n = 0, 1, 2, 3, v c nhn vi cc mu tng ng xa(nT)

ca tn hiu ri rc. Cng thc (3.4.19) c gi l cng thc ni suy v c dng khi
phc tn hiu lin tc xa(t) t cc mu, cn hm g(t) trong (3.4.19) c gi l hm ni suy.
V ti t = kT th hm ni suy g(t-kT) s c gi tr bng khng, ngoi tr k = n; Do gi tr
ca xa(t) ti cc thi im t = kT s chnh l mu xa(kT). tt c cc thi im cn li, gi
tr ca xa(t) s bng gi tr ca hm ni suy sau khi ly t l vi xa(nT).
Cng thc (3.4.19) dng khi phc tn hiu lin tc xa(t) t cc mu, c gi l
cng thc ni suy l tng v l c s ca nh l ly mu.
Pht biu nh l ly mu
Tn hiu lin tc theo thi gian c b rng ph hu hn vi tn s cao nht B(Hz)
c th c khi phc mt cch duy nht t cc mu, nu qu trnh ly mu c thc
hin vi tc Fs 2B trn 1 giy.
54

chng 4
php bin i Fourier ri rc
Php bin i Fourier ca tn hiu ri rc, X(f), v mt l thuyt cho ta nhng cng
thc gii tch gn v p. N c s dng rng ri khi nghin cu cc tn hiu vit c
di dng gii tch. Tuy nhin n c mt s hn ch khi p dng trong thc t khi chy
chng trng my tnh. C th l:
1. di tn hiu s( s mu tn hiu em phn tch) l v cng. Trong khi di
tn hiu trong thc t bao gi cng l hu hn.
2. Bin c lp f ( tn s) ca X(f) l mt bin lin tc, trong khi vic x l tn
hiu trn my tnh bao gi cng phi c ri rc ho, s ho.
Do tm quan trng to ln ca php bin i Fourier nn ngi ta tm cch khc
phc cc hn ch trn bng cch a n v dng thch hp. l php bin i Fourier ri
rc ca tn hiu c di hu hn v c trc tn s cng c ri rc ho, thng c
gi mt cch ngn gn l php bin i Fourier ri rc, c vit tt trong ting Anh l
DFT, l mt thut ng c dng ph bin. Cn phn bit vi tn gi php bin i
Fourier ca tn hiu ri rc m ta nghin cu chng 3. Ngoi ngha v mt l
thuyt, DFT cn ng vai tr rt quan trng trong thc t x l tn hiu s do tn ti cch
tnh DFT rt hiu qu, tc nhanh FFT.
I. Ly mu trong min tn s - bin i Fourier ri rc
Trc khi nghin cu DFT, ta hy xt vic ly mu ca bin i Fourier i vi dy
tn hiu ri rc theo thi gian khng tun hon v t c th thit lp c quan h gia
bin i Fourier c ly mu vi DFT.
I.1. Ly mu trong min tn s v khi phc tn hiu ri rc theo thi gian
Xt bin i Fourier X(ej ) hay X() ca mt tn hiu khng tun hon ri rc theo
thi gian x(n):
X ( ) =
x ( n )e
jn
n =
Gi s tn hiu X() c ly mu tun hon v khong cch ly mu l . V

X() l tun hon vi chu k 2, do vy ch cn xt n cc mu c ly trong min tn
s c bn:
0 2 v s lng mu c ly trong khong ny l N, th khong cch
ly mu l = 2/N, (hnh 4.1).
X()
X(k )
ks ca
bin i
2Fourier
- 4.1. Ly mu tn
Hnh
Xt gi tr ca X() ti = 2k/N ta c:
55

X(
j
2
k ) = x ( n )e
N
n =
2kn
N
, vi k nguyn, k =[0..N-1]
(4.1.1)
Nu chia tng (4.1.1) thnh mt s lng v hn cc tng, trong mi tng cha N phn
t th ta c:
1
j
2
k ) = ... + x (n )e
N
n = N
X(
2 N 1
x ( n )e
2kn
N
2kn
N
N 1
+ x ( n )e
2kn
N
n =0
+ ... =
n=N
lN + N 1
l=
n =lN
x ( n )e
2kn
N
Thc hin vic i bin n = n - lN v i th t ly tng ta c:

N 1
2

j
k ) = x (n lN)e
N
n =0 l=
X(
2kn
N
(4.1.2)
Ch trong biu thc trn, s dng tnh cht:
2k ( n lN )
N
=e
x p (n ) =
Ta thy tn hiu:
2kn
N
.e j2kl = e
2kn
N
x (n lN)
(4.1.3)
l=
nhn c do s xp chng ca v s tn hiu x(n) t lch nhau mt chu k N.

Nh vy, xp(n) l tn hiu tun hon vi chu k c bn l N, nn c th khai trin
qua chui Fourier nh sau:
N 1
x p (n ) = c k e
2kn
N
,vi n nguyn: [0..N-1]
(4.1.4)
k =0
vi cc h s: c k =
j
1 N1
x p ( n )e
N n =0
2kn
N
,vi k nguyn: [0..N-1]
(4.1.5)
T (4.1.2), (4.1.3) v (4.1.5) ta c:
ck =
1
2
X( k )
N
N
x p (n ) =
j
1 N 1 2
X ( k )e
N k =0
N
(4.1.6)
2kn
N
(4.1.7)
Quan h (4.1.6) chnh l cng thc cho php khi phc li tn hiu tun hon xp(n)
t cc mu ca ph X(). Tuy nhin quan h ny khng th m bo c rng x(n) hoc
X() c th khi phc t cc mu hay khng. m bo iu ny, cn phi kho st
quan h gia x(n) v xp(n).
V xp(n) l tn hiu nhn c do s xp chng ca cc tn hiu x(n) t lch nhau
mt chu k N. V vy x(n) c th c khi phc t xp(n) nu khng c s trm thi
gian gia cc thnh phn ca xp(n). iu ny i hi x(n) phi c di hu hn L v
phi nh hn chu k N ca xp(n). Hnh 4.2 m t hai trng hp ca tn hiu xp(n) ng vi
cc trng hp N > L v N < L.
56

x(n)
L
xp(n)
xp(n)
N>L
N
N< L
-N
N L
Hnh 4.2. Dy khng tun hon x(n) v dy m rng xp(n).

Khng lm mt tnh tng qut, ta c th xem x(n) l mt dy c di hu hn vi
cc gi tr bng khng ngoi khong [0 .. L-1].
Nh vy ta c:
x(n) = xp(n),
0 n N-1
Cui cng, ph ca tn hiu khng tun hon ri rc theo thi gian c di hu
hn L c th khi phc mt cch chnh xc t cc mu ca n ti cc tn s k = 2k/N
nu N L:
x p (n )
x (n ) =
0
0 n N 1
j
1 N 1 2
x ( n ) = X ( k )e
N k =0
N
2kn
N
(4.1.8)
, vi: 0 n N-1
(4.1.9)
v:
2kn
j
1 N 1 2
jn N 1 2 1 N 1 j( 2Nk ) n
N
= X( k ) e
X ( ) = X( k )e
e
N
N N k =0
n = 0 N k =0
k =0
N 1
(4.1.10)
Tng ca cc phn t trong du ngoc vung ca (4.1.10) biu din cng thc ni
suy c dch bi 2k/N theo tn s. t:
N
N
N
N
j
j
j
( N 1)
sin
j
1 N 1 jn 1 1 e jN 1 e 2 e 2 e 2
2
=
e 2
p( ) = e
=
=
j
j
N k =0
N 1 e j
N j2
N sin
e e 2 e 2
2
N 1
2
2k
X( ) = X( k )p(
) , N L
N
N
k =0
Nh vy X() c th c xc nh thng qua cc mu X(
(4.1.11)
(4.1.12)
2
k ) ca n qua cng
N
thc ni suy (4.1.11) v (4.1.12).
57

II. Bin i Fourier ri rc i vi cc tn hiu tun hon

II.1. Cc nh ngha
a. nh ngha bin i Fourier ri rc.
Bin i Fourier ri rc ca cc dy tun hon xp(n) c chu k N c nh ngha
nh sau:
N 1
X p ( k ) = x p ( n )e
2
kn
N
(4.1.13)
n =0
t:
WN = e
2
N
WNkn = e
th ta c:
2
kn
N
v WNkn = e
2
kn
N
(4.1.14)
N 1
X p (k ) = x p (n ) WNkn
(4.1.15)
n =0
y chnh l biu thc ca bin i Fourier ri rc.

V d:
Cho dy tun hon xp(n) vi chu k N = 10, nh sau:
0n4
5n 9
1
x p (n ) =
0
Tm Xp(k).
Gii:
Dng ca xp(n) c biu din nh sau:
xp(n)
-6 -5
4 5
10
Hnh 4.3. th tn hiu tun hon chu k N=10.

9
X p (k ) = x p (n ) W10kn = e
n =0
2
kn
10
n =0
1 e
1 e
2
k5
10
2
k
10
sin
sin
10
j k4
10
= 5e
j k4
10
sin
sin
10
k
k
10
t:
A p (k ) = 5
sin
sin
10
k
k
10
ta c:
y:
X p (k ) = e
j k4
10
A p (k ) = X p (k ) e
(k ) = arg[X p (k )]
X p (k ) = A p (k )
(k ) =
j arg X p ( k )
= X p (k ) e j ( k )
2
k + {1 Sgn A p (k ) }
5
2
b. nh ngha bin i Fourier ngc.

58

Bin i Fourier ngc c nh ngha nh sau:

2
j k
1 N 1
x p ( n ) = X p ( k )e N
N k =0
(4.1.16)
hoc:
x p (n ) =
1 N1
X p (k )WNkn
N k =0
(4.1.17)
II.2. Cc tnh cht ca Bin i Fourier ri rc i vi cc tn hiu tun hon c

chu k n
a. Tnh cht tuyn tnh.
DFT l mt bin i tuyn tnh, tc l nu c hai dy x1p(n) v x2p(n) l cc dy
tun hon c cng chu k N v x3p(n) l t hp tuyn tnh ca hai dy trn:
x3p(n) = a.x1p(n) + b.x2p(n)
th ta c:
DFT[x3p(n)] = X3p(k) = a.X1p(k) + b.X2p(k)
(4.1.18)
trong :
DFT[x1p(n)] = X1p(k) v DFT[x2p(n)] = X2p(k)
b. Tnh cht tr.
Nu xp(n) l dy tun hon c cng chu k N vi DFT[xp(n)] = Xp(k), v dy xp(n +
n0) l dy tr ca xp(n) cng l dy tun hon chu k N th:
DFT[xp(n+n0)] = WN kn 0 X p (k )
(4.1.19)
c. Tnh i xng
Nu xp(n) l dy tun hon c cng chu k N vi DFT[xp(n)] = Xp(k) th:
DFT[x*p(n)] = X*p(-k)
(4.1.20)
Chng minh:
N 1
DFT x *p (n ) = x *p (n ) WNkn
n =0
N 1 *
kn
= x p (n ) WN
n =0

*
N1
= x p (n ) WNkn = X p (k )
n =0
Tng t ta cng c:
DFT[x*p(-n)] = X*p(k)
(4.1.21)
Chng minh:
N 1
DFT x *p ( n ) = x *p ( n ) WNkn
n =0
i bin m = - n ta c:
] x ( m) W
DFT x *p (n ) =
( N 1)
m =0
*
p
km
N
do tnh tun hon chu k N ca xp(n) v WN km nn ta c:

59

N 1
DFT x *p ( n ) = x p (m) WNkm = X *p (k )
m =0
V:
DFT{Re x p (n ) } =
1
X p (k ) + X *p (k )
2
1
DFT{Im x p (n ) } =
X p (k ) X *p (k )
2j
(4.1.22)
(4.1.23)
Chng minh:
xp(n) = Re[xp(n)] + j .Im[xp(n)]
x*p(n) = Re[xp(n)] - j .Im[xp(n)]
] 12 [x
Re x p (n ) =
DFT Re x p (n ) =
{ [
(n ) + x *p (n )
]} 12 [x
N 1
n =0
(n ) + x *p (n ) WNkn =
1
X p (k ) + X *p (k )
2
v:
1
x p (n ) x *p (n )
2j
Im x p (n ) =
DFT Im x p (n ) =
{ [
]}
1 N1
1
x p (n ) x *p (n ) WNkn =
X p (k ) X *p (k )
2 j n =0
2j
d. Tch chp tun hon

Cng thc tch chp c trnh by trong chng 1:
x 3 (n ) = x1 (n ) * x 2 (n ) =
x ( m) x
m =
( n m)
c gi l tch chp tuyn tnh. i vi tch chp ny cc dy l bt k. Tuy nhin tch

chp tun hon, chiu di cc dy tun hon l v cng nhng c cc chu k lp li ging
nhau, v th tng ch ly trong mt chu k. V ta c nh ngha tch chp tun hon nh
sau:
Tch chp tun hon ca hai dy tun hon x1p(n) v x2p(n) l c cng chu k N l
dy x3p(n) cng tun hon vi chu k N:
N 1
x 3p (n ) = x1p (n )(*)N x 2 p (n ) = x1p (m) x 2 p (n m)
(4.1.24)
m =0
Xt tch chp tun hon trong min k:

X3p(k) = X1p(k). X2p(k)
Chng minh:
(4.1.25)
N 1 N 1
N 1
N 1
X 3p (k ) = x1p (m) x 2 p (n m)WNkn = x1p (m) x 2 p (n m) WNkn

n =0 m =0
m =0
n =0
i bin: l = n - m, n = l + m v v x2p(n) l dy tun hon c chu k N, nn ta c:

N 1
m + N 1
N 1
N 1
m =0
l= m
m =0
l=0
X 3p (k ) = x 1p (m)
x 2p (l)WNk (l+m) = x1p (m)WNkm x 2p (l)WNkl = X1p (k )X 2p (k )
e.Tch ca hai dy
Nu ta coi tch ca hai dy tun hon x1p(n) v x2p(n) c cng chu k N l dy x3p(n)
cng tun hon vi chu k N:
60

x3p(n) = x1p(n).x2p(n)
th ta c:
X 3p (k ) = X1p (n )(*)N X 2 p (n ) =
1 N 1
X1p (m)X 2p (k m)
N m =0
(4.1.26)
Nh vy, tch i s trong min n th tng ng vi tch chp trong min k.

f. Tng quan tun hon.
Nu ta c hai dy tun hon x1p(n) v x2p(n) vi cng chu k N th hm tng quan
cho ca chng s c tnh ton trn mt chu k theo biu thc sau:
N 1
r x1px 2 p (n ) = x1p (m) x 2 p (m n )
(4.1.27)
m =0
Nh vy, hm tng quan cho ca hai dy cng l mt dy tun hon vi chu k N.

Xt trong min k:
R x1px 2 p (k ) = X p (k ).X p ( k )
(4.1.28)
III. Bin i Fourier ri rc i vi cc dy khng tun hon c chiu di hu

hn
III.1. Cc nh ngha
Nh cp n trong phn ly mu trong min tn s, mt dy x(n) khng tun
hon v c chiu di hu hn N, ta k hiu l x(n)N s nhn c bng cch trch ra mt
chu k N ca dy tun hon xp(n) c chu k N:
x p ( n )
x (n ) N =
0
0 n N 1
n < 0, n > N 1
nhn c dy x(n)N ta c th s dng mt dy ch nht:
1
rect N (n ) =
0
0 n N 1
n < 0, n > N 1
v thc hin tch:

x(n)N = xp(n).rectN(n)
Trong min k, i vi dy X(k) c th c xc nh nh sau:
X p ( k )
X (k ) =
0
0 n N 1
n < 0, n > N 1
X(k) = Xp(k).rectN(k)
Hn na, bin i Fourier ri rc i vi dy tun hon c chu k N ch tnh trong
mt chu k ri kt qu c tun hon ho t - n + vi chu k N lm nh
ngha cho bin i Fourier ri rc i vi dy c chiu di hu hn N nhng khng c
thc hin tun hon ho m ch ly t 0 n N-1.
Nh vy, bin i Fourier ri rc (DFT) i vi cc dy khng tun hon c chiu
di hu hn N c nh ngha nh sau:
a. Bin i Fourier thun:
v:
N 1
kn
x (n ) WN
X ( k ) = n =0
0
0 k N 1
(4.3.1)
n < 0, n > N 1
b. Bin i Fourier ngc:

61

1 N 1
kn
X(k ) WN
x ( n ) = N k =0
0
0 k N 1
(4.3.2)
k < 0, k > N 1
y ta gi X(k) l ph ri rc ca tn hiu x(n), nu biu din di dng modun v

argument ta c:
X ( k ) = X ( k ) e j ( k )
(k) = arg[X(k)]
(4.3.3)
trong : X(k) gi l ph ri rc bin v (k) gi l ph ri rc pha.
V d 1:
Tm DFT ca dy c chiu di hu hn x(n) sau:
x(n) = (n)
Gii: Trc ht ta chn chiu di ca dy, gi s l N. Vy dy x(n) c dng:
X(k)
x(n)
-1
N-1
-1
N-1
(a)
(b)
Hnh 4.4. a- Biu din ca dy x(n), b- Biu din ca ph ri rc bin
Khi X(k) c tnh nh sau:
0 k N 1
k < 0, k > N 1
N 1
1
X (k ) = (n ) WNkn =
n =0
0
Vy ph bin ri rc v ph pha ri rc l:
1
X (k ) =
0
0 k N 1
k < 0, k > N 1
(k) = 0.
Dng ca X(k) c biu din trn hnh 4.4b.
V d 2:
Tm DFT ca dy c chiu di hu hn x(n) sau, vi a < 1:
a n
x (n ) =
0
0 n N 1
Gii:
Theo nh ngha DFT ta c:
N 1 n kn
a WN
X ( k ) = n =0
0
V:
WNkn = e
2
kn
N
WNkN = e
0 k N 1
X(k ) = (aW
N 1
n =0
2
kN
N
k n
N
1 (aWNk )
=
1 aWNk
= e j2k = 1
62

(1 a )1 ae
N
X (k ) =
1 aN
=
1 aWNk
1 aN
2
j k
N
2
k
N
2
j k
1 ae N
2
2
1 a N 1 a. cos
k ja. sin
k
N
N
=
= X ( k ) e j ( )
2
1 + a 2a. cos
k
N
1 ae
1 ae
2
j k
N
Vy:
k + a2
1 2a. cos
N
2
2
X(k ) = {Re[X(k )]} + {Im[X(k )]} = 1 a N
2
1 2a. cos
k+a
N
2
2
a. sin N k
a. sin N k
Re[X(k )]
= arctg
= arctg
( ) = arctg
2
2
Im[X(k )]
1 a. cos
1 a. cos
k
k
N
N
III.2. Cc tnh cht ca bin i Fourier ri rc i vi cc dy chiu di hu

hn
Trong phn I, cho thy DFT chnh l tp hp N mu {X( 2k/N)} ca bin i
Fourier X() ca dy {x(n)} vi di hu hn L N. Vic ly mu ca X() c thc
hin ti N tn s cch u nhau v thng qua N mu. V ta c c DFT, IDFT ca
dy x(n). Trong phn ny ta s xt mt s tnh cht quan trng ca DFT. Ngoi tr mt s
tnh cht ring, v c bn cc tnh cht ny cng ging cc tnh cht ca bin i Fourier.
Cc tnh cht ca DFT c mt vai tr rt quan trng khi gii quyt cc bi ton trong thc
t.
a. Tnh cht tuyn tnh
DFT l mt bin i tuyn tnh, tc l nu ta c hai dy chiu di hu hn x1(n) v
x2(n) v dy x3(n) l t hp tuyn tnh ca hai dy ny, th:
X3(k) = a.X1(k) + b.X2(k)
(4.3.4)
Ch : nu chiu di ca dy x1(n) v x2(n) khc nhau th ta phi chn chiu di ca dy
x3(n) nh sau:
L[x3(n)] = N3 = max[N1, N2]
v tt c cc DFT[x1(n)], DFT[x2(n)] v DFT[x3(n)] u phi tnh trn N3 mu.
b. Tr vng
Trc ht ta xt hai v d sau nhm so snh tr tuyn tnh v tr tun hon:
V d 1. Cho dy x(n) sau:
n
1
x (n ) = 4
0
0n4
63

Tm tr tuyn tnh x(n-2) v x(n+2)

Gii: Ta gii bng phng php th nh hnh sau:
x(n+2)
x(n-2)
x(n)
0,5
-3
-2 -1 0
n
1
V d 2. Cho dy xp(n) tun hon vi chu k N = 4 sau: x p ( n ) = 4
0
0n4
Tm tr tun hon xp(n-2) v xp(n+2) sau ly ra mt chu k ca cc dy ny.

xp(n)
1
xp(n-2)
1
x(n-2)N
1
xp(n+2)
1
x(n+2)N
1
64

y ta dng cc k hiu:
x(n n0): Tr tuyn tnh
xp(n n0): Tr tun hon chu k N
x(n n0)N: Tr vng vi chiu di N
Qua hai v d trn ta thy:
Nu trch ra mt chu k (t 0 n N-1) ca tr tun hon chu k N th ta s c
tr vng x(n n0)N, so snh vi tr tuyn tnh x(n n0) th ta thy rng nu cc mu ca
tr tuyn tnh vt ra ngoi khong [0, N-1] th n s vng vo bn trong khong sao
cho dy c chiu di hu hn x(n)N xc nh trong khong [0, N-1] th tr vng ca n x(n
n0)N xc nh trong khong [0, N-1] ch khng c vt ra ngoi khong .
Vy tr vng tng ng vi vic hon v vng cc mu ca dy x(n)N trong khong
[0, N-1] v c biu din nh sau:
x(n) = x(n)N = xp(n).rectN(n)
(4.3.5)
x(n n0)N = xp(n n0)rectN(n)
Bn cht ca tr vng c th c minh ho nh sau:
x(n) x(n)4
1
-1 0
x(n-2)
1
-1 0
x(n-2)4=x(n)
1
x(1)
x(2)
-1 0
x(1)
x(0)
x(2)
x(3)
x(3)
x(0)
65

xc nh tr vng trong min k, do tnh i ngu nn trong min k tr vng

cng c bn cht tng t nh trong min n, tc l:
X(k - n0)N = Xp(k - n0).rectN(k)
(4.3.6)
v:
DFT[x (n n 0 ) N ] = WNkn 0 X(k )
trong :
DFT[x(n)]
Chng minh:
(4.3.7)
= X(k)
Ta c: DFT x p ( n n 0 ) N = WNkn 0 X p ( k )
Nu c hai v ta u ly ra mt chu k [0, N-1]:
x(n - n0)N = xp(n - n0).rectN(n)
X(k) = Xp(k ).rectN(k)
Vy ta c:
DFT[x (n n 0 ) N ] = WNkn 0 X(k )
c. Tnh i xng
Tnh i xng ca DFT c th nhn c bng cch p dng phng php c
s dng i vi bin i Fourier. Trong trng hp tng qut, dy x(n) c chiu di hu
hn N v DFT ca n u c gi tr phc. Khi , cc dy ny c th c biu din di
dng:
x(n) = Re[x(n)] +j .Im[x(n)]
v
X(k) = Re[X(k)] +j .Im[X(k)]
X*(k) = X(-k) = Re[X(k)] -j .Im[X(k)]
T cc bin i Fourier thun v nghch (DFT, IDFT) ta c:
N 1
2kn
2kn
+ Im[x (n )]sin
Re[X(k )] = Re[x (n )]cos
N
N
n =0
(4.3.8)
N 1
2kn
2kn
Im[X(k )] = Re[x (n )]sin

Im[x (n )]cos
N
N
n =0
(4.3.9)
Re[x (n )] =
1 N1
2kn
2kn
Re[X(k )]cos N Im[X(k )]sin N
N k =0
(4.3.10)
Im[x (n )] =
1 N 1
2kn
2kn
+ Im[X (k )]cos
Re[X(k )]sin
N k =0
N
N
(4.3.11)
Dy c gi tr thc:
Nu x(n) l dy thc th ta c:
X(N- k) = X*(k) = X(-k)
(4.3.12)
X(N- k)=X(k) v arg[X(N-k)] = - arg[X(k)]

v
x(n) cn c xc nh theo (4.3.10), l mt dng khc ca IDFT.
Tn hiu chn v thc:
Nu x(n) l dy chn v thc, th ta c:
x(n) = x(- n) = x(N-n)
(4.3.13)
66

T h thc (4.3.10) ta c Im[X(k)] = 0 v do vy DFT tr thnh:

N 1
X(k ) = x (n ) cos
n =0
2kn
N
(4.3.14)
l mt dy chn. Do Im[X(k)] = 0 nn IDFT tr thnh:
1 N 1
2kn
X(k ) cos
N k =0
N
x (n ) =
(4.3.15)
Tn hiu l v thc:
Nu x(n) l dy l v thc, th ta c:
x(n) = -x(- n) = -x(N-n)
(4.3.16)
T h thc (4.3.10) ta c Re[X(k)] = 0 v do vy DFT tr thnh:
N 1
X(k ) = j x (n ) sin
n =0
2kn
N
(4.3.17)
l mt dy l, phc thun tu. V do , IDFT tr thnh:
x (n ) =
1 N 1
2kn
1 N 1
2kn
= j X(k ) sin
Im[X(k )]sin
N k =0
N
N k =0
N
(4.3.18)
Dy phc thun tu:

N 1
Re[X(k )] = Im[x (n )]sin

n =0
N 1
Im[X (k )] = Im[x (n )]cos

n =0
2kn
N
(4.3.19)
2kn
N
(4.3.20)
Nu Im[x(n)] l l th Im[X(k)] = 0 v do vy X(k) l thc thun tu. Nu Im[x(n)]

l chn th Re[X(k)] = 0 v do vy X(k) l phc thun tu.
d. Tch chp vng.
Gi s x1(n) v x2(n) l hai dy c di hu hn N vi cc DFT tng ng l:
N 1
X1 ( k ) = x 1 ( n )e
j 2n k
n =0
v X 2 ( k ) =
N 1
x
n =0
( n )e
j2n k
Gi X3(k) l tch ca hai DFT trn: X3(k) = X1(k). X2(k); L DFT ca x3(n). Ta s tm
quan h gia x3(n) vi x1(n) v x2(n).
Bin i Fourier ngc ca X3(k) l:
x 3 (m) =
1 N 1
1 N 1
j2mk / N
X
(
k
)
e
=
3
[X1 (k ).X 2 (k )]e j2mk / N
N k =0
N k =0
N 1
1 N 1 N1
j2lk j 2mk / N
N
x1 (n )e j2nk / N x 2 (l)e
e
N k =0 n =0
l =0
(4.3.21)
N 1
N 1 j2 ( mn l ) k / N
1 N1
x
(
n
)
x
(
l
)
1
2
e
N n =0
l =0
k =0
Trong , tng biu din bi biu thc trong ngoc vung ca (4.3.21) c gi tr:
N 1
j 2 ( m n l ) k / N
k =0
N
=
0
l = m n + pN = ((m n ))N
Other
Thay vo (4.3.21) ta c:
67

N 1
x 3 (m) = x1 (n )x 2 ((m n ) )N
m = 0,1,2..., N 1
(4.3.22)
n =0
Biu thc (4.3.22) c dng ca mt tch chp. Tuy vy, y khng phi l mt tch
chp biu din quan h gia p ng v kch thch ca h thng tuyn tnh bt bin.
Trong tch chp ny, c cha ch s (m-n)N c trng cho tnh dch vng, v vy cng thc
(4.3.22) c gi l tch chp vng. Nh vy tch cc DFT ca hai dy s tng ng vi
tch chp vng ca hai dy trong min bin s c lp t nhin n.
V
d:
Tch
tch
chp
vng
ca
hai
dy
sau: x1 ( n ) = 2 1 2 1
x 2 (n ) = 1 2 3 4
Gii:
tnh tch chp vng ca hai dy, ta s tin hnh qua hai phng php sau:
PP1: S dng cc php bin i DFT v IDFT.
Ta c:
3
X1 (k ) = x1 (n )e j2nk / 4 = 2 + e jk / 2 + 2.e jk + e j3k / 2 , (k = 0,1,2,3)

n =0
X1(0) = 6;
X1(1) = 0;
X1(2) = 2;
X1(3) = 0.
X 2 (k ) = x 2 (n )e j2nk / 4 = 1 + 2.e jk / 2 + 3.e jk + 4.e j3k / 2 , (k = 0,1,2,3)

n =0
X2(0) = 10;
X2(1) =-2 + j .2;
X2(2) = -2;
X2(3) = -2 - j .2.
X3(1) = 0;
X3(2) = - 4;
X3(3) = 0.
X3(0) = 60;
theo nh ngha bin i Fourier ngc ta c:
x 3 (n ) =
1 3
1
X 3 (k )e j2nk / 4 = (60 4e jn ), (n = 0,1,2,3)
4 k =0
4
x3(1) = 16;
x3(2) = 14;
x3(3) = 16.
x3(0) = 14;
PP2: M t cc mu ca tng dy thng qua cc im trn hai vng trn khc nhau.
Cch m t ny nh th hin trn hnh 4.5a, chiu dng c quy c l ngc chiu kim
ng h.
3
+. Vi m = 0, ta c:
x 3 (0) = x 1 (n ) x 2 (( n )) 4
n =0
Hnh 4.5b m t v tr cc mu ca dy bin s o x((-n))4 trn ng trn. Cc v

tr ny nhn c bng cch v cc im mu theo chiu m; v ta nhn c: x3(0) = 14.
3
+. Vi m = 1, ta c:
x 3 (0) = x1 (n ) x 2 ((1 n )) 4
n =0
Dy x2((1-n))4 nhn c bng cch quay cc im ca x2((-n))N i mt n v thi

gian theo chiu dng, hnh 4.5c m t v tr cc mu ca dy bin s o x2((1-n))4 trn
ng trn, v nhn c: x3(1) = 16.
Tng t, (cc hnh 4.5d v e) ta cng xc nh c cc gi tr cc mu cn li:
x3(2) = 14 v x3(3) = 16.
68

x2(1) =2
x1(1) =1
x1(2) =2
x1(0) =2
x1(n)
(a)
x2(2) =3
x2(0) =1
x2((-n))4
x2(0) =1
X2(3) =4
4
x1(3) =1
x2(3) =4
x2(2) =3
x2(n)
(b)
x2(1) =2 Dy bin o
x2(0) =1
x1(n)x2((-n))4
2
1
Dy tch
(c)
x2(3) =4
x2(0) =1
x2(1) =2
x2((1-n))4
x2(2) =3 Dy bin o quay 1 n v
x2(1) =2
(d)
x2(2) =3
x2((2-n))4

(e)
x2(2) =3
x2(1) =2
x1(n)x2((1-n))4
x2(3) =4
x2((3-n))4
Dy tch
x1(n)x2((2-n))4
Dy tch
x1(n)x2((3-n))4
Dy tch
Hnh 4.5. Tch chp vng ca hai dy.

IV. Hiu ng hn ch di tn hiu phn tch Fourier
Ta bit rng mt tn hiu c di hu hn N c th c biu din mt cch
y thng qua php bin i Fourier ri rc DFT. Tuy vy, khi cc tn hiu c di
qu ln hoc v hn th vic xc nh bin i Fourier ri rc ca n l khng th thc
hin c. Trong trng hp ny, ta cn ly mt on thch hp nht ca tn hiu vi mt
di cho php thc hin bin i DFT. Khi r rng rng phng php DFT ch cho
69

ra mt kt qu xp x ca tn hiu. y, ta xem xt vn hn ch di ca tn hiu v

cc hiu ng pht sinh do vic s dng phng php DFT i vi dy c hn ch v
di.
Nu tn hiu cn phn tch l tn hiu tng t th trc tin tn hiu ny cn c
chuyn qua b lc loi b cc nhiu (hoc cc thnh phn ca tn s khng cn thit)
v sau c ly mu vi tn s F s 2B, vi B l rng ca di thng. Nh vy tn s
cao nht ca hi thnh phn c cha tn hiu khi ly mu l F s /2. c th hn ch
di ca tn hiu c ly mu, gi s ch xt tn hiu trong mt khong thi gian hu
hn T 0 = NT, trong N l s lng mu v T l khong thi gian gia hai ln ly mu
(chu k ly mu). Khong thi gian ly mu ny v nguyn tc s hn ch phn gii v
tn s; ngha l n s hn ch kh nng phn bit i vi cc thnh phn tn s m
khong cch gia chng nh hn 1/ T 0 = 1/NT trong min tn s.
Gi s rng {x(n)} l tn hiu cn phn tch. C th thy vic gii hn di ca
dy {x(n)} vi N mu trong khong n0 n n0 + N-1 , s tng ng vi vic nhn tn
hiu ny vi mt hm ca s vi di N ( n gin, t y ta coi n0 = 0, khi cc kt
qu vi n0 <> 0 s nhn c bng cch p dng tnh cht tr v dch chuyn. V khi
khong xc nh ca N mu s l: 0 n N-1). Ngha l:
0 n N 1
x(n)
0
Trong x N (n) = x(n)w(n) =
Vic nhn tn hiu vi hm ca s theo thi gian tng ng vi vic ly tch chp
ph ca tn hiu x(n) vi ph ca ca s:
X N ( e j ) =
j
1
2
X(e
j '
) W (e j( ') )d ' = X(e j ) * W (e j )
trong : XN(e ), X(e ) v W(ej ) l cc bin i Fourier tng ng ca xN

Vi tn hiu xN(n), chng ta c th p dng DFT v n c chiu di hu hn. Cc h
j
s XN(e ) ca DFT lc ny s biu din gn ng cho cc mu ca X(ej ). nh gi mc
xp x, chng ta phi nh gi tch chp trn y, theo tng kiu ca s quan st.
Vn th hai l s lng mu N c chn nh th no v v tr ca s t u
(tc l tm n0), cng nh mc nh hng ca hm ca s chn.
chn v tr ca s, ta phi cn bit c th thm v tn hiu cn phn tch. Ni
chung, nguyn tc chn v tr ca s (chn n0) sao cho ca s bao trm ln phn quan
trng ca tn hiu v b qua nhng on tn hiu c bin nh khng ng k.
V d tn hiu c dng:
x(n) = a|n| vi a<1
th cc mu c bin ln tp trung gc to . Bi vy ca s cn t xung quanh gc
to .
a. Hm ca s ch nht
Hm ca s ch nht c biu din nh sau:
1
w R (n ) = Re ct N (n ) =
0
0 n N 1
n
Trong min tn s, ta c:
70

j
WR (e ) =
N
N 1
2 e j 2
sin
sin
b. Ca s tam gic
Trong min n, ca s tam gic c nh ngha nh sau:
2n
N 1
2n
w T (n ) = 1
N 1
0
0n
N 1
2
N 1
n N 1
2
n
WT (e j ) =
2 j
e
N 1
N 1
2
N 1
2
sin
sin
c. Ca s Hanning v Hamming
Trong min n, ca s Hanning v Hamming c nh ngha nh sau:
2n
(1 ) cos
w H (n ) =
N 1
0
0 n N 1
n
- Nu = 0,5 ta c ca s Hanning nh sau:
2n
0,5 0,5 cos

w Han (n ) =
N 1
0
0 n N 1
n
- Nu = 0,54 ta c ca s Hamming nh sau:
2n
0,54 0,46 cos

w Ham (n ) =
N 1
0
0 n N 1
n
V trong min tn s, ta c:
WH (e j ) = e
N1
j
2
N N
N N
N
sin
sin +
sin
1
2 N 1 1
2 N 1
+
+

2
2
sin
sin
sin +
2
2 N 1
2 N 1
Bi v thng qua DFT ta c th biu din mt dy vi di hu hn trong min

tn s qua cc tn s ri rc, do DFT c th c s dng nh mt cng c tnh ton
trong vic phn tch cc h thng tuyn tnh v c bit cho cc b lc tuyn tnh. Tuy
71

nhin khng th tnh

Chng ta bit rng, khi mt h thng vi p ng tn s H()
c kch thch bi tnh hiu u vo c ph l y()=X()H(). Dy u ra y(n) c xc
nh t ph ca n thng qua bin i ngc Fourier. Tuy vy, khi tnh ton ,c th thy
vn ny sinh khi s dng cc phng php trong min tn s l c X(), H() v Y()
u l cc hm lin tc ca bin , v vy khng th s dng my tnh s x l bi v
my tnh ch c th lu tr v thc hin cc vic tnh ton trn cc gi tr ri rc ca tn
s .
C th thy DFT rt thch hp vi vic tnh ton trn my tnh s v c th c s
dng thc hin vic lc tuyn tnh trong min tn s .Mc d chng ta a ra cc th
tc tnh ton trong min thi gian nh tch chp, tuy nhin trong min tn s cc phng
php da trn DFT li t ra hiu qu hn nhiu so vi phng php tch chp trong min
thi gian do tn ti mt lot thut ton mi hiu qu hn. Cc thut ton ny c gi l
bin i nhanh Fourier(FFT) v s c trnh by trong chng 5.
IV.1 S dng DFT trong lc tuyn tnh
Mc d tch ca hai DFT s tng ng vi tng chp vng ca hai dy tng ng
c biu din trong min thi gian, nhng c th thy cng thc ca tch chp vng li
khng dng c trong trng hp cn xc nh u ra ca b lc tuyn tnh khi u vo
chu s tc ng ca tn hiu. Trong trng hp ny cn phi tm mt phng php no
trong min tn s tng ng vi tng chp tuyn tnh.
Gi s x(n) l dy c di hu hn Lv c tc ng ln b lc tuyn tnh vi
di M. Khng lm mt tnh tng qut ta c th gi s :
x(n)=0
n<0 v nL
h(n)=0
n0 v nM
y h(n) l p ng xung ca b lc FIR c th c xc nh thng qua tng
chp ca x(n) v h(n):
y(n ) =
M 1
h (k )x (n k )
k =0
Bi v x(n) v h(n) l cc dy vi d di hu hn do vy tng chp ca chng cng

c di hu hn. C th di l L + M-1.
Trong min tn s, cng thc tng ng vi tch chp s l :
Y()=X()H()
Nu dy y(n) c biu din mt cch duy nht trong min tn s bng cch ly
ph Y(n) ti cc tn s ri rc phn bit nhau th s lng cc mu ny phi bng hoc
ln hn L + M-1. Nh vy c th biu din y(n) mt cch duy nht trong min tn s
th cn phI s dng DFT vi di NM+L-1.
Sau khi ly mu, ta c:
Y(k)Y()=2k/N, k=0,1,,,N-1
Xk)H)=2k/N, k=0,1,,,N-1
V
Y(k)=X(k)H(k),
k=0,1,,,N-1 (4.3.3)
Trong cng thc (4.3.3) th X(k) v Y(k) l cc DFT - N im ca cc dy tng ng
x(n) v y(n) c di hu hn nh hn N do vy ta ch cn thm cc mu khng vo cc
dy tng di ca chng ln N .Vic tng di ca cc dy s khng nh hng n
ph lin tc X() v H) ca chng bi v cc dy ny l cc dy tun hon. Tuy vy, bng
72

cch ny (s dng DFT-N im) s lng mu dng biu din cc dy trong min tn
s vt qu s lng nh nht (L hoc M).
Bi v DFT vi di M+L-1 im ca dy u ra y(n) trong min tn s suy ra
rng c th xc nh c
{y(n)} thng
qua IDFT sau khi xc nh tnh ca cc DFT
N im X(k) v H(k). Nh vy ging nh iu khng nh trong phn 4.2.2 c th kt

lun rng tng chp vng N im ca x(n) v h(n) s tng ng vi tng chp tuyn tnh
ca hai dy ny. Ni mt cch khc,bng cch tng di ca hai dy x(n) v h(n) ln N
im thng qua vic a thm cc khng v tnh tng chp vng trn cc dy mi ta s
nhn c kt qu ging vi trng hp s dng tng chp tuyn tnh. T y suy ra vi
cc mu khng c thm vo th DFT c th c s dng thc hin vic lc tuyn
tnh.
V d 4.3.1: S dng IDFT v DFT hy xc nh p ng ca b lc tuyn tnh.
H(n) = {1,2,3}
Khi tn hiu vo l:
X(n) = {1,2,2,1 }
Gii: dy u vo c di L=4 v p ng xung c di M=3. Tng cp tuyn
tnh ca hai dy ny s cho kt qu vi di l N=6. Suy ra rng, di ca cc DFT cn
s dng t nht phI bng 6.
y, n gin ta s s dng cc DFT 8 im. DFT 8 im ca x(n) s l:
7
X(k)=
x ( n)e
j 2kn / 8
= 1 + 2E- jk/4 + 2e jk/2 +2e j3k/4 , k=0,1,7
n=0
T y suy ra:
4+3 2
2+ 2
- j
2
2
X(0) =6
X(1)=
X(2) = - 1-j
X(3) =
43 2
2 2
- j
2
2
X(4) = 0
X(5) =
43 2
2 2
- j
2
2
X(6) = - 1+j
X(7) =
4+3 2
2+ 2
+j
2
2
DFT 8 im ca h(n) l:
7
H(k)=
h( n)e
j 2kn / 8
= 1 + 2E- j k/4 + 3e j k/2
n=0
Suy ra:
H(0) = 6
H(1) = +
2 -j ( 3+ 2 )
H(2) = -2-j2
H(3) =1-
2 +j ( 3 - 2 )
H(4) = 2
H(5) =1-
2 -j ( 3 - 2 )
H(6) =-2 + j2
H(7) = 1+
2 +j ( 3+ 2 )
Tch ca 2 DFT va tnh trn s cho Y(k) v do vy:

Y(0) = 36
Y(1) = - 14.07 - 17.48
Y(2) = j4
Y(3) = 0.07 +j0.515 Y(4) = 0
Y(5) = 0.07 - j.0515
73

Y(6) = -j4
Y(7) = - 14.07 + j17.48
Cui cng IDFT - 8 im:
7
Y(n) =
Y ( k )e
j 2kn / 8
, n= 0,1,7
n =0
s cho kt qu l: y(n) = {1,4,9.11,8,3,0,0}

Do dy y(n) ch c su phn t nn cc gi tr u s b loi b. Hai phn t ny c
gi tr bng khng bi v ta s dng di ca cc DFT l 8 im v qu mc cn thit
2 im.
Mc du tch ca hai DFT tng ng vi tng chp vng trong min thi gian, tuy
nhin ta cng thy rng vic a thm vo cc dy x(n) v h(n) vi mt s lng cc
mu c gi tr khng lm cho tng chp vng c cng kt qu vi tng chp tuyn tnh.
Trong trng hp lc F ca v d 4.3.1 th tng chp vng 6 im ca cc dy:
h(n) = {1,2,3,0,0,0,}
(4.3.4)
x(n) = {1,2,2,1,0,0,}
(4.3.5)
s cho dy u ra:
y(n) = {1,4,9.11,8,3}
(4.3.6)
ging vi dy nhn c bng tng chp tuyn tnh.
Mt iu rt quan trng cn lu l khi di ca cc DFT nh hn L + M - 1 th
kt qu nhn c s c s sai lch so vi kt qu ng.
V d di y s cp n vn ny:
V d 4.3.2: Hy xc nh dy y(n) bng cch s dng cc FT - 4 im i vi v d
4.3.1
Gii: DFT -4 im ca h(n) l:
3
H(k) =
h ( n )e
j 2k / 4
n =0
H(k) = 1+ 2e- jk/2 + 3e- jk , k= 0,1,2,3

Suy ra:
H(0) =6
H(1) = -2 j2 H(2) = 2 H(3) = -2 + j2
DFT-4 im ca x(n) l:
X(k) = 1+ 2e- jk/2 + 2e- jk + 3e- jk/2 , k= 0,1,2,3
T y suy ra:
Y(n) = {9,7,9,11}
Kt qu ny cng ging vi kt qu nhn c nu ta s dng tng chp vng 4
im ca h(n) v h(n).
Nu so snh kt qu ca y(n) nhn c t DFT-4 im vi dy y(n) nhn c
bng cch sdng DFT-8 im ( thc cht ch cn 6 im) th ta s thy cc kt qu ny c
s sai lch nh cp trong phn 4.2.2. C th c th tm thy quan h sau:
y(0) = y(0) + y(4) =9
y(5) = y(1) + y(5) =7
Trong 4 gi tr tm c ca y(n) th ch hai gi tr u l sai lch so vi cc gi tr
tng ng ca y(n).
Nh vy c th thy nu x(n) l dy hu hn vi dI L, h(n) l dy hu hn c
dI M (gi s L>M) th khi s dng cc DFT v IDFT s c M-1 gi tr u b sai lch
so vi gi tr ng v cn phI loi b. y l mt kt lun rt quan trng cn c s
dng v sau.
74

IV.2. Lc cc dy s c di d liu ln
Trong thc t, thng thng bi ton lc tuyn tnh ca tn hiu thng c d liu
u vo x(n) vi di rt ln. iu ny li cng ng i vi mt vi ng dng x l tn
hiu trong thi gian thc c lin quan n vic theo di v phn tch tn hiu. Khi tn hiu
c di qu ln th r rng vic s dng my tnh trong qu trnh x l theo phng
php DFT cng gp phi mt s kh khn:
Vic x l c th i hi mt dung lng b nh rt ln trong khi b nh ca my
tnh l c hn.
- Thi gian tnh ton qu ln vt hn thi gian cho php.
c c mt s mu u tin th phi i cho n khi kt thc tt c qun trnh
tnh ton.
khc phc cc nhc im ny, tn hiu vo c di ln cn phi c
phn thnh cc on khc nhau vi di nht nh trc khi thc hin vic x l. Bi v
b lc l tuyn tnh do vy vic x l cc dy tn hiu ny c th c tin hnh mi thi
im khc nhau thng qua DFT. Cc tn hiu u ra ny sau c kt hp vi nhau
c th nhn c u ra tng ng vi trng hp b lc c tc ng bi mt tn hiu
u vo duy nht.
Da vo vic phn tn hiu u vo thnh cc on c kch thc va phI, c hai
phng php DFT hay c s dng i vi b lc FIR tuyn tnh vi tn hiu vo c
di qu ln. Phng php th nht c gi l phng php t k nhau, phng php
th hai c gi l phng php xp chng. Trong c hai phng php ta s gi s b lc
FIR c di l M, dy u vo c chia thnh cc dy con vi di mi dy l L. y
khng lm mt tnh tng qut, gi s rng L>>M.
IV.2.1. Phng php t k nhau
Theo phng php ny, di ca mi on d liu u vo s l N = L+ M 1,
di ca DFT v IDFT c s dng s l N. Nh vy di ca cc on d liu u vo
c tng t L ln L+ M -1. Trong trng hp ny, c th xem x(n) nh l tng ca cc
dy thnh phn t k nhau M-1 im v mi dy cha M-1 im cui cng ca dy trc
v L im d liu mi. Ring dy u tin s c b sung thm M-1 mu khng u tin.
Nh vy, cc dy d liu thnh phn ca x(n)s l:
x 1 (n) = {0, 0,..., 0, x(0), x(1),..., x(L-1)}
(4.3.7)
x 2 (n) = {x(L - M + 1),..., x(L-1), x(L),..., x(2L-1)}
(4.3.8)
x 3 (n) = {x(2L-M + 1),..., x(2L-1), x(2L),..., x(3L-1)}
(4.3.9)
v v.v..
DFT - N im s c tnh i vi mi dy thnh phn. di p ng xung ca
b lc FIR cng c tng thm L-1 mu khng v DFT N im ca dy s c tnh v
lu tr li. Tch ca hai DFt N im {H(k)} v {X m (k)} i vi mi dy d liu s cho
kt qu:
Y m (k) = H(k ) X m (k),
k= 0,1,...,N-1
(4.3.10)
IDFT - N im s cho kt qu:

y m (n) = y m (0) y m (1)... y m (M-1) y m (M),... y m (N-1)
(4 .3.11)
Bi v DFT v IDFT c s dng y ch c di ca chui u vo cho nn

theo kt lun trong 4.3.1, M-1 im u tin ca dy kt qu ny s b loi b. L im cui
75

cng ca dy Y m (n) s hon ton trng vi cc gi tr tng ng c tnh theo tng

chp tuyn tnh, ngha l:
y m (n) = y m (n),
n = M,M+1, ..., N-1
(4.3.12)
Vic phn on d liu u vo v sp xp cc khi d liu u ra tng ng vi

chng nhn c dy d liu u ra kt qu c m t trn hnh 4.10.
IV.2.2. Phng php cng xp chng
Theo phng php ny, kchs thc ca mi dy thnh phn l L im v di
ca Dft v IDFt l N = L+M-1. i vi mi dy thnh phn ny ta a thm M-1 mu
khng v tnh DFT N im. Nh vy cc dy thnh phn c biu din nh sau:
x 1 (n) = {x(0), x(1),..., x(L-1), 0,0,...,0}
(4.3.13)
x 2 (n) = {x(L), x(L+1),..., x(2L-1), 0,0,...,0}
(4.3.14)
x 3 (n) = {x(2L), ..., x(3L-1), 0,0,...,0}
(4.3.15)
v v.v.. Hai DFT N im c nhn vi nhau nhn c:

Y m (k) = H(k) X m (k), k = 0,1,...,N-1
(4.3.16)
DFTl phng php gin tip tnh u ra ca b lc tuyn tnh v cho n thi
im ny c th thy phng php tng i phc tp do mt lot cc thao tc cn phi
c thc hin nh dy u vo cn phi c chuyn i sang min tn s thng qua
DFt, nhn kt qu nhn c vi DFt ca b lc FIR v sau nhn c kt qu cui
cng li phi thc hin bin i ngc IDFT sang min thi gian. Mc d vy phng
php ny li cho php s dng mt thut ton rt hiu qu (bin i nhanh Fourier). So
vi vic x l trc tip b lc FIR trong min thi gian, cc thut ton bin i nhanh ch
i hi rt t cc php ton c th nhn c dy u ra v dy chuyn chnh l nguyn
nhn ch yu dn n vic s dng rng ri phng php DFt trn thc t. Cc thut
ton bin i nhanh Fourier s c gii thiu trong chng VI
4.4. Phn tch tn hiu trong min tn s bng DFT
Ta bit rng mt tn hiu c di hu hn N c th c biu din mt cch
y thng qua php bin i Fourier ri rc DFt. Tuy vy, khi cc tn hiu c di
qu ln hoc v hn th vic xc nh bin i Fourier ri rc ca n l khng th thc
hin c. Trong trng hp ny, ta cn ly mt on thch hp nht ca tn hiu vi mt
di cho php thc hin bin i DFT. Khi r rng rng phng php DFt ch cho
ra mt kt qu xp x ca tn hiu. y, ta xem xt vn hn ch di ca tn hiu v
cc hiu ng ni sinh do vic s dng phng php DFT i vi dy c hn ch v
di.
Nu tn hiu cn phn tch l tn hiu tng t th trc tin tn hiu ny cn c
chuyn qua b lc loi b cc nhiu (hoc cc thnh phn ca tn s khng cn thit)
v sau c ly mu vi tn s F s 2B, vi B l rng ca di thng. Nh vy tn s
cao nht ca hai thnh phn c cha tn hiu khi ly mu l F s /2. c th hn ch
di ca tn hiu c ly mu, gi x ch xt tn hiu trong mt khong thi gian hu
hn T 0 = LT, trong L l lng mu v T l khong thi gian ga hai ln ly mu ( chu
k ly mu). Khong thi gian ly mu ny v nguyn tc s hn ch phn gii v tn
76

s; ngha l n s hn ch kh nng phn bit i vi cc thnh phn tn s m khong

cch gia chng nh hn 1/T 0 = 1/LT trong min tn s.
Gi s rng {x(n)} l tn hiu cn phn tch. C th thy vic gii hn di ca
dy {x(n)} vi L mu trong khong 0 n L-1 s tng ng vi vic nhn tn hiu ny
vi mt hm ca s hnh ch nht (gi tt l hm ca s) vi di L. Ngha l:
X(n) = x(n) (n)
Trong
1
(n) =
0
0 n L 1
n
Hy xt mt trng hp n gin khi dy x(n ) l dy tn hiu hnh sin:

X(n)=
IV. Tch chp nhanh (tch chp phn on)

a. Tng quan
77

ng dng DFT vo vic tnh tch chp khng tun hon, tc tch chp tuyn
tnh, trc ht cn phn bit hai trng hp:
Trng hp th nht khi cc dy chp vi nhau c chiu di gn bng nhau v
ngn.
Trng hp th hai l khi cc dy chp vi nhau v c chiu di khc xa nhau.
Trng hp th nht chnh l trng hp c nghin cu phn trn. Nhng
trong thc t, ta thng gp trng hp th hai. Vic tnh ton DFT ca dy c chiu di
qu ln s b hn ch bi vn dung lng b nh ca my tnh in t v thi gian tnh
ton khng m bo. Hn na, c c mu u tin ca kt qu ta phi i n khi
kt thc qu trnh tnh ton.
gii quyt cc vn trn, chng ta phi chia qu trnh tnh ton ra thnh
nhiu giai on. C hai phng php gm cc ni dung chnh:
- Chia dy thnh nhiu dy con.
- Chp tng dy con mt
- T hp cc kt qu thnh phn.
Gi s dy x(n) c chiu di N, dy h(n) c chiu di M v N >> M. Khi chph
ca x(n) v h(n) l y(n) s c chiu di N+ M - 1. Nu N rt ln th ta khng th dng DFT
tnh trc tip tch chp ny c. V th, nu mun dng DFT ta phi phn dy x(n) ra
lm nhiu on nh.
b. Phng php 1: Cng xp chng
Gi s ta cn tnh tch chp tuyn tnh
y(n) = x(n)*h(n)
L[x(n)] = N, L[h(n)] = M v N >> M.
Dy x(n) c coij l tng ca cc dy thnh phn xi(n), m L[xi(n)] = N1. Tc l:
x (n ) = x i (n )
(4.4.1)
vi
iN1 n (i + 1) N1
x ( n )
x i (n ) =
0
Mt khc ta c:
h ( m) x ( n m) =
y( n ) = h ( n ) * x ( n ) =
m =
=
i
h ( m ) x ( n m )
m =
(4.4.2)
h (m) x ( n m) = h (n ) * x ( n ) = y (n )
m =
khi , yi(n) = h(n)*xi(n) gi l tch chp phn on, y l tch chp tuyn tnh, nu dng
DFT th mi tch chp phn on ny ta phi tnh DFT vi chiu di N1+M-1. Tc l ta
phi tnh tch chp vng vi chiu di 2(N1+M-1):
78
Chng 3
Php bin i Fourior ri rc.
I. M u:
T trc ti nay chng ta hc nhiu loi bin i Fourier nh sau:
1. Chui Fourier,p dng cho tn hiu lin tc v tun hon.
2. Tch phn Fourier dng cho tn hiu lin tc v khng tun hon.
3. Bin i Fourier ca tn hiu ri rc va c trnh by chng 1.
Php bin i Fourier ca tn hiu ri rc, X(f), v mt l thuyt cho ta
nhng cng thc gii tch gn v p. N c s dng rng ri khi nghin
cu cc tn hiu vit c di dng gii tch. Tuy nhin n c mt s hn ch
khi p dng trong thc t khi chy chng trng my tnh. C th l:
1. di tn hiu s( s mu tn hiu em phn tch) l v cng.
Trong khi di tn hiu trong thc t bao gi cng l hu hn.
2. Bin c lp f ( tn s) ca X(f) l mt bin lin tc, trong khi
vic s l tn hiu trn my tnh bao gi cng phi c ri rc ho, s ho.
Do tm quan trng to ln ca php bin i Fourier nn ngi ta tm cch
khc phc cc hn ch trn bng cch a n v dng thch hp. l php
bin i Fourier ri rc ca tn hiu c di hu hn v c trc tn s
cng c ri rc ho, thng c gi mt cch ngn gn l php bin i
Fourier ri rc, c vit tt trong ting Anh l DFT, l mt thut ng c
dng ph bin. Cn phn bit vi tn gi php bin i Fourier ca tn hiu
ri rc m ta nghin cu chng 1. Ngoi ngha v mt l thuyt, DFT
cn ng vai tr rt quan trng trong thc t x l tn hiu s do tn ti cch
tnh DFT rt hiu qu, tc nhanh m ta s dng hn mt chng trnh
by (chng DFT). Sau chng ta s nghin cu cc tnh cht v ng dng
ca n. l ni dung chnh ca chng ny.
C nhiu phng php dn dt n php bin i nhiu phng php ri rc
(DFT) nh:
- T php bin i ca tn hiu ri rc nhng tun hon, tc l chui
nhiu phng php ri rc.
- Trc tip trc tn s ca X(f).

Chng ta s lm theo cch u, sau xem xt thm cc cch sau.
II. Chui Fourier ri rc cuat tn hiu ri rc tun hon
Chng ta lm quen vi khi nim chui Fourier v tch phn Fourier i
vi tn hiu tng t. tng ch o ca vic phn tch Fourier l phn tch
hm tn hiu thnh cc hm iu ho (thc hoc phc). i vi tn hiu ri
rc cng vy, ta vn s dng tng ch o trn: Phn tch tn hiu ri rc
thnh t hp tuyn tnh ca cc hm iu ho.
Cng tng t nh khi phn tch tn hiu tng t, ta hy xem xt vic khai trin
Fourierdy tn hiu tun hon thnh chui.
Tn hiu tun hon Xp (n)l tun hon vi chu k N nu Xp (n)=Xp (n+N)
vi mi n ( ch s p ch period: tun hon). i vi tn hiu ri rc, chng ta
s khai trin Fourier theo hm:
j( 2 k / N ) n
k = 0, 1, 2
(3.1)
k (n) = e
Ta thy ton b tp hp tn hiu e m phc ny u l hm tun hon vi chu
k N:
k (n) = k (n+ lN)
l nguyn
(3.2)
Tt c cc tn hiu ny u c tn s l b i ca tn s c bn, 2/N, do vy

chng c quan h iu ho vi nhau.
im khc bit quan trng ca cc tn hiu ny so vi tn hiu tng t l:
Trong khi tt c cc hm iu ho lin tc c tn s khc nhau th phn bit
vi nhau, cn cc hm iu ho phc ri rc ch c Ntn hiu phn bit vi
nhau v cc tn hiu sai khc nhau l bi ca N th u nh nhau:
j( 2 k / N ) n
(3.3)
k(n) = k N (n) = k 2 N (n) = e
By gi chng ta mun trin khai tn hiu tun hon x(n) thnh:
x p (n) =
a k k
k
(n) =
ak
k
e j(2k / N ) n
(3.4)
Do k (n) ch phn bit c vi N gi tr lin tc ca k nn tng trn ch cn

tnh trong khong ny: tng tnh theo bin chy k thai i trong mt gii N
nguyn t k nhau lin tc, v cho tin ta k hiu k = <N > ngha l k c
th ly k= 0,1,, N- 1, hoc k = 2,3,,N+2 hoc tng qut hn: k = k 0 ,
k 0 + N-1 vi k 0 l s nguyn tu .
a k e j(2 k / N ) n
x p (n) = k =< N >

(3.5)
Cng thc (3.5) trn c gi l chui Fourier ri rc (DFS) ca tn hiu tun
hon v ri rc x p (n), trong cc h s a k l cc h s khai trin chui
Fourier ri rc hay cn c gi l cc vch ph ca tn hiu tun hon. Ta
thy ngay cng ch c N h s a k m thi. cho tin vi quy c tnh bin
i Fourier ri rc ta vit li (3.5) vi x p (k) thay cho a k nh sau:
1
X p (k )e j(2k / N ) n
(3.6)
x p (n) = N k =< N >
C th l:
1
x p (0) = N
1
x p (1) = N
1
x p (1) = N
X p (k )
k =<N >
X p (k )e j(2k / N )
k =< N >
X p (k )e j(2k ( N1)/N
k =< N >
H s 1/N c a vo cho thun tin v khng lm nh hng ti bn cht ca

cch biu din chui. Vn cn li l phi xc nh cc h s X p (k). Trc
ht ta chng minh tnh cht trc chun sau:
1 n = l N vi l = 0, 1,2
1
N
e j(2k ( N1)/N
k =< N >
(3.7)
lN
0 vi mi n khc
Chng minh:
Vi mi n, tng trn l mt cp s nhn c cng bi l: Q = e

( tin vic tnh ton v vit, ta k hiu k = <N>N-1)
Do :
j( 2 n / N )
N
1 N 1
1 1 Q
j( 2 k / N ) n
k =0
e
= N k =0 Qk = N . 1 Q
Vi n khc lN, tc l vi mu s 1- Q khc 0 nn:
N 1
1
N
0
1
N .1 Q = 0
lN
Vi n = l N, mu s 1-Q = 0 v Q = 1 nn ta phi tnh trc tip tng. Khi
j( 2 k / N ) n
ny cc e
u c gi tr bng 1. Do c tng c gi tr l N, em
chia cho N, kt qu l 1. Tnh cht trc chun c chng minh.
Hnh 3.1 minh ho cng thc (3.7) cho trng hp N = 6, trong cc s
j( 2 k / N ) n
c biu din bng cc vectr trong mt phng phc. Cc vect

e
ny u c di bng 1. Do tnh i xng ca cc hnh ny, ta cng c th
rt ra l tng ca cc e
j( 2 k / N ) n
s bng 0 tr khi k=0,6,12
Quay li tnh x p (k), ta thc hin:

Nhn hai v ca (3.6) vi e
j( 2 k / N ) n
N 1
1 N 1
j( 2 k / N ) n
N
=0
k =0 x p (n). e
k
=
i th t ly tng ca v phi:
N 1
k =0
N 1
x p (n).
j( 2 k / N ) n
k =0
v ly tng t n=0 ti N-1
X p (k ).e j(2k / N )(k -r)n
k =< N >
1
x p (k) [ N
N 1
n =0
j( 2 / N )( k r ) n
e
=
e
]
S dng (3.7) va chng minh cho phn trong ngoc vung v phi, ta c:
N 1
n =0
Hay:
x p (n). e
j( 2 / N ) nr
= x p (r)
N 1
x p (k) = n =0 x p (n). e
Nhn xt:
j( 2 / N ) kn
(3.8)
x p (k) theo (3.8) cng l hm tun hon vi chu k N

x p (k) = x p (k + lN)
iu ny l ng nhin v cc hm s m trong (3.8) ch phn bit vi k =
0N-1 v do ch c N h s Fourier .
cc h s chui Fourier x p (k) cng c th c xen nh l mt dy s c
di hu hn, cho bi (3.8) vi k = 0, 1,,N-1 v bng 0 vi mik khc. R
rng l c hai cch gii thch ny u ng c v tng ng nhau. Song ni
chung ngi ta thng gii thch cc h s ca chui Fourier x p (k) nh l mt
chui tun hon c c s i ngu gia thi gian v tn s ca chui
Fourier .
Cng thc (3.6) v (3.8) l cp cng thc chui Fourier cho mt tn hiu
tun hon. (3.8) c coi l cng thc phn tch. (3.6) c coi l cng thc
tng hp. tin s dng ngi ta cn dng k hu:
j( 2 / N )
WN = e
v do vy:
n
j( 2 / N ) n
j( 2 n / N )
= e
WN = e
tin n lot v cho gn, trong ti liu ny c th ch vit Wn khi ch s di
ca W l N. Nu ch s ny khc N, ta phi nghi r thm.
Cp cng thc phn tch v tng hp chui Fourier tr thnh:
x p (k) =
n =<N > x(n).
1
x p (n) = N
Wnk
Phn tch
(3.9)
Tng hp
(3.10)
k =<N > X(k).W-kn
Mt cch gii thch khc ca dy tun hon x p (k) : x p (k) chnh l cc mu
trn ng trn n v ca bin i z mt chu k ca x p (n) , tc l cc mu

ca bin i Fourier X(f) ca mt chu k x p (n) (v bin i z tnh trn ng
trn n v chnh l bin i Fourier X(f)).
Mt chu k x(n) ca x p (n) c th c nh ngha l:
x(n) = x p (n) vi 0 n N-1
0
vi mi n khc
Do vy X(z) ca x(n) l:
N 1
X(z) =
v:
n =
x(n)z-n =
x p (k) = X(z) z= e
n =0
x(n)z-n
j.k ( 2 / N )
= WN
Tc l N h s ca x p (k) chnh p gi tr ca bin i z tnh trn ng trn

n v ti N im chia u nhau.
V d 3.1: xt tn hiu x(n) = sin(n) = sin (2n/N)
Tn hiu ny ch tun hon khi N =2/N l mt s nguyn hoc t s ca hai
s nguyn.
Ta c ngay:
e j( 2 n / N ) e ( j2 n / N )
2j
x(n) =
hay:
x p (1) = x p (N+1) = = N/2j
x p (-1) = x p (N-1) = =-N/2j
khi t s 2 c dng m/N ta c = 2m/N
e jm ( 2 n / N ) e jm ( 2 n / N )
2j
x(n) =
hay
x p (m) = x p (N+m) = = N/2j
x p (-m) = x p (N-m) = =-N/2j

vi m = 3, N = 5 ta thy:
x p (-2) = x p (3)
x p (-3) = x p (2)
Vic ta chn tn hiu i xng quanh gc to ch l d tnh v v. V
vy:
x p (k) =
x p .e -j(2( N )kn
n =< N >
N1
e j( 2 / N ) kn
3.2.2.
n = N1
Bi ging X l tn hiu s
IV. nh l ly mu
c th p dng cc k thut x l tn hiu s trong vic x l cc tn
hiu tng t th iu c bn u tin l cn chuyn i cc tn hiu tng t
thnh dy cc s. Qu trnh ny c thc hin bng cch ly mu tn hiu tng
t theo chu k. Nu gi tn hiu tng t l xa(t), x(n) l tn hiu ri rc theo thi
gian thu c sau qu trnh ly mu, T l chu k ly mu th:
x(n) = xa(nT)
vi - < n <
(3.4.1)
Quan h (3.4.1) m t qu trnh ly mu trong min thi gian. qu trnh
ly mu khng lm mt mt thng tin ca ph tn hiu (khng gy ra hin tng
trng ph ) th tn s ly mu Fs = 1/T phi c gi tr ln. Khi iu ny c
m bo th tn hiu tng t c th c khi phc chnh xc t tn hiu ri rc
theo thi gian.
Nu xa(n) l tn hiu khng tun hon vi nng lng hu hn, th ph ca
n c th c xc nh bi quan h ca bin i Fourier :
X a (F) = x a ( t )e j2 Ft dt
(3.4.2)
Ngc li, tn hiu xa(t) c th c khi phc t ph ca n qua bin i

Fourier ngc:
x a ( t ) = X a (F)e j2 Ft dt
(3.4.3)
y, vic s dng tt c cc thnh phn tn s trong khong :- < F <

l cn thit c th khi phc c tn hiu xa(t) nu tn hiu ny c di tn v
hn.
Ph ca tn hiu ri rc theo thi gian x(n) nhn c bng cch ly mu
ca xa(t), c biu din qua php bin i Fourier nh sau:
X() =
x ( n ) e j n
(3.4.4)
n =
hoc :
X (f ) =
x (n )e j2fn
(3.4.5)
n =
Ngc li, dy x(n) c th c khi phc li t X() hoc t X(f) qua bin
i ngc:
NNK
Photocopyable
66
1
2
1
jn
x (n ) =
X
(
)
e
d
=
X(f )e j2 fn df
2
1
(3.4.6)
T quan h gia chu k ly mu T, cc bin c lp t v n:
t = nT =
n
Fs
(3.4.7)
Thay vo (3.4.2), ta suy ra quan h tng ng trong min tn s ca cc

bin tn s F v f gia Xa(t) v X(f) v ngc li:
x (n ) x a (nT ) = X a (F)e
j2 n F
Fs
dF
(3.4.8)
T (3.4.6) v (3.4.8) ta c h thc quan h:

1
j2 fn
X(f )e df = X a (F)e
j2 n F
Fs
dF
(3.4.9)
Khi qu trnh ly mu c thc hin tun hon th:
F
Fs
f=
(3.4.10)
Khi , h thc (3.4.9) tr thnh:
1
Fs
Fs
F
s
X(
j2 n F
F j2 n F Fs
Fs
)e
dF = X a (F)e
dF
Fs
(3.4.11)
Bin i biu thc thuc v phi ca (3.4.11), ta c:
X a (F)e
j2 n F
Fs
dF =
( k + 1 ) Fs
2
k = ( k
X a (F)e
j2 n F
Fs
dF
(3.4.12)
) Fs
Thc hin vic i bin trong (3.4.12) v s dng tnh cht tun hon ca
hm m:
j2 n
( F kFs )
j2 n F
Fs
Fs
e
=e
s cho ta: Xa(F) trong khong tn s (k-1/2)Fs n (k+1/2)Fs s hon ton tng
ng vi Xa(F - kFs) trong khong -Fs/2 n Fs/2. T , ta c:
NNK
Photocopyable
67
( k + 1 ) Fs
2
k = ( k
X a (F)e
j2 n F
Fs
dF =
) Fs
Fs

k = F
s
Fs
Fs
X a (F kFs )e
j2 n F
Fs
dF
(3.4.13)
j2 n F Fs

X
(
F
kF
)
dF
s e
a
k =
So snh (3.4.6) v (3.4.13) ta c:
F
X = Fs X a (F kFs )
k =
Fs
X(f ) = Fs
hoc:
(3.4.14)
X a [(f k )Fs ]
(3.4.15)
k =
Cc h thc (3.4.14) v (3.4.15) a ra mi quan h gia ph X(F/Fs) hoc

X(f) ca tn hiu ri rc theo thi gian v ph Xa(F) ca tn hiu tng t. Thc
cht, v phi ca hai biu thc ny l s lp li c chu k ca ph c ly t
l Xa(F) vi chu k Fs.
Xt quan h (3.4.14) v (3.4.15) vi cc tn s ly mu c gi tr khc
nhau. thc hin iu ny, ta xt vi v d l mt tn hiu tng t vi b rng
ph hu hn. Tn hiu ny c m t trn hnh (3.4a). Ph ca tn hiu s bng
khng khi F B.
Nu chn tn s ly mu Fs 2B th ph X(F/Fs) ca tn hiu ri rc s c

dng nh trn hnh (3.4b). Nh vy, nu tn s ly mu Fs c chn sao cho Fs
2B, vi 2B l tn s Nyquist th:
F
vi: .
(3.4.16)
X = Fs X a (F)
Fs
trong trng hp ny hin tng trng ph s khng xy ra v v vy, trong min
gii hn ca tn s c bn F Fs/2 hoc f 1/2, ph ca tn hiu ri rc s
ng nht vi ph ca tn hiu tng t.
F
Nu chn tn s ly mu Fs< 2B th trong cng thc xc nh X , do
Fs
c s lp li c chu k ca Xa(F) nn s pht sinh hin tng trng ph, nh m t
F
trn hnh (3.4c). Khi ph X ca tn hiu ri rc theo thi gian s c cha
Fs
NNK
Photocopyable
68
cc thnh phn vi cc tn s nhm ln ca ph tn hiu tng t Xa(F), v vy

vic khi phc chnh xc tn hiu gc t cc mu s khng th thc hin c.
xa(t)
Xa(F)
F
B
-B
(a)
x(n)
X(F/Fs)
FS Xa(F+Fs)
FS Xa(F-Fs)
FS Xa(F)
-F s
(b)
F
-Fs/2
Fs/2
x(n)
X(F/Fs)
(c)
Fs
F
-Fs
Fs
Hnh 3.4. M t s ly mu tn hiu c b rng ph hu hn v s trm ph.

Trong trng hp khng c hin tng trng ph, tn hiu gc xa(n) c th
c khi phc li mt cch chnh xc t cc mu x(n):
1 F
X
X a (F) = Fs Fs
0
Theo php bin i Fourier th:
Fs
F>
Fs
(3.4.17)
j2 F n
F
Fs
X = x (n )e
Fs n =
v bin i ngc Fourier s cho ta xa(t) t ph ca n Xa(F):
NNK
Photocopyable
69
Fs
x a (t) =
X a (F)e
F
s
j2 Ft
dF
Gi s Fs= 2B, thay vo cc h thc trn, ta c:
1
x a (t) =
Fs
=
Fs
Fs
j2 F n

1
Fs
j2 Ft
=
x
(
n
)
e
e
dF
x
Fs
n =
x a (nT)
n =
sin( / T )( t nT)
( / T )( t nT)
Cng thc (3.4.18) c cha hm:

sin( / T) t sin 2Bt
g( t ) =
=
( / T) t
2Bt
Fs
x (n )
n =
F
j2 F ( t n
Fs
dF
(3.4.18)
(3.4.19)
c dch bi cc lng nT, n = 0, 1, 2, 3, v c nhn vi cc mu tng

ng xa(nT) ca tn hiu ri rc. Cng thc (3.4.19) c gi l cng thc ni suy
v c dng khi phc tn hiu lin tc xa(t) t cc mu, cn hm g(t) trong
(3.4.19) c gi l hm ni suy. V ti t = kT th hm ni suy g(t-kT) s c gi
tr bng khng, ngoi tr k = n; Do gi tr ca xa(t) ti cc thi im t = kT s
chnh l mu xa(kT). tt c cc thi im cn li, gi tr ca xa(t) s bng gi tr
ca hm ni suy sau khi ly t l vi xa(nT).
Cng thc (3.4.19) dng khi phc tn hiu lin tc xa(t) t cc mu,
c gi l cng thc ni suy l tng v l c s ca nh l ly mu.
Pht biu nh l ly mu
Tn hiu lin tc theo thi gian c b rng ph hu hn vi tn s cao nht

B(Hz) c th c khi phc mt cch duy nht t cc mu, nu qu trnh ly
mu c thc hin vi tc Fs 2B trn 1 giy.
NNK
Photocopyable
70
chng 4
php bin i Fourier ri rc

Php bin i Fourier ca tn hiu ri rc, X(f), v mt l thuyt cho ta
nhng cng thc gii tch gn v p. N c s dng rng ri khi nghin cu
cc tn hiu vit c di dng gii tch. Tuy nhin n c mt s hn ch khi p
dng trong thc t khi chy chng trng my tnh. C th l:
1. di tn hiu s( s mu tn hiu em phn tch) l v cng. Trong khi
di tn hiu trong thc t bao gi cng l hu hn.
2. Bin c lp f ( tn s) ca X(f) l mt bin lin tc, trong khi vic x
l tn hiu trn my tnh bao gi cng phi c ri rc ho, s ho.
Do tm quan trng to ln ca php bin i Fourier nn ngi ta tm
cch khc phc cc hn ch trn bng cch a n v dng thch hp. l php
bin i Fourier ri rc ca tn hiu c di hu hn v c trc tn s cng
c ri rc ho, thng c gi mt cch ngn gn l php bin i Fourier
ri rc, c vit tt trong ting Anh l DFT, l mt thut ng c dng ph
bin. Cn phn bit vi tn gi php bin i Fourier ca tn hiu ri rc m ta
nghin cu chng 3. Ngoi ngha v mt l thuyt, DFT cn ng vai tr
rt quan trng trong thc t x l tn hiu s do tn ti cch tnh DFT rt hiu
qu, tc nhanh FFT.
I. ly mu trong min tn s - bin i Fourier ri rc
Trc khi nghin cu DFT, ta hy xt vic ly mu ca bin i Fourier i
vi dy tn hiu ri rc theo thi gian khng tun hon v t c th thit lp
c quan h gia bin i Fourier c ly mu vi DFT.
I.1. ly mu trong min tn s v khi phc tn hiu ri rc
theo thi gian
Xt bin i Fourier X(ej ) hay X() ca mt tn hiu khng tun hon ri

rc theo thi gian x(n):
X () =
x ( n ) e j n
n =
NNK
Photocopyable
71
Gi s tn hiu X() c ly mu tun hon v khong cch ly mu l

. V X() l tun hon vi chu k 2, do vy ch cn xt n cc mu c ly
trong min tn s c bn: 0 2 v s lng mu c ly trong khong ny

l N, th khong cch ly mu l = 2/N, (hnh 4.1).
X()
X (k )
Hnh 4.1. Ly mu tn s ca bin i Fourier

Xt gi tr ca X() ti = 2k/N ta c:
j
2
X ( k ) = x ( n )e
N
n =
2 kn
N
, vi k nguyn, k =[0..N-1]
(4.1.1)
Nu chia tng (4.1.1) thnh mt s lng v hn cc tng, trong mi tng

cha N phn t th ta c:
1
j
2
X( k ) = ... + x (n )e
N
n = N
2 kn
N
N 1
+ x ( n )e
2 kn
N
n =0
2 kn
2 N 1
j
x ( n )e N
+ ... =
n=N
lN + N 1
l=
n =lN
x ( n )e
2 kn
N
Thc hin vic i bin n = n - lN v i th t ly tng ta c:

N 1

j
2
X( k ) = x (n lN)e
N
n =0 l=
2 kn
N
(4.1.2)
Ch trong biu thc trn, s dng tnh cht:
2 k ( n lN )
N
Ta thy tn hiu:
=e
x p (n ) =
2 kn
N .e j2 kl
=e
2 kn
N
x (n lN)
(4.1.3)
l=
nhn c do s xp chng ca v s tn hiu x(n) t lch nhau mt chu k N.

Nh vy, xp(n) l tn hiu tun hon vi chu k c bn l N. Do vy n c
th khai trin qua chui Fourier nh sau:
NNK
Photocopyable
72
N 1
x p (n ) = c k e
2 kn
N
,vi n nguyn: [0..N-1]
(4.1.4)
k =0
j
1 N1
vi cc h s: c k = x p (n )e
N n =0
2 kn
N
,vi k nguyn: [0..N-1]
(4.1.5)
T (4.1.2), (4.1.3) v (4.1.5) ta c:
ck =
1
2
X( k )
N
N
(4.1.6)
j
1 N 1 2
x p ( n ) = X ( k )e
N k =0 N
2 kn
N
(4.1.7)
Quan h (4.1.6) chnh l cng thc cho php khi phc li tn hiu tun
hon xp(n) t cc mu ca ph X(). Tuy nhin quan h ny khng th m bo
c rng x(n) hoc X() c th khi phc t cc mu hay khng. m bo
iu ny, cn phi kho st quan h gia x(n) v xp(n).
V xp(n) l tn hiu nhn c do s xp chng ca cc tn hiu x(n) t
lch nhau mt chu k N. V vy x(n) c th c khi phc t xp(n) nu khng c
s trm thi gian gia cc thnh phn ca xp(n). iu ny i hi x(n) phi c
di hu hn L v phi nh hn chu k N ca xp(n). Hnh 4.2 m t hai trng
hp ca tn hiu xp(n) ng vi cc trng hp N > L v N < L.
x(n)
xp(n)
L
N>L
xp(n)
N< L
-N
N L
Hnh 4.2. Dy khng tun hon x(n) v dy m rng xp(n).
NNK
Photocopyable
73
Khng lm mt tnh tng qut, ta c th xem x(n) l mt dy c di hu

hn vi cc gi tr bng khng ngoi khong [0 .. L-1].
Nh vy ta c:
x(n) = xp(n),
0 n N-1
Cui cng, ph ca tn hiu khng tun hon ri rc theo thi gian c
di hu hn L c th khi phc mt cch chnh xc t cc mu ca n ti cc tn
s k = 2k/N nu N L:
x p ( n )
x (n ) =
0
0 n N 1
j
1 N 1 2
x ( n ) = X ( k )e
N k =0 N
2 kn
N
(4.1.8)
, vi: 0 n N-1
(4.1.9)
v:
N 1
j
1 N 1 2
X() = X( k )e
n =0
N k =0 N
2 kn
N
jn N 1 2 1 N1 j( 2 k ) n
N
= X( k ) e
e
N
N
k =0
k =0
(4.1.10)
Tng ca cc phn t trong du ngoc vung ca (4.1.10) biu din cng
thc ni suy c dch bi 2k/N theo tn s. t:
p() =
j N
N 1
1
1 1 e
1e
e j n =
=
N k =0
N 1 e j N
N 1
X() = X(
k =0
N
2
e
e
N
2
N
2
N
( N 1)
j
2
2
=
e
N sin
2
(4.1.11)
sin
2
2k
k )p(
) , N L
N
N
Nh vy X() c th c xc nh thng qua cc mu X(
(4.1.12)
2
k ) ca n
N
qua cng thc ni suy (4.1.11) v (4.1.12).

II. Bin i Fourier ri rc i vi cc tn hiu tun hon
II.1. cc nh ngha
a. nh ngha bin i Fourier ri rc.

Bin i Fourier ri rc ca cc dy tun hon xp(n) c chu k N c nh
ngha nh sau:
NNK
Photocopyable
74
N 1
X p ( k ) = x p ( n )e
2
kn
N
(4.1.13)
n =0
t: WN = e
2
N
WNkn
th ta c:
=e
2
kn
N
v
WNkn
=e
2
kn
N
(4.1.14)
N 1
X p (k ) = x p (n ) WNkn
(4.1.15)
n =0
y chnh l biu thc ca bin i Fourier ri rc.

V d:
Cho dy tun hon xp(n) vi chu k N = 10, nh sau:
1
x p (n ) =
0
Tm Xp(k).
0n4
5n 9
Gii:
Dng ca xp(n) c biu din nh sau:
xp(n)
1
-6 -5
4 5
10
Hnh 4.3. th tn hiu tun hon chu k N=10.

9
n =0
n =0
X p (k ) = x p (n ) W10kn = e
j k4
10
= 5e
2
kn
10
1 e
1 e
2
k5
10
2
k
10
sin k j k 4
2 e 10
=
sin k
10
sin k
k
2
2
sin k
k
10 10
t:
NNK
Photocopyable
75
sin k
k
2
2
A p (k ) = 5
sin k
k
10
10
ta c:
X p (k ) =
y:
j k4
10
e
A
(k ) = arg X p (k )
p (k )
= X p (k ) e
j arg X p ( k )
= X p (k ) e j( k )
X p (k ) = A p (k )
k + {1 Sgn A p (k ) }
5
2
b. nh ngha bin i Fourier ngc.
Bin i Fourier ngc c nh ngha nh sau:
(k ) =
j k
1 N1
x p ( n ) = X p ( k )e N
N k =0
(4.1.16)
hoc:
x p (n ) =
1 N1
X p (k ) WNkn
N k =0
(4.1.17)
II.2. cc tnh cht ca Bin i Fourier ri rc i vi cc tn

hiu tun hon c chu k n
a. Tnh cht tuyn tnh.

DFT l mt bin i tuyn tnh, tc l nu c hai dy x1p(n) v x2p(n) l cc
dy tun hon c cng chu k N v x3p(n) l t hp tuyn tnh ca hai dy trn:
x3p(n) = a.x1p(n) + b.x2p(n)
th ta c:
DFT[x3p(n)] = X3p(k) = a.X1p(k) + b.X2p(k)
(4.1.18)
trong :
DFT[x1p(n)] = X1p(k) v DFT[x2p(n)] = X2p(k)
b. Tnh cht tr.
Nu xp(n) l dy tun hon c cng chu k N vi DFT[xp(n)] = Xp(k), v
dy xp(n + n0) l dy tr ca xp(n) cng l dy tun hon chu k N th:
DFT[xp(n+n0)] = WN kn 0 X p (k )
NNK
Photocopyable
(4.1.19)
76
c. Tnh i xng
Nu xp(n) l dy tun hon c cng chu k N vi DFT[xp(n)] = Xp(k) th:
DFT[x*p(n)] = X*p(-k)
(4.1.20)
Chng minh:
DFT
x *p (n )
]=
N 1
n =0
x *p (n ) WNkn
N 1
*
kn
= x p (n ) WN

n =0
*
N 1
= x p (n ) WNkn = X p ( k )
n =0
Tng t ta cng c:
DFT[x*p(-n)] = X*p(k)
Chng minh:
(4.1.21)
N 1
DFT x *p ( n ) = x *p ( n ) WNkn
n =0
i bin m = - n ta c:
DFT x *p (n ) =
( N 1)
m =0
x *p (m) WNkm
do tnh tun hon chu k N ca xp(n) v WNkm nn ta c:
DFT
x *p ( n )
N 1
= x p (m) WNkm = X *p (k )
m =0
V:
{ [
]} 12 [X
{ [
]}
DFT Re x p (n ) =
DFT Im x p (n ) =
p (k )
+ X *p ( k )
1
X p (k ) X *p ( k )
2j
(4.1.22)
(4.1.23)
Chng minh:
xp(n) = Re[xp(n)] + j .Im[xp(n)]
x*p(n) = Re[xp(n)] - j .Im[xp(n)]
1
Re x p (n ) = x p (n ) + x *p (n )
2
NNK
Photocopyable
] [
{ [
]}
1 N1
1
DFT Re x p (n ) = x p (n ) + x *p (n ) WNkn = X p (k ) + X *p ( k )
2 n =0
2
]
77
v:
1
x p (n ) x *p (n )
2j
Im x p (n ) =
DFT Im x p (n ) =
{ [
]}
1
1 N 1
x p (n ) x *p (n ) WNkn =
X p (k ) X *p ( k )
2 j n =0
2j
d. Tch chp tun hon

Cng thc tch chp c trnh by trong chng 1:
x 3 (n ) = x1 (n ) * x 2 (n ) =
x 1 ( m) x 2 (n m)
m =
c gi l tch chp tuyn tnh. i vi tch chp ny cc dy l bt k. Tuy

nhin tch chp tun hon, chiu di cc dy tun hon l v cng nhng c cc
chu k lp li ging nhau, v th tng ch ly trong mt chu k. V ta c nh
ngha tch chp tun hon nh sau:
Tch chp tun hon ca hai dy tun hon x1p(n) v x2p(n) l c cng chu
k N l dy x3p(n) cng tun hon vi chu k N:
x 3p (n ) = x1p (n )(*)N x 2 p (n ) =
N 1
x1p (m)x 2p (n m)
(4.1.24)
m =0
Xt tch chp tun hon trong min k:

X3p(k) = X1p(k). X2p(k)
Chng minh:
(4.1.25)
N 1 N 1
N 1
N 1
X 3p (k ) = x1p (m) x 2 p (n m)WNkn = x1p (m) x 2 p (n m) WNkn

n =0 m =0
m =0
n =0
i bin: l = n - m, n = l + m v v x2p(n) l dy tun hon c chu k N, nn ta c:
X 3p ( k ) =
N 1
m + N 1
N 1
N 1
m =0
l= m
m =0
l =0
x1p (m)
x 2p (l)WNk (l+m) =
x1p (m)WNkm x 2p (l) WNkl
= X1p (k )X 2 p (k )
e.Tch ca hai dy
Nu ta coi tch ca hai dy tun hon x1p(n) v x2p(n) c cng chu k N l
dy x3p(n) cng tun hon vi chu k N:
x3p(n) = x1p(n).x2p(n)
th ta c:
X 3p (k ) = X1p (n )(*)N X 2 p (n ) =
NNK
Photocopyable
1 N1
X1p (m)X 2p (k m)
N m =0
(4.1.26)
78
Nh vy, tch i s trong min n th tng ng vi tch chp trong min k.

f. Tng quan tun hon.
Nu ta c hai dy tun hon x1p(n) v x2p(n) vi cng chu k N th hm
tng quan cho ca chng s c tnh ton trn mt chu k theo biu thc sau:
r x1px 2 p (n ) =
N 1
x1p (m)x 2p (m n )
(4.1.27)
m =0
Nh vy, hm tng quan cho ca hai dy cng l mt dy tun hon vi

chu k N.
Xt trong min k:
(4.1.28)
R x1px 2 p (k ) = X p (k ).X p (k )
III. Bin i Fourier ri rc i vi cc dy khng tun
hon c chiu di hu hn
III.1. Cc nh ngha
Nh cp n trong phn ly mu trong min tn s, mt dy x(n)

khng tun hon v c chiu di hu hn N, ta k hiu l x(n)N s nhn c bng
cch trch ra mt chu k N ca dy tun hon xp(n) c chu k N:
x p (n )
x (n ) N =
0
0 n N 1
n < 0, n > N 1
nhn c dy x(n)N ta c th s dng mt dy ch nht:
0 n N 1
1
rect N (n ) =
n < 0, n > N 1
0
v thc hin tch:
x(n)N = xp(n).rectN(n)
Trong min k, i vi dy X(k) c th c xc nh nh sau:
X p ( k )
X (k ) =
0
v:
0 n N 1
n < 0, n > N 1
Hn na, bin i Fourier ri rc i vi dy tun hon c chu k N ch
tnh trong mt chu k ri kt qu c tun hon ho t - n + vi chu k

N lm nh ngha cho bin i Fourier ri rc i vi dy c chiu di hu hn
N nhng khng c thc hin tun hon ho m ch ly t 0 n N-1.
NNK
Photocopyable
79
Nh vy, bin i Fourier ri rc (DFT) i vi cc dy khng tun hon

c chiu di hu hn N c nh ngha nh sau:
a. Bin i Fourier thun:
N 1
kn
x (n ) WN
X ( k ) = n =0
0
0 k N 1
(4.3.1)
n < 0, n > N 1
b. Bin i Fourier ngc:
1 N 1
kn
X(k ) WN
x ( n ) = N k =0
0
0 k N 1
(4.3.2)
k < 0, k > N 1
y ta gi X(k) l ph ri rc ca tn hiu x(n), nu biu din di dng

modun v argument ta c:
X ( k ) = X ( k ) e j ( k )
(k) = arg[X(k)]
(4.3.3)
trong : X(k) gi l ph ri rc bin v (k) gi l ph ri rc pha.

V d 1:
Tm DFT ca dy c chiu di hu hn x(n) sau:
x(n) = (n)
Gii:
Trc ht ta chn chiu di ca dy, gi s l N. Vy dy x(n) c dng:
X(k)
x(n)
-1 0 1
N-1
-1
N-1 k
(a)
(b)
Hnh 4.4. a- Biu din ca dy x(n), b- Biu din ca ph ri rc bin
Khi X(k) c tnh nh sau:
N 1
0 k N 1
1
X(k ) = (n ) WNkn =
k < 0, k > N 1
n =0
0
Vy ph bin ri rc v ph pha ri rc l:
NNK
Photocopyable
80
0 k N 1
1
X(k ) =
0
k < 0, k > N 1
(k) = 0.
Dng ca X(k) c biu din trn hnh 4.4b.
V d 2:
Tm DFT ca dy c chiu di hu hn x(n) sau, vi a < 1:
a n
x (n ) =
0
0 n N 1
Gii:
Theo nh ngha DFT ta c:
N 1 n kn
a WN
X ( k ) = n =0
0
N 1
X(k ) =
n =0
j
n
aWNk
2
kn
N
0 k N 1
1 aWNk
=
1 aWNk
j
2
kN
N
= e j2 k = 1
V:
WNkn
j k
1 a 1 ae N
N
N
1 a
1 a
=
=
X(k ) =
2
k
2
2
j k
1 aWN
j k
j k
1 ae N 1 ae N
1 ae N
2
2
1 a N 1 a. cos k ja.sin k
N
N
=
= X ( k ) e j ( )
2
1 + a 2a. cos k
N
=e
WNkN
=e
Vy:
2
1 2a. cos k + a
N
2
2
X(k ) = {Re[X(k )]} + {Im[X(k )]} = 1 a N
2
1 2a. cos k + a
N
2
2
a.sin k
a.sin k
Re[X(k )]
N
N
() = arctg
= arctg
= arctg
2
2
Im[X(k )]
1 a. cos k
1 a. cos k
N
N
NNK
Photocopyable
81
III.2. Cc tnh cht ca bin i Fourier ri rc i vi cc dy

chiu di hu hn
Trong phn I, cho thy DFT chnh l tp hp N mu {X( 2k/N)} ca bin

i Fourier X() ca dy {x(n)} vi di hu hn L N. Vic ly mu ca
X() c thc hin ti N tn s cch u nhau v thng qua N mu. V ta c
c DFT, IDFT ca dy x(n). Trong phn ny ta s xt mt s tnh cht quan
trng ca DFT. Ngoi tr mt s tnh cht ring, v c bn cc tnh cht ny cng
ging cc tnh cht ca bin i Fourier. Cc tnh cht ca DFT c mt vai tr rt
quan trng khi gii quyt cc bi ton trong thc t.
a. Tnh cht tuyn tnh
DFT l mt bin i tuyn tnh, tc l nu ta c hai dy chiu di hu hn
x1(n) v x2(n) v dy x3(n) l t hp tuyn tnh ca hai dy ny, th:
X3(k) = a.X1(k) + b.X2(k)
(4.3.4)
Ch : nu chiu di ca dy x1(n) v x2(n) khc nhau th ta phi chn chiu di
ca dy x3(n) nh sau:
L[x3(n)] = N3 = max[N1, N2]
v tt c cc DFT[x1(n)], DFT[x2(n)] v DFT[x3(n)] u phi tnh trn N3 mu.
b. Tr vng
Trc ht ta xt hai v d sau nhm so snh tr tuyn tnh v tr tun hon:
V d 1. Cho dy x(n) sau:
n
0n4
1
x (n ) = 4
0
Tm tr tuyn tnh x(n-2) v x(n+2)
x(n+2)
x(n-2)
x(n)
0,5
0
2 3 4
NNK
Photocopyable
0 1
2 3 4 5 6
n -3 -2 -1 0
2 n
82
V d 2. Cho dy xp(n) tun hon vi chu k N = 4 sau:
n
0n4
1
x p (n ) = 4
0
Tm tr tun hon xp(n-2) v xp(n+2) sau ly ra mt chu k ca cc dy ny.
xp(n)
1
2 3 4
xp(n-2)
1
2 3 4
x(n-2)N
1
2 3 4
xp(n+2)
1
2 3 4
x(n+2)N
1
0
NNK
Photocopyable
2 3 4
n
83
y ta dng cc k hiu:
x(n n0): Tr tuyn tnh
xp(n n0): Tr tun hon chu k N
x(n n0)N: Tr vng vi chiu di N
Qua hai v d trn ta thy:
Nu trch ra mt chu k (t 0 n N-1) ca tr tun hon chu k N th ta s
c tr vng x(n n0)N, so snh vi tr tuyn tnh x(n n0) th ta thy rng nu
cc mu ca tr tuyn tnh vt ra ngoi khong [0, N-1] th n s vng vo bn
trong khong sao cho dy c chiu di hu hn x(n)N xc nh trong khong
[0, N-1] th tr vng ca n x(n n0)N xc nh trong khong [0, N-1] ch khng
c vt ra ngoi khong .
Vy tr vng tng ng vi vic hon v vng cc mu ca dy x(n)N trong
khong [0, N-1] v c biu din nh sau:
x(n) = x(n)N = xp(n).rectN(n)
x(n n0)N = xp(n n0)rectN(n)
Bn cht ca tr vng c th c minh ho nh sau:
(4.3.5)
x(n) x(n)4
1
-1 0
2 3
x(n-2)
1
-1 0
n
x(n-2)4=x(n)
-1 0
NNK
Photocopyable
n
84
x(1)
x(2) 2
x(1)
x(0)
x(2) 0
x(3)
x(3)
x(0)
xc nh tr vng trong min k, do tnh i ngu nn trong min k tr

vng cng c bn cht tng t nh trong min n, tc l:
X(k - n0)N = Xp(k - n0).rectN(k)
(4.3.6)
v:
DFT[x (n n 0 ) N ] = WNkn 0 X(k )

trong :
DFT[x(n)]
Chng minh:
(4.3.7)
= X(k)
Ta c: DFT x p (n n 0 ) N = WNkn 0 X p (k )
Nu c hai v ta u ly ra mt chu k [0, N-1]:
x(n - n0)N = xp(n - n0).rectN(n)
X(k) = Xp(k ).rectN(k)
Vy ta c:
DFT[x (n n 0 ) N ] = WNkn 0 X(k )
c. Tnh i xng
Tnh i xng ca DFT c th nhn c bng cch p dng phng php
c s dng i vi bin i Fourier. Trong trng hp tng qut, dy x(n)
c chiu di hu hn N v DFT ca n u c gi tr phc. Khi , cc dy ny c
th c biu din di dng:
x(n) = Re[x(n)] +j .Im[x(n)]
v
X(k) = Re[X(k)] +j .Im[X(k)]
X*(k) = X(-k) = Re[X(k)] -j .Im[X(k)]
NNK
Photocopyable
85
T cc bin i Fourier thun v nghch (DFT, IDFT) ta c:

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

+ Im[x (n )]sin
N
N
n =0
(4.3.8)
N 1
2kn
2kn
Im[X(k )] = Re[x (n )]sin

Im[x (n )]cos
N
N
n =0
(4.3.9)
2kn
2kn
1 N 1
Im[X(k )]sin
Re[x (n )] = Re[X(k )]cos
N
N
N k =0
(4.3.10)
2kn
2kn
1 N 1
Re[X(k )]sin
+ Im[X(k )]cos
N
N
N k =0
(4.3.11)
Im[x (n )] =
Dy c gi tr thc:
Nu x(n) l dy thc th ta c:
X(N- k) = X*(k) = X(-k)
(4.3.12)
X(N- k)=X(k) v arg[X(N-k)] = - arg[X(k)]

x(n) cn c xc nh theo (4.3.10), l mt dng khc ca IDFT.
Tn hiu chn v thc:

Nu x(n) l dy chn v thc, th ta c:
x(n) = x(- n) = x(N-n)
T h thc (4.3.10) ta c Im[X(k)] = 0 v do vy DFT tr thnh:
N 1
X(k ) = x (n ) cos
n =0
2kn
N
(4.3.13)
(4.3.14)
l mt dy chn. Do Im[X(k)] = 0 nn IDFT tr thnh:
2kn
1 N 1
x (n ) = X(k ) cos
N
N k =0
(4.3.15)
Tn hiu l v thc:
Nu x(n) l dy l v thc, th ta c:
x(n) = -x(- n) = -x(N-n)
T h thc (4.3.10) ta c Re[X(k)] = 0 v do vy DFT tr thnh:
N 1
X(k ) = j x (n ) sin
n =0
2kn
N
(4.3.16)
(4.3.17)
l mt dy l, phc thun tu. V do , IDFT tr thnh:
x (n ) =
NNK
Photocopyable
2kn
1 N 1
2kn
1 N 1
[
]
=
X(k ) sin
j
Im
X
(
k
)
sin
N
N k =0
N
N k =0
(4.3.18)
86
Dy phc thun tu:

N 1
Re[X(k )] = Im[x (n )]sin
2kn
N
(4.3.19)
N 1
2kn
N
(4.3.20)
n =0
Im[X(k )] = Im[x (n )]cos

n =0
Nu Im[x(n)] l l th Im[X(k)] = 0 v do vy X(k) l thc thun tu. Nu

Im[x(n)] l chn th Re[X(k)] = 0 v do vy X(k) l phc thun tu.
d. Tch chp vng.
Gi s x1(n) v x2(n) l hai dy c di hu hn N vi cc DFT tng ng
l:
N 1
X1 ( k ) = x 1 ( n ) e
j2 n k
n =0
N 1
v X 2 (k ) = x 2 (n )e
j2 n k
n =0
Gi X3(k) l tch ca hai DFT trn: X3(k) = X1(k). X2(k); L DFT ca x3(n).
Ta s tm quan h gia x3(n) vi x1(n) v x2(n).
Bin i Fourier ngc ca X3(k) l:
1 N 1
1 N 1
j2 mk / N
x 3 ( m ) = X 3 ( k )e
= [X1 (k ).X 2 (k )]e j2 mk / N
N k =0
N k =0
N 1
j2 lk j2 mk / N
1 N 1 N 1
j2 nk / N
N e
x
(
l
)
e
(4.3.21)
= x 1 ( n )e
N k =0 n =0
l=0
N 1
N1 j2 ( mn l ) k / N
1 N 1
x
(
n
)
x
(
l
)
1 2 e
N n =0
k =0
l=0
Trong , tng biu din bi biu thc trong ngoc vung ca (4.3.21) c gi tr:
N 1
l = m n + pN = ((m n ))N
k =0
Other
e j2( mn l) k / N = 0
Thay vo (4.3.21) ta c:
N 1
x 3 (m) = x1 (n )x 2 ((m n ) )N
m = 0,1,2..., N 1
(4.3.22)
n =0
Biu thc (4.3.22) c dng ca mt tch chp. Tuy vy, y khng phi l
mt tch chp biu din quan h gia p ng v kch thch ca h thng tuyn
tnh bt bin. Trong tch chp ny, c cha ch s (m-n)N c trng cho tnh dch
vng, v vy cng thc (4.3.22) c gi l tch chp vng. Nh vy tch cc DFT
NNK
Photocopyable
87
ca hai dy s tng ng vi tch chp vng ca hai dy trong min bin s c

lp t nhin n.
V d: Tch tch chp vng ca hai dy sau:
x1 (n ) = 2 1 2 1 v x 2 (n ) = 1 2 3 4
Gii:
tnh tch chp vng ca hai dy, ta s tin hnh qua hai phng php
sau:
PP1: S dng cc php bin i DFT v IDFT.

Ta c:
3
X1 (k ) = x1 (n )e j2 nk / 4 = 2 + e jk / 2 + 2.e jk + e j3k / 2 , (k = 0,1,2,3)

n =0
X1(0) = 6;
X1(1) = 0;
X1(2) = 2;
X1(3) = 0.
X 2 (k ) = x 2 (n )e j2 nk / 4 = 1 + 2.e jk / 2 + 3.e jk + 4.e j3k / 2 , (k = 0,1,2,3)

n =0
X2(0) = 10; X2(1) =-2 + j .2;
X2(2) = -2; X2(3) = -2 - j .2.
X3(0) = 60; X3(1) = 0; X3(2) = - 4; X3(3) = 0.

theo nh ngha bin i Fourier ngc ta c:
1
1 3
x 3 (n ) = X 3 (k )e j2 nk / 4 = (60 4e jn ), (n = 0,1,2,3)
4
4 k =0
x3(0) = 14; x3(1) = 16; x3(2) = 14; x3(3) = 16.
PP2: M t cc mu ca tng dy thng qua cc im trn hai vng trn khc

nhau. Cch m t ny nh th hin trn hnh 4.5a, chiu dng c quy c l
ngc chiu kim ng h.
3
+. Vi m = 0, ta c:
x 3 (0) = x1 (n ) x 2 (( n )) 4
n =0
Hnh 4.5b m t v tr cc mu ca dy bin s o x((-n))4 trn ng trn.

Cc v tr ny nhn c bng cch v cc im mu theo chiu m; v ta nhn
c:
x3(0) = 14.
3
+. Vi m = 1, ta c:
x 3 (0) = x1 (n ) x 2 ((1 n )) 4
n =0
NNK
Photocopyable
88
Dy x2((1-n))4 nhn c bng cch quay cc im ca x2((-n))N i mt

n v thi gian theo chiu dng, hnh 4.5c m t v tr cc mu ca dy bin s
x3(1) = 16.
o x2((1-n))4 trn ng trn, v nhn c:
Tng t, (cc hnh 4.5d v e) ta cng xc nh c cc gi tr cc mu
cn li:
x3(2) = 14 v x3(3) = 16.
x2(1) =2
x1(1) =1
x1(2) =2
x1(n)
x1(0) =2
(a)
x2(2) =3
x1(3) =1
x2(n)
x2(3) =4
4
x2(3) =4
x2(2) =3
x2((-n))4
x2(0) =1
(b)
x1(n)x2((-n))4 2
x2(1) =2 Dy bin o
2 Dy tch
1
x2(0) =1
x2(3) =4
x2((1-n))4
x2(1) =2
(c)
x1(n)x2((1-n))4 4
x2((2-n))4
3 Dy tch
4
x2(1) =2
x2(0) =1
x2(2) =3
(d)
x1(n)x2((2-n))4 3
x2((3-n))4
x2(3) =4
(e)

NNK
Photocopyable
8 Dy tch
6
x2(2) =3
x2(1) =2
x2(0) =1
2 x1(n)x2((3-n))4 4
2 Dy tch
89
Hnh 4.5. Tch chp vng ca hai dy.

IV. Hiu ng hn ch di tn hiu phn tch Fourier
Ta bit rng mt tn hiu c di hu hn N c th c biu din mt
cch y thng qua php bin i Fourier ri rc DFT. Tuy vy, khi cc tn
hiu c di qu ln hoc v hn th vic xc nh bin i Fourier ri rc ca
n l khng th thc hin c. Trong trng hp ny, ta cn ly mt on thch
hp nht ca tn hiu vi mt di cho php thc hin bin i DFT. Khi
r rng rng phng php DFT ch cho ra mt kt qu xp x ca tn hiu. y,
ta xem xt vn hn ch di ca tn hiu v cc hiu ng pht sinh do vic s
dng phng php DFT i vi dy c hn ch v di.
Nu tn hiu cn phn tch l tn hiu tng t th trc tin tn hiu ny
cn c chuyn qua b lc loi b cc nhiu (hoc cc thnh phn ca tn s
khng cn thit) v sau c ly mu vi tn s F s 2B, vi B l rng ca
di thng. Nh vy tn s cao nht ca hi thnh phn c cha tn hiu khi ly
mu l F s /2. c th hn ch di ca tn hiu c ly mu, gi s ch xt
tn hiu trong mt khong thi gian hu hn T 0 = NT, trong N l s lng mu
v T l khong thi gian gia hai ln ly mu (chu k ly mu). Khong thi gian
ly mu ny v nguyn tc s hn ch phn gii v tn s; ngha l n s hn
ch kh nng phn bit i vi cc thnh phn tn s m khong cch gia chng
nh hn 1/ T 0 = 1/NT trong min tn s.
Gi s rng {x(n)} l tn hiu cn phn tch. C th thy vic gii hn
di ca dy {x(n)} vi N mu trong khong n0 n n0 + N-1 , s tng ng vi
vic nhn tn hiu ny vi mt hm ca s vi di N ( n gin, t y ta coi
n0 = 0, khi cc kt qu vi n0 <> 0 s nhn c bng cch p dng tnh cht
tr v dch chuyn. V khi khong xc nh ca N mu s l: 0 n N-1).
Ngha l:
x(n)
0
Trong x N (n) = x(n)w(n) =
0 n N 1
n
Vic nhn tn hiu vi hm ca s theo thi gian tng ng vi vic ly

tch chp ph ca tn hiu x(n) vi ph ca ca s:
NNK
Photocopyable
90
1
X (e j' ) W (e j( ') )d' = X(e j ) * W (e j )
X N (e ) =
2
j
trong : XN(ej ), X(ej ) v W(ej ) l cc bin i Fourier tng ng ca xN

Vi tn hiu xN(n), chng ta c th p dng DFT v n c chiu di hu
hn. Cc h s XN(ej ) ca DFT lc ny s biu din gn ng cho cc mu ca
X(ej ). nh gi mc xp x, chng ta phi nh gi tch chp trn y,
theo tng kiu ca s quan st.
Vn th hai l s lng mu N c chn nh th no v v tr ca s
t u (tc l tm n0), cng nh mc nh hng ca hm ca s chn.
chn v tr ca s, ta phi cn bit c th thm v tn hiu cn phn tch.
Ni chung, nguyn tc chn v tr ca s (chn n0) sao cho ca s bao trm ln
phn quan trng ca tn hiu v b qua nhng on tn hiu c bin nh khng
ng k.
V d tn hiu c dng:
x(n) = a|n| vi a<1
th cc mu c bin ln tp trung gc to . Bi vy ca s cn t xung
quanh gc to .
a. Hm ca s ch nht
Hm ca s ch nht c biu din nh sau:
1
w R (n ) = Re ct N (n ) =
0
N
N 1
sin
j
j
2
2
e
WR (e ) =
sin
2
0 n N 1
n
b. Ca s tam gic
Trong min n, ca s tam gic c nh ngha nh sau:
NNK
Photocopyable
91
2n
N 1
2n
w T (n ) = 1
N 1
0
0n
N 1
2
N 1
n N 1
2
n
N 1
2
sin
2
N 1
2 j 2
WT (e j ) =
e
N 1
sin
2
c. Ca s Hanning v Hamming
Trong min n, ca s Hanning v Hamming c nh ngha nh sau:
2n
(1 ) cos
w H (n ) =
N 1
0
0 n N 1
n
- Nu = 0,5 ta c ca s Hanning nh sau:
2n
0,5 0,5 cos

w Han (n ) =
N 1
0
0 n N 1
n
- Nu = 0,54 ta c ca s Hamming nh sau:
2n
0,54 0,46 cos

w Ham (n ) =
N 1
0
0 n N 1
n
V trong min tn s, ta c:
WH
N N
N N
N
sin
sin +
2 + 1 2 N 1 + 1 2 N 1

2
2
sin
sin
sin +
2
2 N 1
2 N 1
N1 sin
j
j
(e ) = e 2
NNK
Photocopyable
92
Bi v thng qua DFT ta c th biu din mt dy vi di hu hn trong min

tn s qua cc tn s ri rc, do DFT c th c s dng nh mt cng c
tnh ton trong vic phn tch cc h thng tuyn tnh v c bit cho cc b lc
tuyn tnh. Tuy nhin khng th tnhChng ta bit rng, khi mt h thng vi
p ng tn s H()
c kch thch bi tnh hiu u vo c ph l
y()=X()H(). Dy u ra y(n) c xc nh t ph ca n thng qua bin i

ngc Fourier .tuyvy, khi tnh ton ,c th thy vn ny sinh khi s dng cc
phng php trong min tn s l c X(), H() v Y() u l cc hm lin tc
ca bin v vykhng th s dng my tnh s x l bi v my tnh ch c
th lu tr v thc hin cc vic tnh ton trn cc gi tr ri rc ca tn s .
C th thy DFT rt thch hp vi vic tnh ton trn my tnh s v c th
c s dng thc hin vic lc tuyn tnh trong min tn s .Mc d chng ta
a ra cc th tucf tnh ton trong min th gian nh tng chp ,tuy vy trong
min tn s cc phng php da trn DFT li t ra hieeuj qu hn nhiu so vi
phng php tng chp trong min thi gian d tn ti mt lot thut ton mi
hiu qu hn .Cc thut ton ny c gi l bin i nhanh Fourier(FFT) v s
c trnh by trong chng 5.
4.3.1 S dung DFT trong lc tuyn tnh
Mc d tch ca hai DFT s tng ng vi tng chp vng ca hai dy
tng ng c biu din trong min thi gian, nhng c th thy cng thc ca
tng chp vng li khng dng c trong trng hp cn xc nh u ra ca b
lc tuyn tnh khi u vo chu s tc ng ca tn hiu. Trong trng hp ny
cn phi tm mt phng php no trong min tn s tng ng vi tng
chp tuyn tnh.
NNK
Photocopyable
93
Gi s x(n) l dy c di hu hn Lv c tc ng ln b lc tuyn
tnh vi di M. Khng lm mt tnh tng qut ta c th gi s :
x(n)=0
n<0 v nL
h(n)=0
n0 v nM
y h(n) l p ng xung ca b lc FIR c th c xc nh thng qua

tng chp ca x(n) v h(n):
y (n) =
M 1
h(k ) x(n k )
k =0
Bi v x(n) v h(n) l cc dy vi d di hu hn do vy tng chp ca

chng cng c di hu hn. C th di l L + M-1.
Trong min tn s, cng thc tng ng vi 4.3.1 s l :
Y()=X()H()
Nu dy y(n) c biu din mt cch duy nht trong min tn s bng
cch ly ph Y(n) ti cc tn s ri rc phn bit nhau th s lng cc mu ny
phi bng hoc ln hn L + M-1. Nh vy c th biu din y(n) mt cch duy
nht trong min tn s th cn phI s dng DFT vi di NM+L-1.
Sau khi ly m ta c:
Y(k)Y()=2k/N,
k=0,1,,,N-1
Xk)H)=2k/N,
k=0,1,,,N-1
Y(k)=X(k)H(k),
k=0,1,,,N-1 (4.3.3)
Trong cng thc (4.3.3) th X(k) v Y(k) l cc DFT - N im ca cc dy

tng ng x(n) v y(n) c di hu hn nh hn N do vy ta ch cn thm cc
mu khng vo cc dy tng di ca chng ln N .Vic tng di ca cc
dy s khng nh hng n ph lin tc X() v H) ca chng bi v cc dy
ny l cc dy tun hon. Tuy vy, bng cch ny (s dng DFT-N im) s
lng mu dng biu din cc dy trong min tn s vt qu s lng nh
nht (L hoc M).
NNK
Photocopyable
94
Bi v DFT vi di M+L-1 im ca dy u ra y(n) trong min tn

s suy ra rng c th xc nh c {y(n)} thng qua IDFT sau khi xc nh
tnh ca cc DFT N im X(k) v H(k). Nh vy ging nh iu khng nh
trong phn 4.2.2 c th kt lun rng tng chp vng N im ca x(n) v h(n) s
tng ng vi tng chp tuyn tnh ca hai dy ny. Ni mt cch khc,bng
cch tng di ca hai dy x(n) v h(n) ln N im thng qua vic a thm cc
khng v tnh tng chp vng trn cc dy mi ta s nhn c kt qu ging vi
trng hp s dng tng chp tuyn tnh. T y suy ra vi cc mu khng c
thm vo th DFT c th c s dng thc hin vic lc tuyn tnh.
V d 4.3.1: S dng IDFT v DFT hy xc nh p ng ca b lc tuyn
tnh.
H(n) = {1,2,3}
Khi tn hiu vo l:
X(n) = {1,2,2,1 }
Gii: dy u vo c di L=4 v p ng xung c di M=3. Tng cp
tuyn tnh ca hai dy ny s cho kt qu vi di l N=6. Suy ra rng, di
ca cc DFT cn s dng t nht phI bng 6.
y, n gin ta s s dng cc DFT 8 im. DFT 8 im ca x(n)
s l:
7
X(k)=
x ( n)e
j 2kn / 8
= 1 + 2E- j
k/4
+ 2e jk/2 +2e j3k/4 , k=0,1,7
n=0
T y suy ra:
4+3 2
2+ 2
- j
2
2
X(0) =6
X(1)=
X(2) = - 1-j
X(3) =
43 2
2 2
- j
2
2
X(4) = 0
X(5) =
43 2
2 2
- j
2
2
X(6) = - 1+j
X(7) =
4+3 2
2+ 2
+j
2
2
NNK
Photocopyable
95
DFT 8 im ca h(n) l:
7
H(k)=
h ( n )e
k/4
j 2kn / 8
= 1 + 2E- j
+ 3e jk/2
n=0
Suy ra:
H(1) = + 2 -j ( 3+ 2 )
H(0) = 6
H(2) = -2-j2
H(3) =1- 2 +j ( 3 - 2 )
H(4) = 2
H(5) =1- 2 -j ( 3 - 2 )
H(7) = 1+ 2 +j ( 3+ 2 )
H(6) =-2 + j2
Tch ca 2 DFT va tnh trn s cho Y(k) v do vy:

Y(0) = 36
Y(1) = - 14.07 - 17.48
Y(3) = 0.07 +j0.515 Y(4) = 0

Y(6) = -j4
Y(2) = j4
Y(5) = 0.07 - j.0515
Y(7) = - 14.07 + j17.48
Cui cng IDFT - 8 im:

7
Y(n) =
Y ( k )e
j 2kn / 8
, n= 0,1,7
n=0
s cho kt qu l: y(n) = {1,4,9.11,8,3,0,0}

Do dy y(n) ch c su phn t nn cc gi tr u s b loi b. Hai phn t
ny c gi tr bng khng bi v ta s dng di ca cc DFT l 8 im v
qu mc cn thit 2 im.
Mc du tch ca hai DFT tng ng vi tng chp vng trong min thi
gian, tuy nhin ta cng thy rng vic a thm vo cc dy x(n) v h(n) vi mt
s lng cc mu c gi tr khng lm cho tng chp vng c cng kt qu
vi tng chp tuyn tnh. Trong trng hp lc F ca v d 4.3.1 th tng chp
vng 6 im ca cc dy:
h(n) = {1,2,3,0,0,0,}
(4.3.4)
x(n) = {1,2,2,1,0,0,}
(4.3.5)
s cho dy u ra:
y(n) = {1,4,9.11,8,3}
(4.3.6)
ging vi dy nhn c bng tng chp tuyn tnh.
NNK
Photocopyable
96
Mt iu rt quan trng cn lu l khi di ca cc DFT nh hn L +

M - 1 th kt qu nhn c s c s sai lch so vi kt qu ng.
V d di y s cp n vn ny:
V d 4.3.2: Hy xc nh dy y(n) bng cch s dng cc FT - 4 im i
vi v d 4.3.1
Gii: DFT -4 im ca h(n) l:
3
H(k) =
h( n)e
j 2k / 4
n=0
H(k) = 1+ 2e- jk/2 + 3e- jk , k= 0,1,2,3

Suy ra:
H(0) =6
H(1) = -2 j2 H(2) = 2 H(3) = -2 + j2
DFT-4 im ca x(n) l:
X(k) = 1+ 2e- jk/2 + 2e- jk + 3e- jk/2 , k= 0,1,2,3
T y suy ra:
Y(n) = {9,7,9,11}
Kt qu ny cng ging vi kt qu nhn c nu ta s dng tng chp
vng 4 im ca h(n) v h(n).
Nu so snh kt qu ca y(n) nhn c t DFT-4 im vi dy y(n) nhn
c bng cch sdng DFT-8 im ( thc cht ch cn 6 im) th ta s thy cc
kt qu ny c s sai lch nh cp trong phn 4.2.2. C th c th tm thy
quan h sau:
y(0) = y(0) + y(4) =9
y(5) = y(1) + y(5) =7
Trong 4 gi tr tm c ca y(n) th ch hai gi tr u l sai lch so vi
cc gi tr tng ng ca y(n).
Nh vy c th thy nu x(n) l dy hu hn vi dI L, h(n) l dy hu
hn c dI M (gi s L>M) th khi s dng cc DFT v IDFT s c M-1 gi tr
u b sai lch so vi gi tr ng v cn phI loi b. y l mt kt lun rt
quan trng cn c s dng v sau.
4.3.2. Lc cc dy s c dI d liu ln
NNK
Photocopyable
97
Trong thc t, thng thng bi ton lc tuyn tnh ca tn hiu thng c

d liu u vo x(n) vi di rt ln. iu ny li cng ng i vi mt vi
ng dng x l tn hiu trong thi gian thc c lin quan n vic theo di v
phn tch tn hiu. Khi tn hiu c di qu ln th r rng vic s dng my
tnh trong qu trnh x l theo phng php DFT cng gp phI mt s kh khn:
Vic x l c th i hi mt dung lng b nh rt ln trong khi b nh
ca my tnh l c hn.
- Thi gian tnh ton qu ln vt hn thi gian cho php.
c c mt s mu u tin th phi i cho n khi kt thc tt c
qun trnh tnh ton.
khc phc cc nhc im ny, tn hiu vo c
dI ln cn phi c phn thnh cc on khc nhau vi di nht
nh trc khi thc hin vic x l. Bi v b lc ltuyn tnh do vy vic x l
cc dy tn hiu ny c th c tin hnh mi thi im khc nhau thng qua
DFT. Cc tn hiu u ra ny sau c kt hp vi nhau c th nhn c
u ra tng ng vi trng hp b lc c tc ng bi mt tn hiu u vo
duy nht.
Da vo vic phn tn hiu u vo thnh cc on c kch thc va phI,
c hai phng php DFT hay c s dng i vi b lc FIR tuyn tnh vi tn
hiu vo c di qu ln. Phng php th nht c gi l phng php t k
nhau, phng php th hai c gi l phng php xp chng. Trong c hai
phng php ta s gi s b lc FIR c di l M, dy u vo c chia thnh
cc dy con vi di mi dy l L. y khng lm mt tnh tng qut, gi s
rng L>>M.
4.3.2.1. Phng php t k nhau
NNK
Photocopyable
98
Theo phng php ny, di ca mi on d liu u vo s l N = L+

M 1, di ca DFT v IDFT c s dng s l N. Nh vy di ca cc
on d liu u vo c tng t L ln L+ M -1. Trong trng hp ny, c th
xem x(n) nh l tng ca cc dy thnh phn t k nhau M-1 im v mi dy
cha M-1 im cui cng ca dy trc v L im d liu mi. Ring dy u
tin s c b sung thm M-1 mu khng u tin. Nh vy, cc dy d liu
thnh phn ca x(n)s l:
x 1 (n) = {0, 0,..., 0, x(0), x(1),..., x(L-1)}
(4.3.7)
x 2 (n) = {x(L - M + 1),..., x(L-1), x(L),..., x(2L-1)}
(4.3.8)
x 3 (n) = {x(2L-M + 1),..., x(2L-1), x(2L),..., x(3L-1)}
(4.3.9)
v v.v..
DFT - N im s c tnh i vi mi dy thnh phn. di p ng
xung ca b lc FIR cng c tng thm L-1 mu khng v DFT N im ca
dy s c tnh v lu tr li. Tch ca hai DFt N im {H(k)} v {X m (k)} i
vi mi dy d liu s cho kt qu:
Y m (k) = H(k ) X m (k),
k= 0,1,...,N-1
(4.3.10)
IDFT - N im s cho kt qu:

y m (n) = y m (0) y m (1)... y m (M-1) y m (M),... y m (N-1)
(4 .3.11)
Bi v DFT v IDFT c s dng y ch c di ca chui u vo

cho nn theo kt lun trong 4.3.1, M-1 im u tin ca dy kt qu ny s b
loi b. L im cui cng ca dy Y m (n) s hon ton trng vi cc gi tr
tng ng c tnh theo tng chp tuyn tnh, ngha l:
y m (n) = y m (n),
n = M,M+1, ..., N-1
(4.3.12)
Vic phn on d liu u vo v sp xp cc khi d liu u ra tng

ng vi chng nhn c dy d liu u ra kt qu c m t trn hnh 4.10.
4.3.2.2. Phng php cng xp chng
Theo phng php ny, kchs thc ca mi dy thnh phn l L im v
di ca Dft v IDFt l N = L+M-1. i vi mi dy thnh phn ny ta a thm
NNK
Photocopyable
99
M-1 mu khng v tnh DFT N im. Nh vy cc dy thnh phn c biu

din nh sau:
x 1 (n) = {x(0), x(1),..., x(L-1), 0,0,...,0}
(4.3.13)
x 2 (n) = {x(L), x(L+1),..., x(2L-1), 0,0,...,0}
(4.3.14)
x 3 (n) = {x(2L), ..., x(3L-1), 0,0,...,0}
(4.3.15)
v v.v.. Hai DFT N im c nhn vi nhau nhn c:

Y m (k) = H(k) X m (k), k = 0,1,...,N-1
(4.3.16)
DFTl phng php gin tip tnh u ra ca b lc tuyn tnh v cho

n thi im ny c th thy phng php tng i phc tp do mt lot cc
thao tc cn phi c thc hin nh dy u vo cn phi c chuyn i sang
min tn s thng qua DFt, nhn kt qu nhn c vi DFt ca b lc FIR v
sau nhn c kt qu cui cng li phi thc hin bin i ngc IDFT
sang min thi gian. Mc d vy phng php ny li cho php s dng mt thut
ton rt hiu qu (bin i nhanh Fourier). So vi vic x l trc tip b lc FIR
trong min thi gian, cc thut ton bin i nhanh ch i hi rt t cc php ton
c th nhn c dy u ra v dy chuyn chnh l nguyn nhn ch yu dn
n vic s dng rng ri phng php DFt trn thc t. Cc thut ton bin i
nhanh Fourier s c gii thiu trong chng VI
4.4. PHn tch tn hiu trong min tn s bng DFt
Ta bit rng mt tn hiu c di hu hn N c th c biu din mt
cch y thng qua php bin i Fourier ri rc DFt. Tuy vy, khi cc tn
hiu c di qu ln hoc v hn th vic xc nh bin i Fourier ri rc ca
n l khng th thc hin c. Trong trng hp ny, ta cn ly mt on thch
hp nht ca tn hiu vi mt di cho php thc hin bin i DFT. Khi
r rng rng phng php DFt ch cho ra mt kt qu xp x ca tn hiu. y, ta
NNK
Photocopyable
100
xem xt vn hn ch di ca tn hiu v cc hiu ng ni sinh do vic s

dng phng php DFT i vi dy c hn ch v di.
Nu tn hiu cn phn tch l tn hiu tng t th trc tin tn hiu ny
cn c chuyn qua b lc loi b cc nhiu (hoc cc thnh phn ca tn s
khng cn thit) v sau c ly mu vi tn s F s 2B, vi B l rng ca
di thng. Nh vy tn s cao nht ca hai thnh phn c cha tn hiu khi ly
mu l F s /2. c th hn ch di ca tn hiu c ly mu, gi x ch
xt tn hiu trong mt khong thi gian hu hn T 0 = LT, trong L l lng mu
v T l khong thi gian ga hai ln ly mu ( chu k ly mu). Khong thi gian
ly mu ny v nguyn tc s hn ch phn gii v tn s ; ngha l n s hn
ch kh nng phn bit i vi cc thnh phn tn s m khong cch gia chng
nh hn 1/ T 0 = 1/LT trong min tn s.
Gi s rng {x(n)} l tn hiu cn phn tch. C th thy vic gii hn
di ca dy {x(n)} vi L mu trong khong 0 nL-1 s tng ng vi vic
nhn tn hiu ny vi mt hm ca s hnh ch nht (gi tt l hm ca s) vi
di L. Ngha l:
X(n) = x(n) (n)
1
0
Trong (n) =
0 n L 1
n
Hy xt mt trng hp n gin khi dy x(n ) l dy tn hiu hnh sin:

X(n)=
NNK
Photocopyable
101
IV. Tch chp nhanh (tch chp phn on)

a. Tng quan
ng dng DFT vo vic tnh tch chp khng tun hon, tc tch chp
tuyn tnh, trc ht cn phn bit hai trng hp:
Trng hp th nht khi cc dy chp vi nhau c chiu di gn bng nhau
v ngn.
Trng hp th hai l khi cc dy chp vi nhau v c chiu di khc xa
nhau.
Trng hp th nht chnh l trng hp c nghin cu phn trn.
Nhng trong thc t, ta thng gp trng hp th hai. Vic tnh ton DFT ca
dy c chiu di qu ln s b hn ch bi vn dung lng b nh ca my tnh
NNK
Photocopyable
102
in t v thi gian tnh ton khng m bo. Hn na, c c mu u tin

ca kt qu ta phi i n khi kt thc qu trnh tnh ton.
gii quyt cc vn trn, chng ta phi chia qu trnh tnh ton ra
thnh nhiu giai on. C hai phng php gm cc ni dung chnh:
- Chia dy thnh nhiu dy con.
- Chp tng dy con mt
- T hp cc kt qu thnh phn.
Gi s dy x(n) c chiu di N, dy h(n) c chiu di M v N >> M. Khi
chph ca x(n) v h(n) l y(n) s c chiu di N+ M - 1. Nu N rt ln th ta
khng th dng DFT tnh trc tip tch chp ny c. V th, nu mun dng
DFT ta phi phn dy x(n) ra lm nhiu on nh.
b. Phng php 1: Cng xp chng
Gi s ta cn tnh tch chp tuyn tnh
y(n) = x(n)*h(n)
L[x(n)] = N, L[h(n)] = M v N >> M.
Dy x(n) c coij l tng ca cc dy thnh phn xi(n), m L[xi(n)] = N1. Tc l:
x (n ) = x i (n )
(4.4.1)
iN1 n (i + 1) N1
x ( n )
x i (n ) =
0
Mt khc ta c:
vi
y( n ) = h ( n ) * x ( n ) =
h ( m ) x i ( n m )
m =
i
(4.4.2)
h ( m) x (n m) =
m =
h ( m ) x i ( n m) = h ( n ) * x i ( n ) = y i ( n )
i m =
khi , yi(n) = h(n)*xi(n) gi l tch chp phn on, y l tch chp tuyn tnh,
nu dng DFT th mi tch chp phn on ny ta phi tnh DFT vi chiu di
N1+M-1. Tc l ta phi tnh tch chp vng vi chiu di 2(N1+M-1):
NNK
Photocopyable
103

Xulythso 9682

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Xulythso 9682

Uploaded by

Copyright:

Available Formats

Bi ging x l

BM K Thut My Tnh - Trung tm K Thut My Tnh - H KTCN Thi Nguyn

BM K Thut My Tnh - Trung tm K Thut My Tnh - H KTCN Thi Nguyn

- Cc tn hiu nghe thy l cc s bin i ca p sut khng kh truyn thng tin

Hnh 1.1. Tn hiu tai nghe.

BM K Thut My Tnh - Trung tm K Thut My Tnh - H KTCN Thi Nguyn

Cch biu din ton hc tn hiu ri rc x(n) c th nh sau:

BM K Thut My Tnh - Trung tm K Thut My Tnh - H KTCN Thi Nguyn

Biu din th ca tn hiu ri rc trn nh hnh 1.4.

Hnh 1.4. Biu din th tn hiu ri rc.

Dy ny tng hoc gim tu thuc vo tham s a ln hn hay nh hn 1. nh hnh 1.5(a

BM K Thut My Tnh - Trung tm K Thut My Tnh - H KTCN Thi Nguyn

BM K Thut My Tnh - Trung tm K Thut My Tnh - H KTCN Thi Nguyn

Ta ni rng dy x2(n) l dy lp li tr ca dy x1(n) khc nu ta c:

Hnh 1.7. Biu din tn hiu tr.

Vi h thng tuyn tnh, ta c:

y(n ) = T[x (n )] = T x (k ) (n k ) = x (k )T[ (n k )]

Nu k hiu hk(n) l p ng ca h thng vi kch thch (n-k), c ngha: hk(n) =

BM K Thut My Tnh - Trung tm K Thut My Tnh - H KTCN Thi Nguyn

Cui cng ta c: y(n ) =

h thng tuyn tnh.

Khi , hk(n) l p ng xung ca h thng tuyn tnh. Cn h(n) l p ng xung

Quan h (1.3.3) c gi l tch chp ca x(n) v h(n).

Cho x(n) = rect5(n) v h ( n ) =

Tnh tch chp x(n)*h(n).

ta thc hin cc bc:

BM K Thut My Tnh - Trung tm K Thut My Tnh - H KTCN Thi Nguyn

x (k )h (k ) =1.1 + 1.0 + 1.0 + 1.0 + 1.0 = 1

x (k )h (1 k ) =1.0,75 + 1.1 + 1.0 + 1.0 + 1.0 = 1,75

x (k)h (2 k ) =1.0,5 + 1.0,75 + 1.1 + 1.0 + 1.0 = 2,25

x (k )h (3 k) =1.0,25 + 1.0,5 + 1.0,75 + 1.1 + 1.0 = 2,5

x (k )h (4 k ) =1.0 + 1.0,25 + 1.0,5 + 1.0,75 + 1.1 = 2,5

x (k )h (5 k ) =1.0 + 1.0 + 1.0,25 + 1.0,5 + 1.0,75 = 1,5

x (k )h (6 k ) =1.0 + 1.0 + 1.0 + 1.0,25 + 1.0,5 = 0,75

x (k )h(7 k ) =1.0 + 1.0 + 1.0 + 1.0 + 1.0,25 = 0,25

x (k )h (8 k ) =1.0 + 1.0 + 1.0 + 1.0,25 + 1.0 = 0

Cui cng, ta c y(n) c biu din bng th sau:

Hnh 1.8. th p ng ra ca h thng TTBB

BM K Thut My Tnh - Trung tm K Thut My Tnh - H KTCN Thi Nguyn

c. Cc tnh cht ca tch chp

Thay bin: n - k = l k = n - l; k : - -> l : + v k : + -> l : -

- Tch chp c tnh kt hp.

x(k )h [(n l) k]h

- Tch chp c tnh phn phi.

BM K Thut My Tnh - Trung tm K Thut My Tnh - H KTCN Thi Nguyn

v h3(n) = rect11(n). Tnh h(n) ca h thng.

Hnh 1.10. Biu din p ng xung ca h thng.

BM K Thut My Tnh - Trung tm K Thut My Tnh - H KTCN Thi Nguyn

Mt h thng TTBB gi l nhn qu nu p ng ra ca n mt thi im bt k

Nu h ny l h nhn qu th ta c: y1(n) = y2(n) vi n < n0. Bin i tng trn ta c:

V vi k n0 ta c: x1(k) x2(k); mt khc vi n < n0 th y1(n) = y2(n). Do , h(n-k) =

III.4. H thng tuyn tnh bt bin n nh.

BM K Thut My Tnh - Trung tm K Thut My Tnh - H KTCN Thi Nguyn

Chng minh: Ta cn chng minh iu kin cn v h thng n nh.

Nh vy, nu kch thch x(n) b hn ch, th ta c: x(n) M <: vi mi n (n). Khi

Theo gi thit, nu:

- iu kin cn: theo nh ngha h n nh, ta phi c y(n) < vi mi n. Do iu kin

Gi s cho tc ng x(0) = 1 nu h(-n) > 0 v ngc li: x(0) = -1 nu h(-n) < 0.

x (k )h (k ) = h (k ) = . Do vy tn hiu ra khng b chn nu

khng tho mn iu kin (1.2.10).

Chui lu tha ny s hi t v S = 1/(1-a) vi a<1. N s phn k nu a> 1. Do

Trong N, M nguyn dng, N l bc ca phng trnh sai phn. Trong phng

BM K Thut My Tnh - Trung tm K Thut My Tnh - H KTCN Thi Nguyn