Chng I

Chng

GII THIU X L TN HIU S

Chng ny nu tng qut cc vn lin quan n mn hc. Ni dung chnh chng ny l: Gii thch cc khi nim nh: Tn hiu, Tn hiu s, X l tn hiu, X l tn hiu s... Cc khu c bn trong h thng x l tn hiu s Nu mt s ng dng ca x l tn hiu s So snh x l tng t v x l s Gii thch khi nim Tn s Cc bc c bn chuyn i tn hiu t tng t sang s Cc bc c bn chuyn i tn hiu t s sang tng t

1.1 TN HIU, H THNG v X L TN HIU hiu X l tn hiu l g, ta s tm hiu ngha ca tng t. Tn hiu(signal) dng ch mt i lng vt l mang tin tc. V mt ton hc, ta c th m t tn hiu nh l mt hm theo bin thi gian, khng gian hay cc bin c lp khc. Chng hn nh, hm: x(t ) = 20t 2 m t tn hiu bin thin theo bin thi gian t. Hay mt v d khc, hm:

s ( x, y ) = 3 x + 5 xy + y 2 m t tn hiu l hm theo hai bin c lp x v y, trong x v y

biu din cho hai ta khng gian trong mt phng. Hai tn hiu trong v d trn thuc v lp tn hiu c th c biu din chnh xc bng hm theo bin c lp. Tuy nhin, trong thc t, cc mi quan h gia cc i lng vt l v cc bin c lp thng rt phc tp nn khng th biu din tn hiu nh trong hai v d va nu trn.

Hnh 1.1 V d tn hiu ting ni Ly v d tn hiu ting ni- l s bin thin ca p sut khng kh theo thi gian. Chng hn khi ta pht m t away, dng sng ca t c biu din trn hnh 1.1. Mt v d khc l tn hiu in tm (ECG)- cung cp cho bc s nhng tin tc v tnh trng tim ca bnh nhn, hay l tn hiu in no (EEG) cung cp tin tc v hot ng ca no. Cc tn hiu ting ni, ECG, EEG l cc v d v tn hiu mang tin c th biu din l hm theo bin thi gian. Thc t c nhng tn hiu l hm theo nhiu bin c lp. V d nh tn -1-

Chng I

hiu nh (image)- l s thay i ca cng nh sng theo khng gian, c th xem l hm sng theo hai bin khng gian. Tt c cc tn hiu u do mt ngun no to ra, theo mt cch thc no . V d tn hiu ting ni c to ra bng cch p khng kh i qua dy thanh m. Mt bc nh c c bng cch phi sng mt tm phim chp mt cnh/ i tng no . Qu trnh to ra tn hiu nh vy thng lin quan n mt h thng, h thng ny p ng li mt kch thch no . Trong tn hiu ting ni, h thng l h thng pht m, gm mi, rng, li, dy thanh... Kch thch lin quan n h thng c gi l ngun tn hiu (signal source). Nh vy ta c ngun ting ni, ngun nh v cc ngun tn hiu khc. C th nh ngha h thng (system) l mt thit b vt l thc hin mt tc ng no ln tn hiu. V d, b lc dng gim nhiu trong tn hiu mang tin c gi l mt h thng. Khi ta truyn tn hiu qua mt h thng, nh b lc chng hn, ta ni rng ta x l tn hiu . Trong trng hp ny, x l tn hiu lin quan n lc nhiu ra khi tn hiu mong mun. Nh vy, x l tn hiu (signal processing) l mun ni n mt lot cc cng vic hay cc php ton c thc hin trn tn hiu nhm t mt mc ch no , nh l tch ly tin tc cha bn trong tn hiu hoc l truyn tn hiu mang tin t ni ny n ni khc. y ta cn lu n nh ngha h thng, khng ch n thun l thit b vt l m cn l cc phn mm x l tn hiu hoc l s kt hp gia phn cng v phn mm.V d khi x l s tn hiu bng cc mch logic, h thng x l y l phn cng. Khi x l bng my tnh s, tc ng ln tn hiu bao gm mt lot cc php ton thc hin bi chng trnh phn mm. Khi x l bng cc b vi x l- h thng bao gm kt hp c phn cng v phn mm, mi phn thc hin cc cng vic ring no . 1.2 PHN LOI TN HIU Cc phng php ta s dng trong x l tn hiu ph thuc cht ch vo c im ca tn hiu. C nhng phng php ring p dng cho mt s loi tn hiu no . Do vy, trc tin ta cn xem qua cch phn loi tn hiu lin quan n nhng ng dng c th. 1.2.1 Tn hiu nhiu hng v tn hiu nhiu knh Nh ni trong mc 1.1, tn hiu c th c m t l hm theo mt hoc nhiu bin c lp. Nu tn hiu l hm theo mt bin, ta gi l cc tn hiu mt hng (one-dimention signal), nh tn hiu ting ni, ECG, EEG. Ngc li ta gi l tn hiu nhiu hng (multidimention signal), v d nh tn hiu nh trng en, mi im nh l hm theo 2 bin c lp.
y

y1

I(x1,y1)

x x1

Hnh 1.2 V d tn hiu nh mu (2 hng- 3 knh) -2-

Chng I

Trong mt s ng dng, tn hiu c to ra khng phi t mt m l nhiu ngun hay nhiu b cm bin. Cc tn hiu nh vy c gi l tn hiu a knh (multi-channel signal). Bc nh trn hnh 1.2 l mt v d v tn hiu 2 hng, 3 knh. Ta thy sng I(x,y) mi mt im l hm theo 2 bin khng gian c lp, sng ny li ph thuc vo sng ca 3 mu c bn red, green v blue. Mt v d khc, tn hiu nh TV mu l tn hiu 3 hng- 3 knh, c th biu din bi vector sau :

I r (x, y, t) I(x, y, t) = Ig (x, y, t) I (x, y, t) b

Trong gio trnh ny, ta tp trung xt tn hiu mt hng- mt knh, bin l bin thi gian (mc d thc t khng phi lc no bin cng l bin thi gian) 1.2.2 Tn hiu lin tc v tn hiu ri rc Tn hiu lin tc (continuous-time signal) hay cn gi l tn hiu tng t l tn hiu c xc nh ti tt c cc gi tr thi gian. V mt ton hc, c th m t tn hiu ny l hm ca mt bin lin tc, v d tn hiu ting ni. Tn hiu ri rc (discrete-time signal) ch c xc nh ti mt s thi im no . Khong cch gia cc thi im ny khng nht thit phi bng nhau, nhng trong thc t thng l ly bng nhau d tnh ton. C th to ra tn hiu ri rc t tn hiu lin tc bng 2 cch. Mt l ly mu tn hiu lin tc, hai l o hay m mt i lng vt l no theo mt chu k nht nh, v d cn em b hng thng, o p sut khng kh theo gi... Tn hiu x(t n ) = e n , n = 0, 1, 2, 3,... l mt v d v tn hiu ri rc. Ta c th dng bin nguyn n thay cho bin thi gian ri rc tn. Lc ny, tn hiu tr thnh mt hm theo bin nguyn, v mt ton ta c th biu din tn hiu ri rc l mt dy s (thc hoc phc). Ta s dng k hiu x(n) thay cho x(tn), ngha l tn = nT vi T l hng s- khong cch gia hai thi im ri rc cnh nhau. Hnh 1.3 l mt v d v tn hiu ting ni ri rc.
t

Hnh 1.3 V d tn hiu ri rc 1.2.3 Tn hiu bin lin tc v tn hiu bin ri rc Bin ca c tn hiu lin tc v ri rc u c th lin tc hay ri rc. Nu tn hiu c tt c cc gi tr trong mt di bin no th ta gi l tn hiu bin lin tc (continuous-valued signal). Ngc li, nu tn hiu ch ly mt s gi tr no (cn gi l mc) trong mt di bin th l tn hiu bin ri rc (discrete-valued signal). -3-

Chng I

Khong cch gia cc mc bin ny c th bng nhau hay khng bng nhau. Thng th ta biu din cc mc bin ny bng mt s nguyn, l bi s ca khong cch gia hai mc bin cnh nhau. Tn hiu ri rc theo c thi gian v bin c gi l tn hiu s (digital signal). Hnh 1.4 l mt v d v tn hiu s.

Hnh 1.4 V d tn hiu s vi 6 mc bin khc nhau x l tn hiu, trc ht phi thu ly c tn hiu. V d ta thu ly tn hiu m thanh bng microphone, chuyn i tn hiu m thanh sang tn hiu in. Hay nh tn hiu nh, ta c th thu ly bng my nh. Trong my nh tng t chng hn, tn hiu nh sng iu khin cc phn ng ha hc trn mt tm phim nh. V bn cht, cc tn hiu t nhin u l tng t, c s mc bin v s thi im u l v hn. Do vy, tn hiu tng t khng ph hp x l bng cc h thng s. x l s, tn hiu tng t c ly mu vo cc thi im ri rc, to thnh tn hiu ri rc, sau lng t ha bin ca n thnh mt tp cc mc bin ri rc. Qu trnh lng t ha (quantization) tn hiu, v c bn l mt qu trnh xp x ha. N c th c thc hin d dng bng cch lm trn hay ct gt. V d tn hiu c gi tr l 8.62 c th c xp x ha thnh 8 (nu lng t ha bng cch ct gt) hay l 9 (nu lng t ha bng cch lm trn) 1.2.4 Tn hiu xc nh v tn hiu ngu nhin Qu trnh phn tch ton hc v x l tn hiu yu cu phi m t c tn hiu. S m t ny lin quan n mt m hnh tn hiu. Da vo m hnh tn hiu, ta c mt cch phn loi tn hiu khc. Cc tn hiu c th c m t duy nht bng mt biu din ton hc r rng nh l th, bng d liu... c gi l tn hiu xc nh (deterministic signal). T xc nh mun nhn mnh l ta bit r v chc chn cc gi tr ca tn hiu trong qu kh, hin ti v tng lai. Tuy nhin trong nhiu ng dng thc t, c nhng tn hiu khng th biu din chnh xc bng cc cng thc ton hc hay nhng m t ton nh vy l qu phc tp. Ta khng th on trc s bin thin ca cc gi tr ca loi tn hiu ny. Ta gi y l tn hiu ngu nhin (random signal). V d tn hiu nhiu l tn hiu ngu nhin. Ta cn lu rng vic phn loi tn hiu thc thnh xc nh hay ngu nhin khng phi lc no cng r rng. i khi, xem tn hiu l xc nh hay ngu nhin u dn n nhng kt qu c ngha. Nhng i khi, vic phn loi sai s dn n kt qu b li, bi v c nhng cng c ton ch c th p dng cho tn hiu xc nh, trong khi cc cng c khc li ch p dng cho tn hiu ngu nhin. iu ny s tr nn r rng hn khi ta kim tra cc cng c ton c th. 1.3 H THNG X L TN HIU 1.3.1 Cc khu c bn trong mt h thng x l s tn hiu Nh ni trn, hu ht cc tn hiu bt gp trong khoa hc v k thut u l tng t. C th x l trc tip cc tn hiu bng mt h thng tng t thch hp. Trong trng hp -4-

Chng I

ny, ta ni tn hiu c x l trc tip dng tng t, nh minh ha trn hnh 1.5. C tn hiu vo v ra u l tn hiu tng t.
T/h tng t vo B x l tn hiu tng t T/h tng t ra

Hnh 1.5 X l tn hiu tng t X l s l mt phng php khc x l tn hiu tng t, nh minh ha trn hnh 1.6. Tn hiu tng t phi c chuyn i thnh dng s (A/D) trc khi x l. iu khng may l qu trnh chuyn i tng t/ s ny khng bao gi hon ho, ngha l tn hiu s khng phi l biu din chnh xc cho tn hiu tng t ban u. Khi tn hiu tng t c chuyn thnh tn hiu s gn ng nht, qu trnh x l s c thc hin bng mt b x l tn hiu s DSP (Digital Signal Processor), to ra mt tn hiu s mi. Trong hu ht cc ng dng, tn hiu s cn c chuyn i ngc li thnh tn hiu tng t (D/A) cui qu trnh x l. Tuy nhin, cng c nhng ng dng lin quan n phn tch tn hiu, trong khng cn chuyn i D/A. Hnh 1.6 l s khi mt h thng x l tn hiu bng phng php s. B x l tn hiu s DSP c th l mt mch logic, mt my tnh s hoc l mt b vi x l lp trnh c.
T/h tng t vo B chuyn i A/D T/h s vo B x l tn hiu s DSP T/h s ra B chuyn i D/A T/h tng t ra

Hnh 1.6 X l s tn hiu 1.3.2 u im ca x l s so vi x l tng t C nhiu nguyn nhn khc nhau khin cho x l s c a chung hn l x l trc tip tn hiu tng t. Trc tin, h thng s c th lp trnh c, to ta tnh mm do trong vic cu hnh li cc hot ng x l bng cch n gin l thay i chng trnh, trong khi cu hnh li h tng t, ta phi thit k li phn cng, ri kim tra v thm nh xem cc hot ng c ng khng. chnh xc cng ng mt vai tr qua trng trong vic la chn b x l tn hiu. sai lch ca cc linh kin tng t khin cho cc nh thit k h thng v cng kh khn trong vic iu khin chnh xc ca h thng tng t. Trong khi , vic iu khin chnh xc ca h thng s li rt d dng, ch cn ta xc nh r yu cu v chnh xc ri quyt nh la chn cc b chuyn i A/D v DSP c di t thch hp, c kiu nh dng du phy tnh hay du phy ng. Tn hiu s d dng lu tr trn cc thit b bng a t m khng b mt mt hay gim cht lng. Nh vy tn hiu s c th truyn i xa v c th c x l t xa. Phng php x l s cng cho php thc hin cc thut ton x l tn hiu tinh vi phc tp hn nhiu so vi x l tng t, nh vic x l c thc hin bng phn mm trn cc my tnh s. Trong mt vi trng hp, x l s r hn x l tng t. Gi thnh thp hn l do cc phn cng s r hn, hoc l do tnh mm do trong x l s. Tuy nhin, x l s cng c mt vi hn ch. Trc tin l s hn ch v tc hot ng ca cc b chuyn i A/D v b x l s DSP. Sau ny ta s thy nhng tn hiu bng thng -5-

Chng I

cc ln yu cu tc ly mu ca b A/D cc nhanh v tc x l ca DSP cng phi cc nhanh. V vy, phng php x l s cha p dng c cho cc tn hiu tng t bng thng ln. Nh s pht trin nhanh chng ca cng ngh my tnh v cng ngh sn xut vi mch m lnh vc x l tn hiu s (DSP) pht trin rt mnh trong vi thp nin gn y. ng dng ca DSP ngy cng nhiu trong khoa hc v cng ngh. DSP ng vai tr quan trng trong s pht trin ca cc lnh vc nh vin thng, a phng tin, y hc, x l nh v tng tc ngi-my... thy r nh hng to ln ca x l tn hiu s, ta xem v d v s pht trin ca my nh, t my nh tng t truyn thng n my nh s ngy nay. My nh truyn thng hot ng da trn cc c im vt l ca thu knh quang hc, trong cht lng bc nh cng p khi h thng thu knh cng to v rng. Khi my nh s mi ra i vi thu knh nh hn th cht lng nh chp thp hn nhiu so vi tng t. Tuy nhin, khi nng lc x l ca cc b vi x l mnh hn v cc thut ton x l tn hiu s tinh vi hn c p dng th cc nhc im v quang hc c khc phc v cht lng nh c ci thin r rt. Hin nay, cc my nh s cho cht lng nh vt tri hn so vi tng t. Hn na, cc my nh s ci trong in thoi di ng hin nay c thu knh rt nh nhng vn c th cho cht lng nh rt tt. Cht lng nh y ph thuc vo nng lc ca DSP ch khng phi ph thuc vo kch thc ca thu knh quang hc. Ni cch khc, cng ngh my nh s s dng nng lc tnh ton ca DSP khc phc cc hn ch v vt l. Tm li, DSP l mt lnh vc da trn nguyn ca ton hc, vt l v khoa hc my tnh v c nhng ng dng rt rng ri trong nhiu lnh vc khc nhau. 1.4 KHI NIM TN S TRONG TN HIU LIN TC V TN HIU RI RC T vt l chng ta bit rng tn s lin quan cht ch vi kiu chuyn ng c chu k gi l dao ng v c m t bng hm sin. Khi nim tn s lin quan trc tip n khi nim thi gian. Thc t th tn s c th nguyn l o ngc ca thi gian. Do vy bn cht ca thi gian (lin tc hoc ri rc) s c nh hng n bn cht ca tn s. 1.4.1 Tn hiu sin lin tc Mt dao ng iu ha n gin c m t ton hc bng hm sin lin tc sau:

x a (t) = Acos(t+ ), - <t<

Tn hiu ny c xc nh bi 3 thng s: A l bin , l tn s gc tnh bng radian trn giy (rad/s) v l gc pha tnh bng radian (rad) (hnh 1.7). Thay v dng , ta c th dng F tnh bng s chu k trn giy hay hertz (Hz), y: = 2 F . Vy ta c th vit li:

x a (t) = Acos(2 Ft+ ), - <t<

xa(t) Acos t Tp = 1/F

-A

Hnh 1.7 Tn hiu sin lin tc -6-

Chng I

Tn hiu sin lin tc trn c cc c im sau y: 1. Vi F c nh, tn hiu sin lin tc xa(t) tun hon vi chu k c bn l Tp = 1/F, ngha l ta lun lun c:

x a (t + Tp ) = x a (t), < t <

2. Cc tn hiu sin lin tc c tn s khc nhau th khc nhau. 3. Vic tng tn s s dn n tng tc ca dao ng ca tn hiu, tc l tng s chu k dao ng trong mt khong thi gian cho trc. V thi gian t lin tc nn ta c th tng F n v cng. Ta cng c th biu din tn hiu sin lin tc mt dng khc, thng c gi l phasor nh sau:

x a (t) = Acos(t+ )=

A j( t + ) A j( t + ) e + e 2 2

Theo cch biu din phasor, c th xem tn hiu sin lin tc l tng ca 2 tn hiu iu ha hm m phc c bin bng nhau v lin hp phc vi nhau, tn s gc y l : tn s dng v m. thun tin v mt ton, ta s dng c khi nim tn s dng v m. Vy di tn s ca tn hiu lin tc l < F < . 1.4.2 Tn hiu sin ri rc Tn hiu sin ri rc c biu din nh sau:

x(n) = Acos( n+ ), - <n<

y n l bin nguyn gi l s mu, A l bin , l tn s gc tnh bng radian trn mu (rad/mu) v l gc pha tnh bng radian (rad). Thay v dng , ta c th dng tn s f vi quan h: = 2 f . Ta vit li x(n) nh sau:

x(n) = Acos(2 fn+ ), - <n<

Tn s f c th nguyn l chu k trn mu (chu k/mu). Tm thi by gi chng ta cha xt n mi quan h gia F v f, ta xem nh tn hiu sin ri rc l c lp vi tn hiu sin lin tc. Hnh 1.8 l biu din tn hiu sin ri rc vi = / 6 (rad/mu) v pha = / 3 (rad).
1 0.8 0.6 0.4 0.2 0 -0.2 -0.4 -0.6 -0.8 -1 -10

-5

10

15

Hnh 1.8 Tn hiu sin ri rc Khc vi tn hiu sin lin tc, tn hiu sin ri rc c cc c im sau y: 1. Tn hiu sin ri rc tun hon khi v ch khi tn s f l mt s hu t. T nh ngha, tn hiu ri rc x(n) tun hon vi chu k N (N>0) khi v ch khi

-7-

Chng I

x(n + N) = x(n) n
Gi tr N nh nht c gi l chu k c bn. Gi s tn hiu sin ri rc tn s f0 tun hon, ta c:

cos[2 f 0 (n+N)+ ]=cos(2 f 0 n+ )

Quan h ny ch ng khi tn ti mt s nguyn k sao cho:

2 f 0 N = 2k f 0 =

k N

Theo y, ta thy tn hiu sin ri rc ch tun hon khi f0 c th biu din di dng t ca hai s nguyn, ngha l f0 l mt s hu t. xc nh chu k c bn ca tn hiu sin ri rc, ta biu din f0 di dng t ca hai s nguyn k/N, sau a k/N v dng phn s ti gin. Lc mu s ca phn s ti gin chnh l chu k c bn. V d f1 = 31/50, ngha l N1 = 50 hay N2 = 25/50 = 1/2 ngha l N2 = 2. 2. Cc tn hiu sin ri rc c tn s khc nhau mt bi s nguyn ln 2 th trng nhau. Ta xt tn hiu sin ri rc x(n) = cos(0 n+ ) . D dng nhn thy rng:

x(n) = cos[(0 +2 )n+ ]=cos(0 n+2 n+ )=cos(0 n+ )

Vy tt c cc tn hiu sin ri rc c dng:

x k (n) = cos(k n+ ), k = 0,1,2,...

vi

k = 0 + 2k , 0
u trng nhau. Ni cch khc, cc tn hiu sin ri rc c tn s nm trong di hay 1 f 1 th mi khc bit nhau. V l do nn ta gi nhng tn 2 2 hiu sin ri rc c tn s nm ngoi di [- , ] l phin bn (alias) ca nhng tn hiu ri rc c tn s nm trong di [- , ] tng ng. Di tn c gi l di c bn. Ni rng hn, di c bn l di tn s c b rng l 2. Nh vy, di c bn cng c th l di 0 2 , 3 ... Nhng thc t thng chn di c bn l:

hay l 0 2
3. Tc cao nht ca tn hiu sin ri rc t c khi = hay = , tng ng vi f = 1 hay f = 1 2 2 Ta c th thy r iu ny qua v d minh ha vi tn hiu x(n) = cos0 n . Ln lt cho

0 = 0, , , , ta c chu k tng ng l N = ,16,8, 4, 2 . Ta thy chu k gim khi

8 4 2

tn s tng, tc l tc dao ng ca tn hiu tng. 1.4.3 Tn hiu iu ha hm m phc Cng nh tn hiu sin iu ha, tn hiu iu ha hm m phc ng mt vai tr quan trng trong phn tch tn hiu v h thng. Trong phn ny chng ta xt tn hiu iu ha hm m phc trong c min thi gian lin tc v ri rc. -8-

Chng I

1. Tn hiu iu ha hm m phc lin tc Xt tn hiu sau:

s k (t) = e jk0 t = e jk 2 F0 t

k = 0, 1, 2...

Lu rng vi mi k, tn hiu sk(t) tun hon vi chu k c bn l 1/(kF0) = Tp/k v chu k chung l Tp. Khi k khc nhau th tn hiu sk (t) cng khc nhau. T sk (t), ta c th t hp tuyn tnh cc tn hiu sk(t) li vi nhau to thnh mt tn hiu tun hon xa(t) vi chu k c bn l Tp = 1/F0 nh sau:

x a (t) =

k =

cs

k k

(t) = c k e jk0 t
k =

Biu din ny c gi l khai trin Fourier ca xa (t), cc hng s phc ck l cc h s Fourier v sk(t) l cc hi bc k ca xa(t) 2. Tn hiu iu ha hm m phc ri rc V tn hiu sin ri rc ch tun hon khi tn s l mt s hu t nn ta chn f0 = 1/N v nh ngha tn hiu iu ha hm m phc ri rc l:

s k (n) = e jk 2 f0 n = e jk 2 n / N
Khc vi tn hiu lin tc, y ta thy:

k = 0, 1, 2...

s k + N (n) = e j2 (k + N)n / N = e j2 n s k (n) = s k (n)

iu ny ngha l khi chn k sai khc nhau mt bi s nguyn ca N th sk(n) s trng nhau, do ta ch cn xt vi k = n0 n k = n0 + N -1. cho tin, ta thng chn n0 = 0. Vy ta c:

s k (n) = e jk 2 f0n = e jk 2 n / N

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

Theo , tn hiu s(n) tun hon vi chu k c bn N c th khai trin thnh chui Fourier nh sau:

x(n) = c k s k (n) = c k e j2 kn / N
k =0 k =0

N 1

N 1

y ck l h s Fourier v sk (n) l hi bc k ca x(n). 1.5 BIN I TNG T - S (A/D) Hu ht cc tn hiu thc t nh ting ni, tn hiu sinh hc, tn hiu a chn, radar, sonar, tn hiu thng tin nh audio, video... u l tn hiu tng t. x l tn hiu tng t bng phng php s, trc ht phi chuyn tn hiu tng t sang dng s. Qu trnh ny gi l bin i A/D. Qu trnh A/D v c bn gm 3 bc nh minh ha trong hnh 1.9.
T/h tng t xa(t)

Ly mu

Lng t ha T/h ri rc x(n)

M ha

T/h s 010011...

T/h lng t xq(n)

-9-

Chng I

Hnh 1.9 B chuyn i A/D c bn 1. Ly mu (sampling) l qu trnh chuyn i tn hiu t lin tc thnh ri rc bng cch ly tng mu (sample) ca tn hiu lin tc ti cc thi im ri rc. Vy nu tn hiu xa(t) c a vo b ly mu th u ra l xa(nT) x(n) vi T l chu k ly mu. Sau ly mu, tn hiu lin tc tr thnh dy cc gi tr ri rc v c th lu tr trong b nh my tnh x l. Thc t th gi tr ca tn hiu ti cc thi im ly mu thng c duy tr cho n mu tip theo. Do qu trnh ly mu cn c gi l ly mu v gi mu (sample and hold). C th ni qu trnh ly mu ny l cu ni gia th gii tng t v th gii s. 2. Lng t ha (quantization) l qu trnh chuyn i tn hiu ri rc c bin lin tc thnh tn hiu ri rc c bin ri rc (cn gi l tn hiu s). Mi mu tn hiu c biu din bng mt gi tr chn t trong tp hu hn cc gi tr c th c. S khc nhau gia gi tr ca mu cha lng t ha x(n) v gi tr ca mu lng t ha xq(n) gi l sai s lng t ha (quantization error). Nu b qua sai s ny th thut ng tn hiu ri rc v tn hiu s c th s dng thay th cho nhau. 3. S ha (digitization) l qu trnh biu din mi gi tr ri rc xq(n) bng mt dy s nh phn b bit. Hnh 1.10 minh ha qu trnh bin i A/D qua mt v d c th.

Hnh 1.10 Bin i A/D 3 bit Trong phn ny, ta s xt chi tit qu trnh chuyn i A/D, gm ly mu, lng t ha v m ha. Nu bng thng ca tn hiu tng t l hu hn v tn s ly mu ln th vic ly mu s khng lm mt mt tn tc v khng lm mo tn hiu. Trong khi , lng t ha l qu trnh xp x ha nn s gy mo tn hiu. mo ny ph thuc vo s bit b. S bit tng s lm gim mo nhng dn n gi thnh tng. 1.5.1 Ly mu tn hiu tng t Nh gii thiu trn, qu trnh ly mu c m t bi quan h sau: - 10 -

Chng I

x(n) xa(nT) y x(n) l tn hiu ri rc c c bng cch ly mu tn hiu tng t xa(t) vo cc thi im cch nhau T giy. Khong thi gian T gia cc mu cnh nhau gi l chu k ly mu v Fs = 1/T gi l tc ly mu (mu/s) hay tn s ly mu (Hz). T y suy ra mi quan h gia bin thi gian lin tc t v bin thi gian ri rc n nh sau:

t = nT =

n Fs

Nh vy cng s tn ti mt quan h gia bin tn s F (hay ) ca tn hiu lin tc v bin tn s f (hay ) ca tn hiu ri rc. thit lp mi quan h ny, ta xt tn hiu sin lin tc sau:

x a (t) = Acos(2Ft+)
Ly mu tn hiu ny vi tn s Fs = 1/T (mu/s), ta c tn hiu ri rc sau:

2nF x a (nT) x(n) = Acos(2FnT+)=Acos + Fs

So snh tn hiu ny vi tn hiu sin ri rc xt trong (1.4.2), ta c quan h gia F v f l quan h tuyn tnh nh sau:

f=
iu ny tng ng vi:

F Fs

= T
Tn s f cn c gi l tn s chun ha (normalized frequency) hay tn s s. Ta c th s dng tn s f tnh tn s F (Hz) nu bit tn s ly mu. Kt hp cc di bin thin ca tn s F (hay ) v f (hay ) vi quan h va tm ra, ta c bng tm tt 1.1 sau: Tn hiu lin tc Tn hiu ri rc

= 2F
[rad/s] [Hz]

= 2f
[rad/mu] [chu k/mu]

< < < F < = T, f = F / Fs = / T, F = f .Fs / T / T Fs / 2 F Fs / 2

Bng 1.1 Quan h gia cc bin tn s - 11 -

1/ 2 f 1/ 2

Chng I

T quan h trn, ta thy im khc bit chnh gia tn hiu lin tc v tn hiu ri rc l di bin thin ca tn s F v f (hay v ). Vic ly mu mt tn hiu lin tc chnh l sp xp di tn s v hn ca bin F (hay ) vo di tn s hu hn ca bin f (hay ). V tn s cao nht ca tn hiu ri rc l f = (hay = ) nn vi tn s ly mu l Fs, tn s tng ng cao nht ca F v l:

Fmax = max

Fs 1 = 2 2T = Fs = T

Nh vy, tn s cao nht ca tn hiu lin tc khi ly mu vi tn s Fs l Fmax = Fs /2. Khi tn s ca tn hiu lin tc ln hn tn s Fs /2 th s xy ra s mp m (ambiguity)hay cn gi l chng ph (aliasing). Ta c th thy r iu ny qua v d minh ha sau: Cho 2 tn hiu sin khc nhau c tn s ln lt l 10 Hz v 50 Hz :

x1 (t) = cos2(10)t x 2 (t) = cos2(50)t

Ly mu 2 tn hiu ny vi tn s Fs = 40Hz, tn hiu ri rc l :

10 x1 (n) = cos2 n = cos n 2 40 5 50 x 2 (n) = cos2 n = cos n 2 40

Nhn xt thy x2 (n) = x1 (n). Nh vy, 2 tn hiu sin ri rc ny khng phn bit c vi nhau. Ta ni tn s 50 Hz l phin bn ca tn s 10 Hz ti tn s ly mu l 40 Hz. Ta c th suy ra tng qut l tn s (F0 + kFs) (Hz) l phin bn ca tn s F0 (Hz) ti tn s ly mu l Fs (Hz). T v d trn, ta c th d dng thy tn s cao nht khng xy ra s chng ph l 20 Hz. y chnh l Fs /2 tng ng vi = . Tn s Fs /2 cn c gi l tn s gp (folding frequency), v xc nh tn s phin bn (ln hn Fs / 2), ta c th chn Fs / 2 lm im cht ri gp (hay phn x) tn s phin bn vo di c s [0, Fs /2]. V d 1.1 Cho tn hiu tng t:

x a (t) = 3cos100t
(a) Xc nh tn s ly mu nh nht trnh chng ph (b) Gi s tn hiu trn c ly mu vi tn s Fs = 200 Hz, tn hiu ri rc sau ly mu l g ? (c) Gi s tn hiu trn c ly mu vi tn s Fs = 75 Hz, tn hiu ri rc sau ly mu l g ? (d) Xc nh tn s (0 < F < Fs) ca tn hiu sin m c cc mu trng vi cc mu ca tn hiu (c)

- 12 -

Chng I

1.5.2 nh l ly mu Cho mt tn hiu tng t, ta chn tn s ly mu nh th no ? tr li cu hi ny, ta phi c mt s thng tin chi tit v cc c im ca tn hiu c ly mu, bao gm bin , tn s v pha ca cc thnh phn tn s khc nhau. Tuy nhin, nhng thng tin nh vy th ta li khng c bit trc. Ta ch c th bit c tn s ln nht ca mt lp tn hiu no (nh l lp tn hiu ting ni, lp tn hiu video...). Da vo tn s ln nht ny, ta c th xc nh c tn s ly mu cn thit chuyn tn hiu t tng t sang s. V tn s ln nht ny c th thay i cht t trong cc tn hiu cng lp (v d ting ni ca nhng ngi ni khc nhau th c tn s ln nht khc nhau) nn m bo tn s ln nht khng vt qu Fs /2 ( trnh chng ph) th trc khi ly mu tn hiu, ta cho n i qua mt b lc, lc b cc tn s trn Fs/2. B lc ny c gi l lc chng chng ph (antialiasing filter) T tn s Fmax bit, ta c th chn tn s ly mu tng ng Fs > 2Fmax Vi tn s ly mu nh th ny, tt c cc thnh phn tn s ca tn hiu tng t c biu din di dng cc mu m khng b chng ph, v do vy, ta c th khi phc li tn hiu tng t t cc mu ri rc m khng b mo bng cch s dng mt phng php ni suy thch hp. Cng thc ni suy c trnh by trong nh l ly mu nh sau : Nu tn s cao nht trong tn hiu lin tc xa(t) l Fmax v tn hiu c ly mu vi tn s Fs>2Fmax th c th khi phc chnh xc xa(t) t cc mu ri rc xa(nT) bng cch s dng cng thc ni suy sau :

- 13 -

Chng I

x a (t) =

n =

(nT)

sin 2Fmax (t nT) 2Fmax (t nT)

Tn s ly mu Fs = 2Fmax c gi l tn s Nyquist (do Nyquist tm ra nm 1928)- l tn s ly mu nh nht trnh chng ph. Chng minh (xem SGK) V d 1.2 Cho tn hiu tng t :

x a (t) = 3cos50t+10sin300t-cos100t
Xc nh tn s Nyquist.

V d 1.3 Cho tn hiu tng t :

x a (t) = 3cos2000t+5sin6000t+10cos12000t
(a) Xc nh tn s Nyquist (b) Gi s tn hiu c ly mu vi tc 5000 (mu/s), tm tn hiu ri rc c c sau ly mu (c) Xc nh tn hiu tng t ya(t) khi phc t tn hiu ri rc (gi s ni suy l tng)

- 14 -

Chng I

1.5.3 Quan h gia ph ca tn hiu ri rc v ph ca tn hiu lin tc Ly mu tn hiu tng t xa(t), v mt ton hc chnh l:

x s (t) = x a (t).s(t)
Trong xs(t) l tn hiu sau ly mu, s(t) l dy xung vung tun hon chiu cao h, rng xung l , chu k l T v c 0, h1. Khai trin Fourier cho dy s(t) trn ri ly gii hn, ta c :

s(t) = lim

h 0 T k = h1

sin k

2 2 jk t T e jk T t = 1 e T T k = k T

Vy c th biu din tn hiu ri rc di dng sau :

x s (t) =

2 jk t 1 x a (t) e T T k =

T y ta tm c ph ca tn hiu ri rc theo cng thc bin i Fourier nh sau :

X s ( ) = =

x (t)e
s

jt

2 j( k )t 1 T dt = x a (t)e dt T k = k =

1 2 1 X a k = X a ( kFs ) T k = T T k =

T y ta c kt lun: ph ca tn hiu ri rc l xp chng tun hon ca ph ca tn hiu lin tc vi chu k l Fs. Nh vy vic ly mu tn hiu lin tc to ra mt dy mu ri rc trong min thi gian v ng thi cng c nh hng trong min tn s na. Hnh v 1.11a l ph 2 pha ca tn hiu gc cha ly mu v hnh v 1.11b l ph ca tn hiu ri rc c ly mu vi 3 tn s ly mu khc nhau, y W l bng thng ca tn hiu tng t- cng chnh l tn s cao nht Fmax Qua y ta thy cc ph ca tn hiu ri rc khc nhau khi ly mu vi cc tn s khc nhau. Nu ly mu vi tn s trn tn s Nyquist Fs 2Fmax = 2W th cc bn copy ca ph gc (gi l nh ph) khng b chng ln nhau. Lc ny ta c th khi phc li tn hiu gc ban u t tn hiu ri rc bng cch cho tn hiu ri rc i qua b lc thng thp tn s ct l Fmax = W. B lc ny c gi l b lc khi phc hay b lc nh ph (anti-imaging filter). Nu ly mu vi tn s thp hn tn s Nyquist th cc nh ph s b chng ln nhau, ph tng l ng nt t trn hnh 1.11b(iii), lc ny ta khng th khi phc li tn hiu gc ban u. Khi tn hiu l thng di ( W1 < F < W2 ), ta khng cn ly mu vi tn s gp i tn s ln nht. Thay vo , tn s ly mu ph thuc vo bng thng ca tn hiu W2 W1 cng nh - 15 -

Chng I

Hnh 1.11 Ph ca tn hiu gc v tn hiu ri rc Hnh 1.11 Ph ca tn hiu lin tc v tn hiu ri rc v tr ca ph trn trc tn s. Tn s ly mu t nht l gp i bng thng ca tn hiu. iu quan trng y l phi chn tn s ly mu sao cho hin tng chng ph khng xy ra. V d 1.4 Cho mt tn hiu lin tc c ph t 120-160 kHz. V ph 2 pha ca tn hiu ri rc c c bng cch ly mu tn hiu trn vi 3 tn s ly mu khc nhau sau y : (a) Fs = 80 kHz (b) Fs = 100 kHz (c) Fs = 120 kHz Tn s ly mu thch hp l bao nhiu trong 3 tn s trn ? Gii thch.

- 16 -

Chng I

1.5.4 Lng t ha tn hiu c bin lin tc Nh trnh by trn y, lng t ha chnh l bin i tn hiu ri rc c bin lin tc thnh tn hiu c bin ri rc bng cch biu din mi mu x(n) bng mt gi tr xq(n) chn t mt tp hu hn cc gi tr bin . Hnh 1.12 minh ha hot ng lng t ha. Qua y ta thy lng t ha gy ra li lng t, l sai khc gia gi tr lng t v gi tr thc s ca mu. Gi eq(n) l sai s lng t ha, ta c :

eq (n) = x q (n) x(n)

Xq(n) Mc lng t ha Bc lng t ha

Hnh 1.12 Minh ha s lng t ha V mt ton, lng t ha chnh l lm trn hay ct gt cc gi tr ca cc mu ri rc. Gi gi tr lng t ha l mc lng t ha, khong cch gia hai mc lng t ha cnh nhau l bc lng t ha , sai s lng t ha trong trng hp lm trn nm trong gii hn l:

eq (n) 2 2
x max x min L 1

Nu xmin v xmax l gi tr nh nht v ln nht ca x(n) v L l s mc lng t ha th :

Ta gi xmax xmin l di ng ca tn hiu v l phn gii. Lu rng khi di ng c nh th vic tng s mc lng t ha s lm gim kch thc bc lng t ha, li lng t ha gim v chnh xc trong chuyn i A/D tng ln. V l thuyt th lng t ha lun lm mt mt thng tin. L do l tt c cc mu c gi tr - 17 -

Chng I

nm trong di

x(n) < u c lng t ha thnh cng mt gi tr. 2 2

Cht lng ca tn hiu ra b chuyn i A/D c biu din bng t s tn hiu trn nhiu lng t ha SQNR (signal-to-quantization noise ratio) :

SQNR =

Px Pq

Trong Px l cng sut trung bnh ca tn hiu lin tc v Pq l cng sut trung bnh ca li lng t ha. Gi s ta xt lng t ha tn hiu sin lin tc chu k T0. Cng sut trung bnh ca tn hiu l :

1 0 2 A2 Px = (Acos t) 2 dt = T0 T0 2 0
Nu ly mu ng vi nh l ly mu th lng t ha l qu trnh duy nht gy ra li trong chuyn i A/D. Do , ta c th tnh li lng t ha bng cch lng t ha tn hiu xa(t) thay cho tn hiu ri rc x(n). Tn hiu xa(t) hu nh l tuyn tnh trong khong gia hai mc lng t ha cnh nhau. Li lng t ha l :

eq (t) = x a (t) x q (t)

nh ch ra trong hnh 1.13.
xa(t) eq(t) /2 -/2

Hnh 1.13 Li lng t ha trong trng hp lng t ha tn hiu sin Cng sut li Pq c tnh l:

1 1 2 2 Pq = eq (t)dt = eq (t)dt 0 2
V eq (t) = ( / 2 ) t, t nn ta c:

1 2 2 Pq = t dt = 0 2 12
Nu b lng t ha c b bit v di ng l 2A th = 2A / 2b . Do :

A2 / 3 Pq = 2b 2
- 18 -

Chng I

Nh vy SQNR tnh theo dB l:

P SQNR(dB) = 10log10 x Pq
V d 1.5

3 b = 10log10 ( .2 ) = 6.02b + 1.76 2

Qua y ta thy khi tng s bit thm 1 th SQNR tng thm 6dB Lng t ha tn hiu tng t in p t -5V n 5V dng 3 bit. Xc nh gi tr lng t ha v li lng t ha cho cc mu sau: (a) -3.4V (b) 0V (c) 0.625V

1.5.6 M ha cc mu lng t ha Qu trnh m ha s gn cho mi mu lng t ha mt s nh phn. Nu ta c L mc lng t ha, ta cn t nht L s nh phn. Vi t m di b bit ta c 2b s nh phn khc nhau. Nh vy yu cu:

b log 2 L
Ni chung, tc ly mu cng cao v phn gii lng t ha cng cao (b ln) th thit b chuyn i A/D cng t tin. Trong thc t, qu trnh lng t ha v m ha gp chung li thnh mt. Hnh 1.14 trnh by b chuyn i A/D thc t. - 19 -

Chng I T/h tng t xa(t) Lc chng chng ph Lng t ha & M ha T/h ri rc x(n) T/h s 010011...

Ly mu

Hnh 1.14 B chuyn i A/D thc t 1.6 BIN I S - TNG T (D/A) Trong mt s trng hp, c th dng trc tip tn hiu s sau x l. Tuy nhin, hu ht cc ng dng u yu cu phi chuyn i tn hiu s sau x l tr li thnh tn hiu tng t. B chuyn i s-tng t (D/A) c trnh by trn hnh 1.15. Trc tin, mt mch s thc hin chuyn i cc t m b bit thnh cc mc tng t tng ng. Cc mc ny c duy tr trong khong 1 chu k ly mu nh b gi mu bc 0 (cn gi l ZOH-Zero Order Hold). Tn hiu ra ca ZOH c dng bc thang, cc sn nhn ca tn hiu bc thang cha cc tn s cao. Cc tn s cao ny c loi b nh mt b lc khi phc. B lc ny chnh l b lc loi b cc nh ph to ra do ly mu.
T/h s 010011... i thnh mc tng t Gi mu bc 0 (ZOH) Lc khi phc T/h bc thang T/h tng t xa(t)

Hnh 1.15 B chuyn i D/A Hnh 1.16 minh ha qu trnh chuyn i D/A 3 bit.

Hnh 1.15 Chuyn i D/A Hnh 1.16 Chuyn i D/A 3 bit

- 20 -

Chng II

Chng

TN HIU & H THNG RI RC

Ni dung chnh chng ny l: Gii thiu cc tn hiu ri rc c bn Cc php ton trn tn hiu ri rc Phn loi tn hiu ri rc Biu din h thng ri rc Phn loi h thng ri rc H thng ri rc tuyn tnh bt bin Tng chp ri rc Phng trnh sai phn tuyn tnh h s hng Cu trc h ri rc tuyn tnh bt bin

2.1 TN HIU RI RC Nh trnh by trong chng I, tn hiu ri rc x(n) c th c to ra bng cch ly mu tn hiu lin tc xa(t) vi chu k ly mu l T. Ta c:
x a (t)
t = nT

= x a (nT) x (n ), < n <

Lu n l bin nguyn, x(n) l hm theo bin nguyn, ch xc nh ti cc gi tr n nguyn. Khi n khng nguyn, x(n) khng xc nh, ch khng phi bng 0. Trong nhiu sch v x l tn hiu s, ngi ta quy c: khi bin nguyn th bin c t trong du ngoc vung v khi bin lin tc th bin c t trong du ngoc trn. T y tr i, ta k hiu tn hiu ri rc l: x[n]. Cng nh tn hiu lin tc, c th biu din tn hiu ri rc bng hm s, bng th, bng bng. Ngoi ra, ta cn c th biu din tn hiu ri rc di dng dy s, mi phn t trong dy s l mt gi tr ca mu ri rc. V d: Cho tn hiu ri rc sau:
1, n = 1,3 x[n ] = 4, n = 2 0, n

Biu din tn hiu trn di dng bng, th, dy s

- 21 -

Chng II

2.1.1 Mt s tn hiu ri rc c bn 1. Tn hiu bc nhy n v (Discrete-Time Unit Step Signal) 1, n 0 u[n] = 0, n < 0

Tn hiu bc nhy dch chuyn c dng sau:

1, n n0 u[n n0 ] = 0, n < n0

2. Tn hiu xung n v (Discrete-Time Unit Impulse Signal) 1, n = 0 [ n] = 0, n 0

Tn hiu xung dch chuyn c dng sau:

[n n0 ] =

1, n = n0 0, n n0

- 22 -

Chng II

So snh tn hiu bc nhy v xung n v lin tc v ri rc, ta thy c mt s im khc nhau, c trnh by trong bng 2.1. Continuous time Discrete time u (t ) =
t

( )d

u[n] =

k =

[k ]

d (t ) dt u (t ) x(t ) (t t0 ) = x(t0 ) (t t0 )

[n] = u[n] u[n 1]

x[n] [n n0 ] = x[n0 ] [n n0 ]
n =

x(t ) (t t0 )dt = x(t0 )

x[n] [n n ] = x[n ]
0 0

Bng 2.1 Tn hiu bc nhy v xung n v lin tc v ri rc 3. Tn hiu dc n v (Discrete-Time Unit Ramp Signal )

n , n 0 r[n ] = 0, n < 0

4. Tn hiu hm m (Discrete-Time Exponential Signal )

x[n ] = a n

2.1.2 Cc php ton trn tn hiu ri rc 1. Php o thi gian

y[n] = x[m] m = n = x[ n]

R rng, php o ny c thc hin bng cch o tn hiu qua trc tung.
- 23 -

Chng II

2. Php thay i thang thi gian

y[n] = x[m] m = an = x[an]

Php ton ny cn gi l php thay i tn s ly mu. Yu cu a y phi tho mn cc iu kin sau: Nu a > 1 th php ton c gi l tng tn s ly mu (nn tn hiu), yu cu a phi nguyn.
V d: a = 2

Nu a < 1 th php ton c gi l gim tn s ly mu (gin tn hiu), yu cu a = 1/K, vi K l s nguyn.

V d: a = . Tm z[n] = b[n/2]
n z[n] b[ n ] 2

0 1 2 3

z[0] b[0] z[1] ?? z[2] b[1] z[3] ??

Cc gi tr b[1/2] v b[3/2] khng xc nh c, vy lm th no xc nh z[1] v z[3]? Gii php c chn l ni suy. C nhiu cch ni suy khc nhau, trong cch n gin l ni suy tuyn tnh nh sau:
- 24 -

Chng II

b[n/ 2], n even z[n] = 1/ 2 {b[(n 1) / 2] + b[(n + 1) / 2]} , n odd

Ni suy tuyn tnh l m bo yu cu cht lng i vi cc thut ton nn n gin. i vi cc phng php nn s liu cht lng cao, ngi ta s dng nhng phng php ni suy khc phc tp hn.
3. Php dch thi gian

y[n] = x[m] m = n n = x[n n0 ]

0

y y[n] l bn dch thi gian ca tn hiu gc x[n]

V d: Cho x[n] = a n u[n] , | a |< 1 , tm v v y[n] = x[n 3]

Trong nhiu trng hp, yu cu ta phi kt hp cc php ton trn, chng hn nh kt hp php o vi php dch thi gian, kt hp php o, dch vi thay i thang thi gian. Xem cc v d minh ha sau y:
V d:

V th tn hiu u[3-n]

- 25 -

Chng II

V d:

Cho x[n] = 2u[n + 2] . Tm z[n] = x[3 2n] .

n z[n] x[3 2n] 0 z[0] x[3] 1 z[1] x[1] 2 z[2] x[1] 1 z[1] x[5] 2 z[2] x[7]

V d: Cho y[n] = a nu[n] , where a > 1 . Tm z[n] = y[2n + 2] .

- 26 -

Chng II

4. Php thay i bin tn hiu

Cho y[n] = Ax[n] + B , nu A < 0 , ta o ngc bin ca tn hiu; | A | iu khin thang bin v B iu khin dch chuyn bin , dch tn hiu ln trn (B>0) hay xung di (B<0). Ngoi ra, ta c cc php thay i bin khc nh tm bin v pha ca tn hiu phc, cng v nhn 2 tn hiu vi nhau. Lu cc php thay i bin yu cu cc tn hiu phi c t cng gc thi gian.
V d:

Tm x[n] = (u[n + 1] u[n 5])(nu[2 n])

2.1.3 Phn loi tn hiu ri rc 1. Tn hiu chn v tn hiu l (even and odd signals)

Mt tn hiu ri rc c th biu din di dng tng ca mt tn hiu chn v mt tn hiu l nh sau: x[n] = xe [n] + xo [n] Trong Even : xe [n] = xe [n] Odd : xo [n] = xo [ n] xe [n] = 1 ( x[n] + x[n]) 2 xo [n] = 1 ( x[n] x[ n]) 2 x[n] = xe [n] + xo [n]
2. Tn hiu tun hon v tn hiu khng tun hon

Nh trnh by trong mc 1.4.2, tn hiu tun hon l tn hiu tha mn iu kin sau: x[n+N] = x[n] vi mi n Gi tr N nh nht gi l chu k c bn ca tn hiu.
V d:

Cc tn hiu sau l tun hon hay khng tun hon? Nu tn hiu tun hon, xc nh chu k c bn. - 27 -

Chng II (a) x1[ n] = e

j n 6

(b) x2 [ n] = sin( 35 n + 1)

(c) x3 [ n] = cos(2n )

(d) x4 [ n] = cos(1.2 n)

(e) x5 [ n] = e

n 3

3. Tn hiu nng lng v tn hiu cng sut

Nng lng ca tn hiu: E= Cng sut trung bnh ca tn hiu:

n =

x[n]

P = lim

N 1 2 N x[n ] N 2 N + 1 n =

- 28 -

Chng II

Nu tn hiu c nng lng hu hn, tn hiu c gi l tn hiu nng lng. Nu tn hiu c nng lng v hn v c cng sut trung bnh hu hn, tn hiu c gi l tn hiu cng sut.
V d:

Trong cc tn hiu sau y, u l tn hiu nng lng? u l tn hiu cng sut? (a) Tn hiu bc nhy n v

(b) Tn hiu dc n v

(1 / 2) n , n 0 (c) Tn hiu x[n ] = n (2) , n < 0

(d) Tn hiu x[n ] = cos n (u[n ] u[n 4]) 4

2.2 H THNG RI RC

Nh trnh by trong chng I, h thng ri rc l thit b/ thut ton x l tn hiu ri rc. N bin i tn hiu ri rc u vo thnh tn hiu ri rc u ra khc u vo nhm mt mc ch no . Tn hiu ri rc u vo gi l tc ng (excitation) v tn hiu ri rc u ra gi l p ng (response) Quan h u vo v u ra nh sau: y[n ] = T( x[n ]) vi T l k hiu cho mt ton t hoc l mt qu trnh x l ca h thng.
2.2.1 Biu din h thng ri rc

- 29 -

Chng II

C nhiu cch biu din h ri rc khc nhau, trong nhiu min khc nhau. Trong min thi gian, ta c cc cch biu din h ri rc sau y:
1. Biu din vo-ra

Trong cch biu din ny, ta gi s h ri rc l mt hp en, khng bit hoc l i cu trc bn trong ca n. Quan h vo-ra l quan h gia x[n] v y[n] c m t bng mt phng trnh ton. t vo u vo mt tn hiu x[n] c th, cn c vo phng trnh ta s tm c u ra tng ng.
V d:

y[n] = x[n] + x[n-1]

2. Biu din bng p ng i vi mt tc ng c th

Trong cch biu din ny, ta cho u vo l mt tn hiu c th v tm u ra. u ra hon ton c trng cho mt h thng c th. C 2 loi p ng c dng ph bin l p ng xung (impulse response)- l p ng i vi u vo l xung n v v p ng bc (step response)- l p ng i vi u vo l tn hiu bc nhy n v.
V d:

Cho h thng c quan h vo-ra l: y[n]= x[n] + x[n-1]. Tm p ng xung v p ng bc

3. Biu din bng s

Trong nhiu trng hp, bit c cu trc ca h ri rc, ta biu din h ri rc bng s khi/ cu trc. Trong mn hc ny, ta xt mt s khi c bn sau: khi tr, khi nhn vi hng s, khi cng 2 tn hiu. Ta c th kt ni cc khi ny vi nhau to nn cc h thng phc tp.

V d:

S dng cc khi c bn k trn, v s khi h thng c quan h vo-ra sau: - 30 -

Chng II

y[n ] =

1 1 1 y[n 1] + x[n ] + x[n 1] 4 2 2

Ta cng c th kt ni cc h con li vi nhau to thnh cc h ln hn. C 3 cch kt ni chnh l: ni tip, song song v hi tip (dng/ m)

2.2.2 Phn loi h ri rc 1. H c nh v khng nh

H khng nh l h c tn hiu ra thi im n0 ch ph thuc vo tn hiu vo cng thi im n0 :

y[n0 ] = f ( x[n0 ])
Ngc li, h c nh c tn hiu ra ph thuc vo tn hiu vo cng thi im v cc thi im khc nhau.
V d:

Cc h sau l c nh hay khng nh? (a) y[n] = x[n] + 5 (b) y[n] = (n + 5) x[n]
- 31 -

Chng II

(c) y[n] = x[n + 5]

2. H kh o v khng kh o

H kh o l h m ta c th mc ni tip n vi mt h khc c tn hiu ra trng vi tn hiu gc ban u:

Ti [T ( x[n])] = x[n]
V d:

(a)

T : y[n] = x[n + 1] Ti : x[n] = y[n 1]

(b)
T : y[n] =
n

k =

x[k ]

Ti : x[n] = y[n] y[n 1] (c) B chnh lu y[n] =| x[n] | khng phi l mt h kh o.

3. H nhn qu v khng nhn qu

H nhn qu l h c y[n] ti n = n0 ch ph thuc vo x[n] vi n n0 . Ni cch khc, tn hiu ra khng ph thuc vo cc gi tr vo tng lai m ch ph thuc vo cc gi tr vo trong qu kh v hin ti.
A causal system does not laugh before it is tickled

Hu ht cc h vt l u nhn qu, nhng c th c h vt l khng nhn qu- chng hn nh x l nh trn my tnh. H khng nh l h nhn qu nhng iu ngc li khng ng.
V d:

Xt tnh nhn qu ca cc h sau: (a) y[n ] = x[n ] x[n 1] (b) y[n ] =

n

k =

x[k ]

(c) y[n ] = x[2n ] (d) y[n ] = x[n ] + 3x[n + 4]

4. H n nh BIBO (Bounded-Input Bounded-Output ) v khng n nh

H n nh l h c tn hiu ra hu hn khi tn hiu vo hu hn Nu vo l x[n] B1 ,n th ra l y[n ] B 2, n Reasonable (well-behaved) inputs do not cause the system output to blow up

- 32 -

Chng II

V d:

Xt tnh n nh BIBO ca cc h sau:

(a) y[ n] = x[n 1] (b) y[ n] = cos( x[n]) (c) y[ n] =

k =

x[k ]

5. H tuyn tnh v khng tuyn tnh

H tuyn tnh l h tha mn nguyn l xp chng: T [ x1[n]] = y1[n] and T [ x2 [n]] = y2 [n] T [ax1[n] + bx2 [n]] = ay1[n] + by2 [n]
V d:

Xt tnh tuyn tnh ca cc h sau y: (a) y[n ] = nx[n ]

(b) y[n ] = x[n 2 ]

(c) y[n ] = x 2 [n ]

(d) y[n ] = Ax[n ] + B

6. H bt bin v khng bt bin

- 33 -

Chng II

H bt bin: khi tn hiu vo b dch mt khong thi gian th tn hiu ra cng b dch i cng khong thi gian : T [ x[n]] = y[n] T [ x[n n0 ]] = y[n n0 ]
V d:

Xt tnh bt bin ca cc h sau y: (a) y[n] = x[2n]

(b) y[n] =

k =

x[k ]

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

k =0

(d) y[n] = nx[n]

(e) y[n] = x[n]u[n]

- 34 -

Chng II

2.3 H RI RC TUYN TNH BT BIN

Ta s xt mt trng hp quan trng- l h ri rc va tuyn tnh va bt bin, gi tt l h LTI (Linear Time-Invariant Systems)
2.3.1 p ng xung ca h LTI- Tng chp

Ta c th m t tn hiu ri rc x[n] di dng sau: x[n] = + x[1] [n + 1] + x[0] [n] + x[1] [n 1] + x[2] [n 2] + vit gn li l: x[n] =

k =

x[k ] [n k ]

Phng trnh ny biu din x[n] l tng ca cc hm xung dch thi gian, c bin thay i vi trng s x[k ] .
V d:

n 5 3 2 1 1 , 2 n 4 6 x[n ] = 4 = [n + 2] + [n + 1] + [n ] + [n 1] + [n 2] + [n 3] 4 4 4 4 4 0, n H ta xt l h tuyn tnh nn p ng i vi x[n] l tng ca cc p ng i vi [n k ] vi trng s x[k ] . Gi p ng ca h i vi [n k ] l hk [ n ] - l p ng xung. Ta c:

x[n] = y[n] =
k =

x[k ] [n k ] x[k ]h [n]

k

k =

Do h l bt bin nn ta c: hk [n] = h[n k ] Vy:

y[n] = =
k =

x[k ]h [n]
k

k =

x[k ]h[n k ]

K hiu nh sau: y[n] = x[n] h[n] =

k =

x[k ]h[n k ]

Ta gi y l tng chp tuyn tnh ri rc (DT linear convolution). Vy u ra ca h LTI l u vo chp vi p ng xung. Cn c vo chiu di ca p ng xung, ta c th chia h ri rc thnh 2 loi: h c p ng xung di hu hn FIR (Finite-duration Impulse Response) v h c p ng xung di v hn IIR (Infinite-duration Impulse Response) - 35 -

Chng II

2.3.2 Cch tnh tng chp

Thay m = n k , hay k = n m , vo phng trnh trn, ta c:

n m =

x[n m]h[m] =

m =

h[m]x[n m] =

m =+

h[m]x[n m] =

m =

h[m]x[n m] = h[n] x[n] = x[n] h[n]

Nh vy, tn hiu vo v p ng xung c th thay th cho nhau m khng nh hng n u ra h thng.

Cc bc tnh tng chp:

1. Vit x[n] thnh x[k ] , h[n] thnh h[k] 2. o thi gian h[k ] v dch i n to thnh h[n k ] 3. Nhn x[k ] v h[n k ] vi mi k. 4. Cng x[k ]h[n k ] vi mi k c y[n] Lp li nh vy vi mi n
Hai nguyn tc quan trng tnh tng chp:

1. Thc hin o thi gian cho tn hiu n gin hn 2. V th

V d:

Tm x[n] h[n] = y[n] vi x[n] = u[n + 1] u[n 3] + [n] v h[n] = 2 ( u[n] u[n 3]) .

Lu : N y = N x + N h 1 , vi N i l chiu di ca i[n] . V d:

- 36 -

Chng II

Tm x[n] [n n0 ] y l php chp mt tn hiu ri rc vi xung n v, kt qu l tn hiu ri rc b dch chuyn n v tr ca xung n v.

V d:

Tm y[n] = x[n] h[n] trong x[n] = a n u[n] v h[n] = u[n] Lm theo 2 cch: o x[n] v o h[n]

- 37 -

Chng II

V d:

Tm y[n] = u[n] a n u[n 2]

- 38 -

Chng II

Ngoi cch tnh tng chp bng th, ta cn c th tnh da vo cng thc tng chp.
V d:

Cho x[n] = h[n] = u[n] . Tm y[n] = x[n] h[n] Ta c: y[n] =

k =

x[k ]h[n k ] =

k =

u[k ]u[n k ]

u[n k ] since u[k ] = 0, k < 0

k =0 n

Ta cng c: u[n k ] = 0, n k < 0 or k > n y[n] = (1) = n + 1

k =0

Nhng: u[k ] = 0, k < 0 and u[n k ] = 0, k > n 0 k n n 0.

V d:

Cho x[n] = b nu[n] v h[n] = a n u[n + 2] , vi a b Tm y[n] = x[n] h[n] .

- 39 -

Chng II

V d:

Chng minh rng khi cho tn hiu x[n] = u[n] i qua h thng LTI c p ng xung l: h[n] = a n u[n 2], a < 1 th tn hiu ra l: a2 an u[2 n] + u[n 3] 1 a 1 a

- 40 -

Chng II

V d:

Cho x[n] = u[n + 2] v h[n] = a n u[n] , tm y[n] = x[n] h[n]

- 41 -

Chng II

2.3.2 Cc tnh cht ca tng chp 1. Tnh cht giao hon

x[n ] h[n ] = h[n ] * x[n ] Tnh cht ny c chng minh trong 2.3.2
2. Tnh cht kt hp

( x[n ] * h 1[n ]) * h 2 [n ] = x[n ] * (h 1[n ] * h 2 [n ]) V tri y chnh l tn hiu ra trong trng hp: x[n] l u vo ca h p ng xung h1[n], u ra y1[n] l u vo ca h c p ng xung h2[n]. y chnh l 2 h mc ni tip. V phi y chnh l tn hiu ra trong trng hp x[n] l u vo ca h c p ng xung l h1[n]*h2[n]. Nh vy, hai h mc ni tip s c p ng xung l chp ca hai p ng xung thnh phn. Hn na, t tnh cht giao hon ta thy c th i ch 2 h mc ni tip cho nhau m khng lm thay i quan h vo-ra chung ca h tng qut

3. Tnh cht phn phi

x[n ] * (h 1[n ] + h 2 [n ]) = x[n ] * h 1[n ] + x[n ] * h 2 [n ]

V tri l tn hiu ra khi x[n] c a vo h c p ng xung l h1[n]+h2[n]. V phi l tn hiu ra tng ca 2 tn hiu ra khi x[n] ng thi c a vo 2 h c p ng xung h1[n] v h2[n]. y chnh l 2 h mc song song. Nh vy, hai h mc song song s c p ng xung l tng ca 2 p ng xung thnh phn.

2.3.3 Cc tnh cht ca h LTI

Quan h vo- ra (I/O) ca h LTI hon ton c th c c trng bi p ng xung h[n] . Suy ra, ta c th bit c cc tnh cht ca h LTI da vo h[n]
1. Tnh c nh

p ng xung ca h khng nh ch c th c dng sau:

h[n] = K [n].
2. Tnh kh o

H LTI c p ng xung h[n] l kh o nu tn ti mt hm hi [n] sao cho: - 42 -

Chng II

h[n] hi [n] = [n]

V d:

Tm h o ca h h[n] = 3 [n + 5]

3. Tnh nhn qu

Nu ta c h[n] = 0, n < 0 th y[n] =

k =

x[k ]h[n k ] = x[k ]h[n k ]

k =

ch ph thuc vo cc gi tr qu kh v hin ti ca tn hiu vo.

V d:

Xt tnh nhn qu ca cc h sau y: (a) h[n] = u[n]

(b) h2 [n] = u[n + 2]

4. Tnh n nh

Tnh n nh tha mn nu:

k =

h[k ] <

Ngha l p ng xung phi tho iu kin kh tng tuyt i. L do y l: Vi | x[n] | M vi mi n , ta c: | y[n] |=|

k =

x[n k ]h[k ] |

k =

| x[n k ]h[k ] |=

k =

| x[n k ] || h[k ] |

- 43 -

Chng II

k =

M | h[k ] |= M | h[k ] |
k =

V M < nn h n nh BIBO ta ch cn:

V d:
n

k =

| h[k ] |<

1 h[n] = u[n] c n nh BIBO khng? 3

V d:

Xt cc c im ca cc h sau y: (a) h1[n] = u[n] (an accumulator)

(b) h2 [n] = 3n u[n]

(c) h3 [n] = (3) n u[n]

(d) h4 [n] = cos( n)u[n] 3

(e) h5 [n] = u[n + 2] u[n]

- 44 -

Chng II

2.3.4 p ng bc

p ng bc l p ng ca h i vi tc ng l tn hiu bc nhy n v, k hiu p ng bc l s[n]

x[n] = u[n] s[n] =
k =

h[k ]u[n k ] = h[k ]

k =

Ta c th c h[n] t s[n] nh sau:

h[n] = s[n] s[n 1]

V d:
a p ng bc ca h h[n] = a n u[n] l s[n] = u[n] a n u[n] = 1 a u[n] 1
n+1

T p ng bc ta c th tnh c p ng xung:

u[n 1] = u[n] [n] .

Bng sau tm tt v cc mi quan h, cc loi p ng trong hai h lin tc v ri rc
Continuous Time u (t ) = ( )d
t

Discrete Time u[n] = s[n] =

k = n

[k ]

s (t ) = h( )d = h(t ) u (t )

k =

h[k ] = h[n] u[n]

(t ) =

d u (t ) dt d h(t ) = s (t ) dt

[n] = u[n] u[n 1]

h[n] = s[n] s[n 1]

2.4 H RI RC LTI M T BI PHNG TRNH SAI PHN Ni chung, h ri rc LTI c th c c trng hon ton bi tng chp tuyn tnh. Hn na, cng thc tng chp cng cung cp cho ta mt phng tin thc hin h thng. Vi h FIR, thc hin h ta cn cc khu cng, nhn v mt s hu hn cc b nh. Nh vy c th thc hin trc tip h FIR t cng thc tng chp. Tuy nhin vi h IIR, ta khng th thc hin h thng thc t da vo tng chp c, v n yu cu mt s lng v hn cc khu cng, nhn v nh. Thc t, c mt cch biu din h ri rc khc ngoi tng chp. l biu din bng phng trnh sai phn. 2.4.1 Dng tng qut ca phng trnh sai phn Ta bit tn hiu ra ca h thng ph thuc vo tn hiu vo v c th ph thuc vo chnh tn hiu ra: y[n ] + a 1 y[n 1] + ... + a N y[n N] = b 0 x[n ] + b1 x[n 1]] + ... + b M x[n M ] a k y[n k ] = b r x[n r ], a 0 = 1
k =0 r =0 N M

- 45 -

Chng II

y l phng trnh m t quan h vo-ra ca h tuyn tnh bt bin nn cc h s ca phng trnh l hng s v phng trnh c tn gi l phng trnh sai phn tuyn tnh h s hng (Linear constant-coefficient difference equation) Cn c vo phng trnh, ta phn h ri rc LTI ra 2 loi:
1. H khng quy:

Bc N = 0, tn hiu ra ch ph thuc vo tn hiu vo

2. H quy:

Bc N > 0, tn hiu ra ph thuc vo tn hiu vo v vo chnh tn hiu ra cc thi im trc 2.4.2 Gii phng trnh sai phn tuyn tnh h s hng V c bn, mc ch ca gii phng trnh l xc nh tn hiu ra y[n], n 0 ca h thng ng vi mt tn hiu vo c th x[n], n 0 v ng vi cc iu kin ban u c th no . Nghim ca phng trnh l tng ca 2 phn: y[n ] = y 0 [n ] + y p [n ] Trong y0[n] l nghim tng qut ca phng trnh thun nht v yp[n] l nghim ring. Nghim tng qut y0[n] l nghim ca phng trnh v phi bng 0, tc l khng c tn hiu vo. Dng tng qut ca y0[n] l: y 0 [n ] = C11 + C 2 2 + ... + C N N Trong i l nghim ca phng trnh c trng:

a
k =0

ni k

v Ci l cc h s trng s, c xc nh da vo iu kin u v tn hiu vo. Nghim ring yp[n] l mt nghim no tha phng trnh sai phn trn vi mt tn hiu vo c th x[n], n 0 . Ni cch khc, yp[n] l mt nghim no ca phng trnh:

a k y[n k ] = b r x[n r], a 0 = 1

k =0 r =0

Ta tm yp[n] c dng ging nh dng ca x[n], chng hn nh: x[n] yp [n]

A A.M n A n .n M A cos 0 n A sin 0 n

V d:

K K.M n A n (K 0 n M + K1n M 1 + ... + K M ) K1 cos 0 n + K 2 sin 0 n

Tm nghim tng qut y[n ], n 0 ca phng trnh:

- 46 -

Chng II

y[n ] + a 1 y[n 1] = x[n ]

vi x[n] l tn hiu bc nhy v y[-1] l iu kin u. Cho x[n] = 0, nghim tng qut y0[n] lc ny c dng: y 0 [n ] = n Gii ra ta c:
= a 1

Do vy, y0[n] l: y 0 [ n ] = C( a 1 ) n Do x[n] l tn hiu bc nhy n v nn chn yp[n] c dng: y p [n ] = Ku[n ] y K l mt h s, c xc nh sao cho phng trnh tha mn. Thay yp[n] vo phng trnh trn ta c:
Ku[n ] + a 1Ku[n 1] = u[n ]

xc nh K, ta tnh vi n 1 v trong di khng c s hng no b trit tiu. Vy, K + a 1K = 1 K= Nh vy, nghim ring ca phng trnh l: y p [n ] = Nghim tng qut ca phng trnh trn l: y[n ] = y 0 [n ] + y p [n ] = C(a 1 ) n + C c xc nh sao cho tha mn iu kin ban u. Cho n = 0, t phng trnh ta c:
y[0] + a 1 y[1] = 1 y[0] = a 1 y[1] + 1

1 1 + a1

1 u[n ] 1 + a1 1 , n0 1 + a1

Mt khc, kt hp y[0] va tm c vi nghim tng qut ca phng trnh, ta c: y[0] = C + a 1 = a 1 y[1] + 1 C = a 1 y[1] + 1 1 + a1 1 + a1 1 (a 1 ) n +1 , n0 1 + a1

Thay C vo nghim y[n] ta c kt qu cui cng nh sau: y[n ] = (a 1 ) n +1 y[1] + = y zi [n ] + y zs [n ] Ta nhn thy nghim ca phng trnh gm c hai phn: - 47 -

Chng II

1. yzi[n] l p ng u vo 0 (zero-input response) ca h thng. p ng ny ch ph thuc vo bn cht ca h thng v cc iu kin ban u. V vy n cn c tn gi l p ng t do (free response). 2. yzs[n] ph thuc vo bn cht ca h thng v vo tn hiu vo, do n cn c gi l p ng cng bc (forced response). N c xc nh khi khng n iu kin u hay l iu kin u bng 0. Khi iu kin u bng 0, ta c th ni h thng trng thi 0. Do vy, yzs[n] cn c gi l p ng trng thi 0 (zero-state response)

Qua y ta cng thy: C ph thuc vo c iu kin u v tn hiu vo. Nh vy, C nh hng n c p ng u vo 0 v p ng trng thi 0. Ni cch khc, nu ta mun ch c p ng trng thi 0, ta gii tm C vi iu kin u bng 0. Ta cng thy rng c th tm nghim ring ca phng trnh t p ng trng thi 0: y p [n ] = lim y zs [n ]
n

V d:

Tm y[n ], n 0 ca h sau:

y[n ] 3y[n 1] 4 y[n 2] = x[n ] + 2 x[n 1]

vi x[n] = 4n u[n] v cc iu kin u bng 0.

- 48 -

Chng II

2.4.3 Thc hin h ri rc LTI

T phng trnh m t quan h vo-ra ta thy thc hin h LTI, ta cn cc khu nhn, tr v cng. C nhiu cch khc nhau thc hin h ri rc, y ta xt cch trc tip- l cch thc hin trc tip da vo phng trnh sai phn m khng qua mt php bn i no
1. Dng chun tc 1

y[n ] + a 1 y[n 1] + ... + a N y[n N] = b 0 x[n ] + b1 x[n 1]] + ... + b M x[n M ] y[n ] = b 0 x[n ] + b1x[n 1]] + ... + b M x[n M ] + (a 1 ) y[n 1] + ... + (a N ) y[n N]

2. Dng chun tc 2

thy dng chun tc 1, h thng gm 2 h mc ni tip. Theo tnh cht giao hon ca tng chp th th t cc h con mc ni tip c th thay i c. Do vy, ta c th thay i h dng 1 thnh:

- 49 -

Chng III

Chng

PHN TCH H RI RC LTI DNG PHP BIN I Z

Php bin i Z l mt cng c quan trng trong vic phn tch h ri rc LTI. Trong chng ny ta s tm hiu v php bin i Z, cc tnh cht v ng dng ca n vo vic phn tch h ri rc LTI. Ni dung chnh chng ny l: Php bin i Z Php bin i Z ngc Cc tnh cht ca php bin i Z Phn tch h ri rc LTI da vo hm truyn t ng dng bin i Z gii phng trnh sai phn

2.1 PHP BIN I Z (Z-Transform) Php bin i Z l bn sao ri rc ha ca php bin i Laplace. Laplace transform : F ( s ) = z -transform : F ( z ) =

f (t )e st dt f [ n] z n

n =

Tht vy, xt tn hiu lin tc f (t ) v ly mu n, ta c:

f s (t ) = f (t ) (t nT ) =
n =

n =

f (nT ) (t nT )

Bin i Laplace ca tn hiu ly mu (cn gi l ri rc) l:

L[ f s (t )] = f (nT ) (t nT ) e st dt = f (nT ) (t nT )e st dt n = n =

n =

f (nT )
sT

(t nT )e st dt =

n =

f (nT )e snT

Cho f [n] = f (nT ) v z = e , ta c:

F ( z) =

n =

f [ n] z n

F ( z )|z =esT = f [n]e sTn

n =

= f (nT )e snT
n =

= L[ f s (t )]

Nh vy, bin i Z vi z = e sT chnh l bin i Laplace ca tn hiu ri rc.

3.1.1 nh ngha php bin i Z - 50 -

Chng III Nh va trnh by trn, php bin i Z hai pha (bilateral Z-Transform) ca h[n] l: H ( z ) = Z [ h[n]] =

n =

h[n]z

Ta cng c nh ngha php bin i Z mt pha (unilateral Z-transform ) l:

H ( z ) = h[n]z n .
n=0

Php bin i Z hai pha c dng cho tt c tn hiu, c nhn qu v khng nhn qu. Theo nh ngha trn ta thy: X(z) l mt chui lu tha v hn nn ch tn ti i vi cc gi tr z m ti X(z) hi t. Tp cc bin z m ti X(z) hi t gi l min hi t ca X(z)k hiu l ROC (Region of Convergence ). Ta s thy c th c nhng tn hiu khc nhau nhng c bin i Z trng nhau. im khc bit y chnh l min hi t. Ta cn lu n hai khi nim lin quan n bin i Z- l im khng (zero) v im cc (pole). im khng l im m ti X(z) = 0 v im cc l im m ti X(z) = . Do ROC l tp cc z m X(z) tn ti nn ROC khng bao gi cha im cc.
V d:

Tm bin i Z, v ROC v biu din im cc-khng:

x1[n] = a nu[n] and

x2 [n] = (a n )u[ n 1]

Ta thy hai tn hiu khc nhau trn c bin i Z trng nhau nhng ROC khc nhau.
- 51 -

Chng III
3.1.2 Min hi t ca php bin i Z 1. x[n] lch phi x[n] = 0, n < n0

X ( z) =

n = n0

x[n]z

X ( z) =

n = n0

1 x[n] z

Khi n , cn (1/z ) n 0 tng hi t. Nh vy, iu kin hi t s tha vi cc gi tr ca z nm ngoi ng trn i qua im cc xa gc nht, ngha l | z |> rmax .

2. x[n] lch tri x[n] = 0, n > n0

X ( z) =
n

n =

x[n]z

n0

Khi n , cn (1/z ) 0 hay z 0 tng hi t. Vy ROC l min nm trong ng trn i qua im cc gn gc nht, ngha l | z |< rmin

Lu trong trng hp tn hiu x[n] = 0 vi n > n0 > 0 nhng x[n0 ] 0 , ROC khng cha im 0. Chng hn nh vi x[n] = u[n + 1] th X ( z) =

n =

z n = z 1 + z n
n=0

khng hi t z = 0 nn z = 0 khng nm trong ROC.

3. Tn hiu x[n] lch hai pha

ROC c dng:
r1 < z < r2 (hnh vnh khn hoc rng)

4. Tn hiu x[n] di hu hn

ROC l ton b mt phng z ngoi tr z = 0 v/hoc z = - 52 -

Chng III

[n 1] z ,| z |> 0
1

[n + 1] z,| z |<
V d:

Tm bin i Z v ROC ca: x[n] = a|n| where | a |< 1 .

V d:

Tm bin i Z v ROC ca: x[n] = 3n u[n 1] + 4n u[n 1].

- 53 -

Chng III
V d:

Tm bin i Z v ROC ca:

1 2

[n 1] + 3 [n + 1]

V d:

Tm bin i Z ca: h[n] = (.5) n u[n 1] + 3n u[ n 1]. H biu din bng p ng xung nh trn c n nh BIBO khng?

V d: Tm bin i Z ca: x[n] = r n sin(bn)u[n]

- 54 -

Chng III
2.2 PHP BIN I Z NGC IZT 2.2.1 Biu thc tnh IZT

Biu thc tnh IZT c xy dng da trn nh l tch phn Cauchy. nh l nh sau:
1, n = 0 1 n 1 z dz = 0, n 0 2j C vi C l ng cong kn bao quanh gc ta theo chiu dng v nm trong mt phng z. Nhn 2 v ca biu thc tnh ZT vi
z l1 ri ly tch phn theo ng cong C, ta c: 2j

1 1 1 X(z)z l1dz = x[n ]z n +l1dz = x[n ] z n +l1dz n 2j C 2j C = 2j n = C

p dng nh l tch phn Cauchy ta rt ra c:

1 X(z)z l1dz = x[l] 2j C

Thay l = n, ta c biu thc tnh IZT nh sau:

x[n ] = 1 n 1 X(z)z dz 2j C

T y ta thy c th tnh IZT trc tip t cng thc va tm c. Cch tnh l da vo nh l v gi tr thng d (xem sch). Tuy nhin, cch tnh ny kh phc tp nn khng c s dng trong thc t. Sau y ta xt hai phng php tnh IZT c dng trong thc t:
2.2.2 Phng php khai trin chui ly tha (Power Series Expansion)

Ta c th tnh IZT bng cch khai trin X(z) thnh chui ly tha:
X ( z ) = x[k ]z k = x[0] + x[1]z 1 + x[2]z 2 + L
k =0

x[n] = x[k ] [n k ] = x[0] [n] + x[1] [ n 1] + x[2] [n 2] + L

k =0

Ta c:

[n k ] z k
Sau ng nht cc h s ca chui lu tha vi x[n].
V d:

Tm IZT ca:

X ( z ) = 1 + 2 z 1 + 3z 2

- 55 -

Chng III
V d:

Tm IZT ca:

X(z) =

1 , ROC : z > a 1 az 1

V d:

Tm IZT bit: X ( z) =

8 z 19 , | z |> 3 z 5z + 6
2

Cch khai trin X(z) thnh chui ly tha nh trn c im khng thun tin l kh/khng th biu din c x[n] dng tng minh.
- 56 -

Chng III
2.2.3 Phng php khai trin ring phn (Partial Fraction Expansion)

Phng php ny tng t nh tnh bin i Laplace ngc bit. Gi s cn tnh IZT{X(z)}. Ta khai trin X(z) thnh dng sau: X(z) = X p (z) + X i (z)
i

Trong Xp (z) c dng a thc, Xi(z) c dng phn thc vi bc ca t s nh hn bc ca mu s. Tu im cc m Xi(z) c th c cc dng nh sau: 1. Nu pi l im cc n: X i (z) = ri vi z pi
s

ri = (z p i )X(z)

z = pi

2. Nu pi l im cc bi bc s: X i (z) = vi ck =

ck k k =1 ( z p i )

1 d sk s k (z p i ) s X(z) (s k )! dz

z = pi

Sau khi khai trin X(z) ta s dng bng 3.1 suy ra IZT. ( n ) 1 ( n m ) z m z a n u[n ] za az na n u[n ] (z a ) 2 az(z + a ) n 2 a n u[n ] (z a ) 3 z(z a cos ) a n cos(n )u[n ] 2 z 2z cos + a 2 az sin a n sin(n )u[n ] 2 z 2z cos + a 2 Kz K *z 2 | K | a n cos(n + )u[n ] + , p = ae j & K =| K | e j z p z p*
Bng 3.1 Cc cp x[n] X(z) thng dng V d:
2 z 2 5z ,| z |> 3 ( z 2)( z 3)

Tm IZT ca: X ( z ) = Ta khai trin

X ( z) 2z 5 = z ( z 2)( z 3) - 57 -

Chng III

V d:

Tm IZT ca: X(z) = 2z , (z 2)(z 1) 2 z >2

V d:

Tm IZT ca: X ( z) = z z 0.5z + 0.25

2

- 58 -

Chng III
2.3 CC TNH CHT CA PHP BIN I Z

Trong phn ny, ta xt nhng tnh cht quan trng nht ca php bin i Z.
2.3.1 Tuyn tnh
Z

ax[n] + by[n] aX ( z ) + bY ( z )

Min hi t mi ph thuc vo min hi t ca c X ( z ) v Y(z) , l giao ca hai min hi t R x R y . Tuy nhin, nu t hp aX(z) + bY(z) lm kh i mt s im cc ca X(z)
hoc Y(z) th min hi t s m rng ra, nn:
R Rx Ry

2.3.2 Dch chuyn thi gian

x[n n0 ] z n0 X ( z )
Z

y min hi t mi ging min hi t Rx , c th thm vo hoc bt i im gc hay im v cng ty n0 dng hay m

V d:

Tm w[n] bit:
W ( z) = z 4 ,| z |> 3 z2 2z 3

- 59 -

Chng III Tnh cht tuyn tnh v dch thi gian rt hiu qu i vi cc h thng m t bi phng trnh sai phn tuyn tnh h s hng.
2.3.3 Tng chp
Z

y[n] = x[n] h[n] X ( z ) H ( z )

y min hi t mi l Ry Rx Rh Tnh cht tng chp ca bin i Z gip ta tnh ton tng chp tuyn tnh ri rc mt cch n gin hn. Tnh cht ny s c s dng rt nhiu.
Chng minh:
Z

y[n] = x[n] h[n] Thay i th t ly tng, ta c: y[n] = t m = (n k ) , ta c: y[n] = =

n = k =

[ x[k ]h[n k ]]z

k =

x[k ] h[n k ]z n
n =

k =

x[k ][ h[m]z ( m + k ) ]
m =
k m

k =

x[k ]z h[m]z
m =

= X ( z)H ( z) Min hi t mi ph thuc vo min hi t ca c X ( z ) v H ( z ) , l giao ca hai min hi t Rx Rh . Tuy nhin, nu mt tha s X(z) hoc H(z) c im khng, im khng ny
kh im cc ca tha s kia th min hi t s m rng ra, nn Ry Rx Rh

V d:

Cho h[n] = a n u[n] , ( | a |< 1 ) v x[n] = u[n] . Tm y[n] = x[n] h[n]. Nu x[n] = u[n 2] th y[n] thay i nh th no?

- 60 -

Chng III

V d:

Tm u ra y[n] vi u vo x[n] = u[n] v h LTI c p ng xung: h[n] = 3n u[ n 1].

- 61 -

Chng III
2.3.4 nh l gi tr u v gi tr cui

nh l gi tr u v gi tr cui thng lin quan n bin i Z mt pha, nhng chng cng ng vi bin i Z hai pha nu tn hiu x[n] = 0 vi n < 0.
1. nh l gi tr u(initial value theorem)

Biu din: F ( z ) = f [n]z n = f [0] + f [1]z 1 + f [2]z 2 + ,

n=0

Ly gii hn lim F ( z ) , ta s c gi tr u ca f[n]- chnh l f[0]

z

2. nh l gi tr cui(final value theorem)

Nu gi tr cui ca f[n] tn ti th: lim f [n] = f [] = lim( z 1) F ( z )

n z 1

V d:

Tm gi tr u v gi tr cui ca tn hiu f [n] , bit rng: F ( z) = z z .6

2.4 PHN TCH H RI RC LTI

Ta bit trong min thi gian, c th biu din h ri rc LTI bng s , tng chp, p ng xung, p ng bc v phng trnh sai phn . Sau y ta s xt mt cch khc - rt hiu qu biu din h thng ri rc LTI. l biu din bng hm truyn t (transfer function) hay cn gi l hm h thng (system function)
2.4.1 nh ngha hm truyn t

T tnh cht tng chp ca ZT v t quan h gia tn hiu vo x[n], tn hiu ra y[n] vi p ng xung h[n], ta c: Y(z) = X(z).H(z) y X(z) l bin i Z ca x[n], Y(z) l bin i Z ca y[n] v H(z) l bin i Z ca p ng xung h[n]. Da vo p ng xung h[n], ta bit c cc c tnh ca h thng, vy r rng l da vo H(z) ta cng s bit c cc c tnh ca h thng. Ni cch khc, H(z) l biu din ca h thng trong min z. Ta gi H(z) l hm truyn t hay hm h thng. Ta c th xc nh H(z) rt n gin da vo phng trnh sai phn: - 62 -

Chng III

a
k =0

y[n k ] = b r x[n r ]
r =0

Ly bin i Z hai v, s dng tnh cht tuyn tnh v dch thi gian, ta c:

a k z k Y ( z) = b r z r X (z)
k =0 r =0

Suy ra hm truyn t nh sau: Y(z) H ( z) = = X(z)

b z a
k =0 r =0 N r k

z k

Da vo hm truyn t, ta bit c cc c tnh ca h thng, gm tnh nh, tnh kh o, tnh nhn qu, tnh n nh BIBO.
2.4.2 Tnh nh

H khng nh phi c p ng xung c dng:

h[n] = K [n].
H(z) = K Vy h c nh c hm truyn t l mt hng s.
2.4.3 Tnh kh o

h[n] hi [n] = [n] H ( z ) H i ( z ) = 1 y:

hi [n] H i ( z ) l o ca h[n] H ( z ) .
z z

V d:

Tm h o hi [n] ca h: h[n] = a nu[n]. Kim tra kt qu bng cch tnh tng chp ca h[n] vi hi [n] .

- 63 -

Chng III
V d:

Tm h o ca h h[n] nhn qu bit: H ( z) = za . z b

2.4.4 Tnh nhn qu

h[n] = 0, n < 0
ROC: | z |> rmax H nhn qu c min hi t ca H(z) nm ngoi ng trn i ngang qua im cc xa gc nht.
2.4.5 Tnh n nh BIBO

k =

h[k ] <

H(z) =

n =

h[n]z n | H(z) |

n =

| h[n]z n | = | h[n] || z n |
n =

Khi ta tnh trn ng trn n v (tc l |z| = 1) th: | H (z) |

n =

| h[n] |

Nh vy, nu h thng n nh BIBO th ng trn n v nm trong ROC. iu ngc li cng ng. Kt hp vi tnh nhn qu va xt trong 2.4.4 ta c kt lun: H nhn qu s n nh BIBO nu v ch nu tt c cc im cc ca H(z) nm bn trong ng trn n v trong mt phng z:
| p k |< 1, k

V d:

H c p ng xung l u[n] c nhn qu khng? C n nh BIBO khng?

- 64 -

Chng III
V d:

Xt tnh nhn qu v n nh ca h c p ng xung l: h[n ] = (.9) n u[n ]

V d:

Xt tnh nhn qu v n nh BIBO ca h c hm truyn t l: H ( z) = 2z2 5 z 1 2 , <| z |< 2. z2 5 z +1 2 2

2.5 PHNG TRNH SAI PHN TUYN TNH H S HNG

Bin i Z hai pha c dng cho tn hiu tn ti trong khong < n < . Nh vy bin i Z hai pha khng ph hp vi loi h c iu kin u khc 0- l loi h c nhiu trong thc t. Tn hiu vo c kch vo h thng ti thi im n0 nn c tn hiu vo v ra u c tnh vi n n 0 , nhng khng c ngha l bng 0 vi n < n 0 .
Sau y ta s tp trung xem xt php bin i Z mt pha v ng dng ca n vo vic gii phng trnh sai phn vi iu kin u khc 0.
2.5.1 Php bin i Z mt pha v tnh cht dch thi gian

Nhc li nh ngha php bin i Z mt pha: X(z) = x[n ]z n

n =0

Bin i Z mt pha khc bin i Z hai pha gii hn di ca tng. Do la chn ny m bin i Z mt pha c cc c im sau y:
1. Khng cha thng tin v tn hiu vi gi tr thi gian m. 2. Bin i Z mt pha v bin i Z hai pha ca tn hiu nhn qu trng nhau. 3. Khi ni n bin i Z mt pha, ta khng cn quan tm n min hi t, v min hi t lun lun l min ngoi ca mt ng trn. 4. Tnh cht dch thi gian ca bin i Z mt pha khc bin i Z hai pha. C th nh sau:

- 65 -

Chng III x[n ] X(z) x[n m] z m X(z) + z m

Z i= m Z

x[i]z

Ta s ng dng tnh cht dch thi gian ny rt nhiu gii phng trnh sai phn trong trng hp iu kin u khc 0.
2.5.2 Gii phng trnh sai phn tuyn tnh h s hng

Phng trnh sai phn:

a
k =0

y[n k ] = b r x[n r ]
r =0

Ly bin i Z mt pha cho c hai v ca phng trnh, p dng tnh cht tuyn tnh v dch thi gian, ta c:
1 1 M a k z k Y(z) + z k y[i]z i = b r z m X(z) + z m x[i]z i k =0 i = k i = m r =0
N

y x[i] v y[i] chnh l cc gi tr ban u. T y ta c th tm c Y(z), tnh bin i Z ngc ta s c c y[n]

V d:

Tm y[n ], n 0 cho bit y[n] l tn hiu ra ca h thng:

y[n ] = 3y[n 1] 2 y[n 2] + x[n ]

4 y x[n ] = 3n 2 u[n ], y[2] = , 9 y[1] = 1 3

- 66 -

Chng IV

Chng

PHN TCH TN HIU & H THNG RI RC LTI TRONG MIN TN S

Trong chng III ta thy php bin i Z l mt cng c ton hc hiu qu trong vic phn tch h thng ri rc LTI. Trong chng ny, ta s tm hiu mt cng c ton hc quan trng khc l php bin i Fourier ca tn hiu ri rc, gi tt l DTFT (DT-Fourier Transform). Php bin i ny p dng phn tch cho c tn hiu v h thng. N c dng trong trng hp dy ri rc di v hn v khng tun hon. Ni dung chnh chng ny bao gm: - Bin i Fourier - Bin i Fourier ngc - Cc tnh cht ca bin i Fourier - Phn tch tn s cho tn hiu ri rc (cch gi thng dng l phn tch ph) - Phn tch tn s cho h thng ri rc 4.1 PHP BIN I FOURIER 4.1.1 Biu thc tnh bin i Fourier Ta bit rng c th biu din tn hiu ri rc to ra bng cch ly mu tn hiu tng t di dng sau y:

xs (t ) =

k =

x(kT ) (t kT )

By gi ta s tnh bin i Fourier cho tn hiu ny. Cc bc nh sau:

1. Tnh bin i Fourier ca (t kT ) .

2. S dng nguyn l xp chng, tm bin i Fourier ca xs (t ) .

xs (t )

n =

x(nT )e

jnT

t x(nT ) = x[n] v thay bin = T (xem li chng I, lu n v ca [rad] v [rad/s]), ta c: DTFT : X () =

n =

x[n]e

jn

Ta nhn xt thy tuy tn hiu ri rc trong min thi gian nhng DTFT li lin tc v tun hon trong min tn s.
- 67 -

Chng IV DTFT chnh l hm phc theo bin tn s thc. Ta gi DTFT l ph phc (complex spectrum) hay ngn gn l ph ca tn hiu ri rc x[n]
4.1.2 S hi t ca php bin i Fourier

Khng phi l tt c DTFT u tn ti (hi t) v DTFT ch hi t khi:

n =

x[n]e
jn

jn

<

Ta lun lun c:

n =

x[n ]e

n =

x[n ]e

jn

n =

x[n ]e jn x[n ]e jn

n =

x[n ] e x[n ]

jn

n =

n =

Nh vy, nu x[n] tha iu kin:

n =

x[n] <

th bin i Fourier hi t.
V d:

Tm X () vi x[n] = a n u[n] , | a |< 1 . Nu | a |> 1 ?

V d:

Tm Y () vi y[n] = a nu[ n] , | a |> 1 . Nu | a |< 1 ?

- 68 -

Chng IV
V d:

Cho p[n] = u[n] u[n N ] . Tm P () . Hy chng t rng bin i Fourier ny c pha tuyn tnh (linear phase)

V d:

Tm H () ca h LTI c p ng xung sau h[n] = [n] + 2 [n 1] + 2 [n 2] + [n 3] V chng t rng h c pha tuyn tnh

4.1.4 Quan h gia bin i Z v bin i Fourier

Biu thc tnh ZT l: X(z) =

n =

x[n]z

Gi s ROC c cha ng trn n v. Tnh X(z) trn ng trn n v, ta c: X(z)

z =e
j

n =

x[n]e

jn

= X ()

Nh vy, bin i Fourier chnh l bin i Z tnh trn ng trn n v. Da vo y, ta c th pht biu li iu kin tn ti ca DTFT nh sau:

- 69 -

Chng IV Bin i Fourier ca mt tn hiu ch tn ti khi ROC ca bin i Z ca tn hiu c cha ng trn n v.
V d:

Lm li cc v d trn- Tm bin i Fourier ca: (a) x[n] = a n u[n] , | a |< 1 . Nu | a |> 1 ?

(b) y[n] = a nu[ n] , | a |> 1 . Nu | a |< 1 ?

(c) p[n] = u[n] u[n N ]

(d) h[n] = [n] + 2 [n 1] + 2 [n 2] + [n 3]

4.2 PHP BIN I FOURIER NGC 4.2.1 Biu thc tnh bin i Fourier ngc

Ta thy X() l mt hm tun hon vi chu k 2 , do e j tun hon vi chu k 2 : e j = e j ( + 2 ) = e j e j 2 = e j . Do di tn s ca tn hiu ri rc l mt di tn bt k rng 2 , thng chn l: (, ) hay (0,2) . Vy ta c th khai trin X() thnh chi Fourier trong khong (, ) hay (0,2) nu iu kin tn ti X() tha mn. Cc h s Fourier l x[n], ta c th tnh c x[n] t X() theo cch sau: Nhn 2 v ca biu thc tnh DTFT vi

1 jl e ri ly tch phn trong khong ( , ) ta c: 2 1 1 1 X()e jl d = x[n ]e jn e jl d = x[n ] e j ( l n ) d = x[l] n 2 2 = n = 2

Thay l = n v thay cn tch phn, khng nht thit phi l ( , ) m ch cn khong cch gia cn trn v di l 2 , ta c biu thc tnh bin i Fourier ngc (IDTFT) nh sau:

- 70 -

Chng IV

x[n] =

1 2

X ( )e
2

jn

Ta c th tnh IDTFT bng hai cch: mt l tnh trc tip tch phn trn, hai l chuyn v bin i Z ri tnh nh tnh bin i Z ngc. Ty vo tng trng hp c th m ta chn phng php no cho thun tin.
4.2.2 Mt s v d tnh bin i Fourier ngc V d:

Tm x[n] nu bit: 1, c X () = 0, c < <

V d:

Tm x[n] nu bit: X() = cos 2

- 71 -

Chng IV
4.3 CC TNH CHT CA PHP BIN I FOURIER

Sau y ta s xt mt s tnh cht quan trng ca DTFT, phn cn li xem sch.

4.3.1 Tnh tuyn tnh

ax1[n] + bx2 [n] aX 1 () + bX 2 ()

4.3.2 Tnh dch thi gian

x[n] X ()

x[n n0 ] e jn0 X () Qua y ta thy s dch chuyn tn hiu trong min thi gian s khng nh hng n bin ca DTFT, tuy nhin pha c cng thm mt lng.

4.3.3 Tnh dch tn s/ iu ch

x[n] X ()
e j0n x[n ] X( 0 ) cos( 0 n ) x[n ] 1 1 X ( 0 ) + X ( + 0 ) 2 2

Nh vy, vic iu ch tn hiu gy ra s dch tn s.

- 72 -

Chng IV
4.3.4 Tnh chp thi gian

Tng t nh bin i Z, vi bin i Fourier ta cng c:

x1[n] x2 [n] X 1 () X 2 ()
F

V d:

Cho h[n] = a nu[n],| a |< 1 . Tm h o ca n hi [n] , nhng khng dng bin i Z.

4.3.5 Tnh nhn thi gian

x 1 [n ].x 2 [n ]

1 X 1 ()X 2 ( )d 2 2

4.4 PHN TCH TN S (PH) CHO TN HIU RI RC 4.4.1 ngha ca ph

Trong min tn s, mi tn hiu u c c im ring ca n. V d nh, tn hiu sin ch c duy nht mt tn s n, trong khi nhiu trng cha tt c cc thnh phn tn s. S bin thin chm ca tn hiu l do tn s thp, trong khi s bin thin nhanh v nhng sn nhn l do tn s cao. Nh xung vung chng hn, n cha c tn s thp v c tn s cao. Hnh sau minh ha cho iu . Hnh (a) l mt sng sin tn s thp, cc hnh sau (b)-(c) cng thm dn cc sng sin tn s cao dn. Hnh cui cng (e) l tng ca 7 sng sin. Trong hnh (e) ta thy tng ca 7 sng sin c dng xp x vi dng ca mt xung vung. Ph ca tn hiu l m t chi tit cc thnh phn tn s cha bn trong tn hiu. V d nh vi tn hiu xung vung va ni trn, ph ca n ch ra tt c cc nh nhn ca cc sng sin ring c th kt hp li vi nhau to ra xung vung. Thng tin ny quan trng v nhiu l do. V d nh, thnh phn tn s trong mt mu nhc ch cho ta bit cc c trng ca loa, t khi sn xut li ta c th ci tin cho hay hn. Mt v d khc, micro trong h thng nhn dng ting ni phi c di tn rng c th bt c tt c cc tn s quan trng trong ting ni u vo. d on cc nh hng ca b lc trn tn hiu, cn phi bit khng ch bn cht ca b lc m cn phi bit c ph ca tn hiu na. - 73 -

Chng IV

4.4.2 Ph bin v ph pha

Ph ca tn hiu gm c hai phn: ph bin (magnitude spectrum) v ph pha (phase spectrum). Ph bin ch ra ln ca tng hnh phn tn s. Ph pha ch ra quan h pha gia cc thnh phn tn s khc nhau. Trong phn ny, ta xt tn hiu ri rc khng tun hon. Cng c tnh ph tn hiu ri rc khng tun hon l DTFT. tnh ph tn hiu, ta qua hai bc: mt l tnh DTFT ca tn hiu- l X() , hai l tnh bin v pha ca X() :
X ( ) = X ( ) e j ( )

y | X() | l ph bin v () l ph pha. Ta d dng chng minh c rng i vi tn hiu thc, ph bin l mt hm chn theo tn s v ph pha l mt hm l theo .

Do , nu bit ph X() trong khong 0 n , ta c th suy ra ph trong ton di tn s. - 74 -

Chng IV d gii thch ph, tn s s t 0 n thng c chuyn i thnh tn s tng t f t 0 n fS/2 nu tn s ly mu l fS.
V d:

Tm ph bin v ph pha ca tn hiu ch nht: x[n] = u[n] - u[n-4]

V d:

Mt mu nguyn m ting ni eee c ly mu tn s 8 kHz. Ph bin ca tn hiu ny nh trn hnh. Hi tn s c bn ca tn hiu ny l bao nhiu?

- 75 -

Chng IV
4.4.3 Mt ph nng lng

Nng lng ca tn hiu x[n] c nh ngha l: E= By gi ta biu din nng lng theo ph:

n =

| x[n ] |

1 * E = x[n ]x [n ] = x[n ] X ()e jn d n = n = 2

*

Thay i th t ly tng v tch phn, ta c:

1 1 2 E= X * () x[n ]e jn d = X() d 2 2 n =

Vy quan h v nng lng gia x[n] v X() l:

E=

n =

| x[n ] |2 =
2

1 2 X() d (quan h Parseval) 2

i lng S xx () = X() gi l mt ph nng lng.

V d:

Xc nh mt ph nng lng ca tn hiu sau: x[n] = an u[n] vi -1 < a < 1

4.4.4 Bng thng

Bng thng (bandwidth) l di tn s tp trung hu ht nng lng (cng sut) ca tn hiu. Gi s 95% nng lng ca tn hiu tp trung trong di tn s F1 F F2 , ta ni bng thng 95% ca tn hiu l F2 F1 . Ta c th nh ngha cc bng thng 75%, bng thng 90%, bng thng 99%... theo kiu tng t nh bng thng 95% ni trn.
Da vo bng thng ca tn hiu, ta c th phn loi tn hiu nh sau: Nu nng lng tn hiu tp trung quanh tn s 0 th l tn hiu tn s thp (low-frequency signal). Nu nng lng tn hiu tp trung min tn s cao th l tn hiu cao tn (highfrequency signal).

- 76 -

Chng IV Nu nng lng tn hiu tp trung vo mt di tn s no gia tn s thp v tn s cao th l tn hiu thng di (bandpass signal) Trong trng hp tn hiu thng di, khi nim bng hp (narrowband) c dng ch tn hiu c bng thng F2 F1 rt nh (khong 10% hoc nh hn) so vi tn s trung tm (F1 + F2 ) / 2 . Ngc li, tn hiu c gi l bng rng (wideband). Tn hiu c gi l c bng thng hu hn (bandlimited) nu ph ca n bng 0 ngoi di tn F B . Tn hiu nng lng x[n] c gi l c bng thng hu hn nu:
X () = 0, 0 < <

4.5 PHN TCH TN S CHO H THNG RI RC LTI

Trong min tn s, h thng ri rc LTI c m t bng mt hm theo tn s- gi l p ng tn s (frequency response)- l bin i Fourier ca p ng xung h[n]: Quan h gia tn hiu vo- ra v h thng trong min tn s nh sau: y[n ] = x[n ] h[n ] Y() = X().H() p ng tn s hon ton c trng cho h ri rc LTI trong min tn s. N cho php ta: - xc nh cc p ng ca h thng vi cc u vo c dng t hp tuyn tnh ca tn hiu sin hay hm m phc. - xc nh cc c tnh ca h LTI l b lc tn s.
4.5.1 Tnh p ng tn s 1. Tnh t p ng xung

Theo nh ngha, p ng tn s l H() c tnh nh sau: H () =

n =

h[n] e
M

jn

2. Tnh t phng trnh sai phn tuyn tnh h s hng

a k y[n k] = b r x[n r]
k =0 r =0

Ly DTFT 2 v, s dng tnh cht tuyn tnh v dch thi gian, ta c:

[a k e jk ]Y( = [b r e jr ]X()
k =0 r =0 M

Y () = H ( ) = X ()
V d:

b e a
k =0 r =0 N r k

jr

e jk

Tm p ng tn s ca h:

y[[n ]] + 0.1y[[n 1]] + 0.85y[n 2] = x[n ] 0.3x[n 1]

- 77 -

Chng IV

3. Tnh t hm truyn t

Theo quan h gia php bin i Z v php bin i Fourier, ta c th tnh c p ng tn s t hm truyn t bng cch thay z = e j (vi iu kin l ROC c cha ng trn n v): H () = H ( z )
4.5.2 p ng bin v p ng pha
z = e j

Do p ng tn s H() l hm theo bin phc nn c th biu din nh sau:

H ( ) = H ( ) e j ( )

| H() | c gi l p ng bin v () c gi l p ng pha.

V d:

Cho p ng tn s ca h sau: H () = Tm p ng bin v pha. 1 1 0.4e j

4.5.3 p ng ca h LTI i vi u vo l t hp tuyn tnh ca cc tn hiu dng sin hay hm m phc 1. p ng trng thi 0 i vi u vo dng hm m phc

T chng II, ta bit p ng ca h (iu kin u l 0) l: y[n ] =

k =

h[k] x[n k ]

Gi s tn hiu vo l tn hiu hm m phc sau: - 78 -

Chng IV x[n ] = Ae jn , < n < vi A l bin v l mt tn s trong di tn ( , ) . Thay x[n] vo biu thc y[n] trn, ta c: y[n ] =
k =

h[k ](Ae

j ( n k )

)
jn

= A h[k ] e jk k = = (Ae jn )H() = x[n ]H()

)e

Ta thy p ng ca h c dng ging dng ca u vo, tc l dng hm m phc vi cng tn s, ch khc nhau mt h s nhn l H() . iu ny cng ng trong trng hp tn hiu vo c dng sin/cos.

V d:

Xc nh u ra ca h thng c p ng xung l: h[n ] = (1 / 2) n u[n ] khi u vo c dng: (a) x[n ] = Ae

j n 2

1 2 j26.60 , < n < . Cho bit H = = e 1 5 2 1+ j 2

(b) x[n ] = 10 5 sin

n + 20 cos n, < n < 2

- 79 -

Chng IV
2. Eigenfunction v eigenvalue

Nu ta c tn hiu vo v tn hiu ra c th phn tch thnh cc hm c s l:

x[n] = akk [n]

k

y[n] = ak k [n]
k

Cc hm c s ny c cng dng l k [n] , ch khc nhau mt h s nhn (thc/ phc) bk :

k [n] = k [n] h[n] v k [n] = bkk [n]

th k [n] c gi l mt eigenfunction ca h ri rc LTI vi eigenvalue l bk . Trong trng hp ny, tn hiu vo c dng hm m phc nh trn l eigenfunction v H() tnh ti cng tn s ca tn hiu vo l eigenvalue tng ng.
3. p ng trng thi bn v p ng nht thi

Ta c th phn tch p ng ca h thng thnh hai thnh phn. Thnh phn th nht khng tin ti 0 khi n tin ti v cng, c gi l p ng trng thi bn (steady-sate response) yss[n]. Thnh phn ny tn ti trong cng khong thi gian tn ti ca u vo. Thnh phn kia tin ti 0 khi n tin ti v cng, c gi l p ng nht thi (transient response) ytr[n] Trong nhiu ng dng th p ng nht thi khng quan trng v ch tn ti trong mt khong thi gian ngn v do vy m n thng c b qua.
V d:

Cho tn hiu x[n ] = Ae jn , n 0 i vo h thng y[n ] ay[n 1] = x[n ] (|a| < 1) Cho iu kin u l y[-1]. Tm p ng ca h, p ng trng thi bn, p ng nht thi.

Tn hiu ra l: y[n ] = a
n +1

Aa n +1e j ( n +1) jn A y[1] e + e jn , n 0 j j 1 ae 1 ae - 80 -

Chng IV Ta c p ng trng thi bn l: y ss [n ] = lim y[n ] =

n

A = AH()e jn j 1 ae

Hai s hng u ca y[n] gim v 0 khi n tin ti v cng. l p ng nht thi: y tr [n ] = a

n +1

Aa n +1e j ( n +1) jn y[1] e ,n0 1 ae j

n x[n] = k =1 X k zk M

Tng qut, khi tn hiu vo l:

Bng cch xp chng, ta tm c p ng trng thi bn nh sau:

n yss [n] = k =1 X k H ( zk ) zk . M

V d: n Cho u vo x[n] = ( 3 ) , v 4

h[n] = (.5) n u[n] Tm p ng trng thi bn.

3 3 yss [n] = H 4 4
n

4.5.4 H LTI l b lc tn s

B lc (filter) l mt h thng x l tn hiu bng cch thay i cc c trng tn s ca tn hiu theo mt iu kin no . Ni cch khc, b lc thay i ph ca tn hiu vo X() theo p ng tn s H() to ra tn hiu ra c ph l: Y() = X()H() . p ng tn s y ng vai tr l mt hm trng s hay mt hm thay i dng ph i vi cc thnh phn tn s khc nhau trong tn hiu vo. Khi xt theo quan im ny th bt k mt h LTI no cng c th c xem l mt b lc tn s, ngay c khi n khng ngn mt vi hay tt c cc thnh phn tn s trong tn hiu vo. Do vy ta c th ng nht hai khi nim b lc tn s v h LTI. Trong mn hc ny, ta dng thut ng b lc l ch cc h LTI thc hin chc nng chn lc tn hiu theo tn s. B lc cho cc thnh phn tn s ca tn hiu trong mt di tn no i qua v ngn khng cho cc thnh phn tn s khc i qua. Di tn s cho qua gi l di thng (passband) v di tn s khng cho qua gi l di chn (stopband/block-band). Tn s gii hn gia di thng v di chn gi l tn s ct (cut-off frequency)

- 81 -

Chng IV Cch m t b lc n gin nht l biu din dng ca n trong min tn s. chnh l p ng tn s, gm p ng bin v p ng pha. Xt b lc c di thng l (1 , 2 ) . Nu y l b lc l tng th p ng tn s c dng nh sau:
Ce jn 0 , 1 < < 2 H () = 0,

y C v n0 l hng s. Tn hiu ra b lc l tng c dng: Y() = X()H() = CX ()e jn 0 , 1 < < 2 y[n ] = Cx[n n 0 ] Ta thy tn hiu ra n gin ch l tn hiu vo b thay i mt h s nhn v b tr i mt khong thi gian. S thay i bin v tr ny khng lm mo tn hiu. Vy b lc l tng l b lc c p ng bin c dng ch nht v p ng pha l tuyn tnh trong di thng: | H() |= C, 1 < < 2 () = n 0 , 1 < < 2 C rt nhiu loi b lc khc nhau vi rt nhiu ng dng khc nhau, trong thng dng nht l b lc thng thp, thng cao, thng di v chn di. Hnh sau v cc p ng bin ca 4 loi b lc thng dng.

- 82 -

Chng IV Cc p ng bin trn khng c dng ch nht v y khng phi l b lc l tng. Gia di thng v di chn c mt di chuyn tip (transition band). li (gain) ca b lc ti mt tn s no l gi tr ca p ng bin ti tn s . Tn s ct l tn s ti im m li l 1 / 2 ca gi tr ln nht. B lc cng tin gn n b lc l tng hn khi dc ca b lc cng ln, di chuyn tip cng nh. iu ny yu cu bc ca b lc phi ln. Ta s quay li tm hiu k hn v b lc v thit k b lc sau ny.

- 83 -

Chng V

Chng

PHP BIN I FOURIER RI RC V NG DNG

T chng trc, ta thy ngha ca vic phn tch tn s cho tn hiu ri rc. Cng vic ny thng c thc hin trn cc b x l tn hiu s DSP. thc hin phn tch tn s, ta phi chuyn tn hiu trong min thi gian thnh biu din tng ng trong min tn s. Ta bit biu din l bin i Fourier X() ca tn hiu x[n]. Tuy nhin, X() l mt hm lin tc theo tn s v do , n khng ph hp cho tnh ton thc t. Hn na, tn hiu a vo tnh DTFT l tn hiu di v hn, trong khi thc t ta ch c tn hiu di hu hn, v d nh mt bc nh, mt on ting ni

Trong chng ny, ta s xt mt php bin i mi khc phc c cc khuyt im trn ca DTFT. l php bin i Fourier ri rc DFT (Discrete Fourier Transform). y l mt cng c tnh ton rt mnh thc hin phn tch tn s cho tn hiu ri rc trong thc t. Ni dung chnh chng ny gm: DTFT ca tn hiu ri rc tun hon. y l php bin i trung gian dn dt n DFT DFT thun v ngc Cc tnh cht ca DFT Mt s ng dng ca DFT Thut ton tnh nhanh DFT, gi l FFT

5.1 PHP BIN I FOURIER CA TN HIU RI RC TUN HON 5.1.1 Khai trin chui Fourier cho tn hiu ri rc tun hon

Nhc li khai trin chui Fourier cho tn hiu lin tc tun hon:
x(t ) =

k =

ae
k

jk0t

synthesis equation

ak =

1 x(t )e jk0t dt T T

analysis equation

Tng t, ta c khai trin chui Fourier cho tn hiu ri rc tun hon (cn c gi l chui Fourier ri rc DFS- Discrete Fourier Serie) nh sau: x[n] = ak = 1 N
k< N >

ak e jk 0 n x[n]e jk 0 n

synthesis equation analysis equation

n< N >

Khc vi khai trin chui Fourier cho tn hiu lin tc tun hon, php ly tch phn by gi c thay bng mt tng. V c im khc quan trng na l tng y l tng hu hn, ly trong mt khong bng mt chu k ca tn hiu. L do l:
e
jk 0 n

=e

jk

2 n N

=e

jk

2 n N

.e

jk 2 n

=e

j( k + N )

2 n N

= e j( k + N ) 0 n

- 88 -

Chng V
5.1.2 Biu thc tnh bin i Fourier ca tn hiu ri rc tun hon

Ta c hai cch xy dng biu thc tnh bin di Fourier ca tn hiu ri rc tun hon nh sau:
1. Cch th nht:

Ta bt u t tn hiu lin tc tun hon. Ta c:

e j0t 2 ( 0 )
F

Nn: x[n ] =

k =

a k e jk0t X() = 2 a k ( k0 )
k =

Vy, ph ca tn hiu tun hon l ph vch (line spectrum), c v s vch ph vi chiu cao l 2a k nm cch u nhau nhng khong l 0 trn trc tn s By gi chuyn sang tm bin i Fourier ca tn hiu ri rc tun hon: Trc ht, ta tm DTFT ca e j0n . Ta c th on l DTFT ca e j0n cng c dng xung tng t nh DTFT ca e j0 t , nhng khc im DTFT ny tun hon vi chu k 2 : DT : e j0 n 2 ( 0 + 2 l )
l = F

Ta c th kim tra li iu ny bng cch ly DTFT ngc: x[n] =

=

1 2
1 2

< 2 >

X ()e jn d
2 ( 0 )e jn d

0 +

= e j 0 n Kt hp kt qu DTFT ca e j0 n vi khai trin chui Fourier ca x[n], tng t nh vi tn hiu lin tc, ta c:

x[n] 2

k< N > l =

a ( k
k k = k 0

+ 2 l )

= 2

a ( k ) (do ak tun hon)

- 89 -

Chng V Vi 0 =
2 N

, ta c: x[n] periodic with period N 2

F

k =

a (
k

2 k ) N

vi ak l h s ca chui Fourier, tng c ly trong mt chu k ca tn hiu.

ak = =
V d:

1 N

n< N >

x[n]e j 2 nk /N x[n]e j 2 nk /N

1 N

n0 + N 1 n = n0

Tm DTFT ca dy xung ri rc sau: p[n] =

k =

[n kN ].

Cui cng ta c: p[n] =

k =

[n kN ]

2 N

k =

2 k ) = P ( ) N 2 v c N

Nh vy, DTFT ca dy xung ri rc l tp v s xung ri rc c chiu cao l khong cch gia hai xung cnh nhau l 2 N
- 90 -

Chng V
2. Cch th hai:

Ta c th rt ra kt qu DTFT ca tn hiu ri rc tun hon nh trn nhng bng cch khc. Ta xt mt chu k ca tn hiu tun hon x[n] , k hiu l: x0 [n] : x[n], 0 n N 1 x0 [n] = otherwise. 0,

Sau tnh DTFT ca x0 [n] X 0 () =

n =

x0 [n]e jn = x0 [n]e jn
n =0

N 1

Vit li x[n] di dng tng ca v s chu k x0 [n] : x[n] =

k =

x0 [n kN ] =

k =

x0 [n] [n kN ] = x0 [n]

k =

[n kN ]

Theo tnh cht chp tuyn tnh ta c:

x[n] = x0 [n] p[n] X 0 () P() = X () Thay P () va tm c trong v d trn vo biu thc ny, ta c: 2 X () = X 0 () N = 2 N
F

(
k

2 k ) N

X
k

2 k 2 k ) ( ) (t/c nhn vi mt xung) N N

y X 0 ( 2Nk ) c N gi tr phn bit, ngha l k = 0,1,2,..., N 1 .

Biu thc tnh DTFT ngc l: x[n] = = 1 2 1 N

2 k =

X ()e jn d = X0(

1 2

2 N

k =

X0(

2 k 2 k jn ) ( )]e d N N

2 k 2 2 k jn 1 ) ( )e d = 0 N N N

X
k =0

N 1

2 k j 2N kn )e N

Nu so snh vi cng thc chui Fourier trn, ta c: ak = 1 2k X0 vi k = 0,1,2,..., N 1 N N

- 91 -

Chng V Tm li, ta c: x[n] = x0 [n]

k =

[n kN ]

X 0 () = x0 [n]e jn
n =0

N 1

X () =

2 N

k =

1 N

X0(

2 k 2 k ) ( ) N N
0

x[n] =

X
k =0

N 1

2 k j 2N kn )e N

ak =

1 2 k X0( ) N N

Vy, tnh DTFT X () ca tn hiu x[n] ri rc tun hon vi chu k N , ta tin hnh theo cc bc sau y:
1. Bt u vi mt chu k x0 [n] ca tn hiu x[n] , lu x0 [n] khng tun hon 2. Tm DTFT ca tn hiu khng tun hon trn:
X 0 () = n = x0 [n]e jn

3. Tnh X 0 () ti cc gi tr =

2 k N

, k = 0,1,, N 1 2 N

4. T y c DTFT ca tn hiu tun hon theo nh cng thc va tm:

X () =
V d:

k =

X0(

2 k 2 k ) ( ) N N

Cho x[n] = 1 . Tm X ()

- 92 -

Chng V
V d:

Cho x0 [n] = [n] + [n 1] + 2 [n 3] . Gi s N = 4 . Tm X 0 () v X () v xc nh 4 gi tr phn bit ca X 0 ( 2Nk ) .

V d:

Cho tn hiu tun hon x[n] vi chu k N = 3 v mt chu k l: x0 [n] = [n] + 2 [n 2] . Tm X 0 () v X () . Kim tra kt qu bng cch tnh DTFT ngc khi phc li x[n] .

- 93 -

Chng V
V d:

Cho tn hiu tun hon y[n] vi chu k N = 3 v mt chu k l: y0 [n] = [n] + 2 [n 1] + 3 [n 2] . Tm Y0 () v Y () . Kim tra kt qu bng cch tnh DTFT ngc khi phc li y[n] .

5.2 PHP BIN I FOURIER CA TN HIU RI RC DI HU HN 5.2.1 Biu thc tnh bin i Fourier ri rc thun ca tn hiu ri rc tun hon

Trong mc trn, ta xt mt chu k x0 [n] ca tn hiu tun hon x[n] . Ta c th xem phn chu k ny c c bng cch ly ca s (windowing) tn hiu di v hn x[n] : x0 [n] = x[n]wR [n] Vi wR [ n] l ca s ch nht ( y n cn c gi l ca s DFT): 1, n = 0,1,L, N 1 wR [n] = otherwise 0, x0 [n] = x[n]wR [n] ch l cc mu ca x[n] nm gia n = 0 v n = N 1. (khng quan tm n cc mu nm ngoi ca s). Ta c th tnh DTFT ca x0 [n] nh sau: X 0 () = DTFT( x0 [n]) = Vy, X 0 () = x[n]e jn = x0 [n]e jn
n=0 n=0 N 1 N 1

n =

x0 [n]e jn =

n =

x[n]wR [n]e jn = x[n]e jn

n=0

N 1

By gi ta tin hnh ly mu X 0 () lu tr trn my tnh. Do X 0 () lin tc v tun hon vi chu k 2 nn ch cn cc mu trong di tn s c bn. thun tin, ta ly N mu
- 94 -

cch u nhau trong on [0, 2 ) :

Chng V

0, 2 / N, 4 / N, K, ( N 1)2 / N

Ni cch khc, cc im l: =
2 k N

, k = 0,1,, N 1

Ta nh ngha php bin i Fourier ri rc DFT (Discrete Fourier Transform) nh sau: X [k ] = X 0 ( 2 k ) vi k = 0, 1, K, N 1 N

X[k] c gi l ph ri rc (discrete spectrum) ca tn hiu ri rc.

Lu 1:

X[k] l hm phc theo bin nguyn, c th c biu din di dng: X[k ] =| X[k ] | e j[ k ] y |X[k]| l ph bin v [k ] ph pha.
Lu 2:
phn gii (resolution) ca ph ri rc l 2N v ta ly mu ph lin tc ti cc im cch nhau 2N trong min tn s, ngha l: = 2N .

Ta cng c th biu din phn gii theo tn s tng t f. Ta nh li quan h: F= Do :

f = fs N

f fs

Lu 3:
Nu ta xem xt cc mu ca X 0 () l 2Nk vi k = n th ta s thy DFT chnh l mt chu k ca DFS, nhng DFT hiu qu hn nhiu so vi DFS bi v s mu ca DFT l hu hn:

- 95 -

Chng V
X [ k ] = X 0 ( ) | =
N 1 n=0

2 k , k = 0,1,L, N 1 N
N

= x[n]e jn |= 2 k ,k =0,1,L, N 1 = x[n]e j

n=0 N 1
2 kn N

,k =0,1,L, N 1

cho gn, ta k hiu:

WN = e

2 N

Khi khng cn n N, ta c th vit n gin W thay cho WN Vy,

X [k ] = x[n]WNkn , k = 0,1,L , N 1
n=0 N 1

l DFT ca dy x0 [n]. ly ca s t x[n]

V d:

Tnh DFT ca x[n ] = u[n ] u[n N]

(e
n=0

N 1

j 2 k N

) n = W kn
n =0

N 1

Suy ra DFT ca x[n] = 1, n = 0,1,L, 7.

V d:

n=0 1, . Tm X [k ], k = 0,1,, 7 Cho x[n] = 0, n = 1,, 7

- 96 -

Chng V

- 97 -

Chng V
V d:

Cho y[n] = [n 2] v N = 8 . Tm Y [k ]

V d:
Cho x[n] = cWN pn , n = 0,1,, N 1 , vi p l mt s nguyn p [0,1,, N 1] v WN = e Tm DFT ca x[n] .
j 2N

5.2.2 Biu thc tnh bin i Fourier ri rc ngc

Trong mc ny, ta s i thit lp cng thc khi phc x[n] t X [k ] . S khi phc ny c gi l tng hp hay DFT ngc (IDFT) T biu thc tnh DTFT ngc c thit lp trong mc 5.2.1 v do tnh tng h gia min thi gian v tn s, ta c th suy ra biu thc tnh IDFT nh sau: x[n] = 1 N

X [k ]W
k =0

N 1

kn N

, n = 0,1,, N 1

- 98 -

Chng V Sau y ta s chng minh iu ny ng:

x[n] =

1 N

x[l ]W
k =0 l =0

N 1 N 1

kl N

WN kn

N 1 1 x[l ] WN (l n ) k =0 k N l =0

N 1

Ta c

W
k =0

N 1

k (l n ) N

N, l = n = 0, l n

Thay kt qu ny vo x[n] ta c c biu thc tnh IDFT trn l ng x[n] =

N 1 1 N 1 1 x[l ] WNk (l n ) = k =0 N l =0 N 1 = ( Nx[n]) = x[n] N

x[l ]N [n l ]
l =0

N 1

V d:

Tm IDFT ca X [k ] = 1, k = 0,1,, 7 .

V d:

Cho x[n] = [n] + 2 [n 1] + 3 [n 2] + [n 3] v N = 4 , tm X [k ] .

- 99 -

Chng V
V d:

Cho X [k ] = 2 [k ] + 2 [k 2] v N = 4 , tm x[n] .

5.2.3 Chn s mu tn s N

Qua mc 5.2.1 ta thy biu thc tnh DFT c thnh lp t vic ly mu DTFT vi s mu l N. S mu N ny cng chnh l s mu ca tn hiu ri rc trong min thi gian hay l di ca ca s DFT, ni ngn gn l s mu tn s bng s mu thi gian.
V d:

Cho tn hiu x[n] nh hnh bn. Tnh ri v hai loi ph bin | X() | v |X[k]| trn th. Xem th ta thy r rng rng: cc mu |X[k]| bng vi | X() | ti cng tn s.

- 100 -

Chng V Vic chn N nh hng n phn gii ca ph ri rc. Chn N cng ln, phn gii cng tt, ngha l khong cch gia hai vch ph cnh nhau X[k] v X[k+1] cng nh, ngha l ng bao ca ph ri rc X[k] cng gn vi hnh nh ca ph lin tc | X() | . vic tng N khng lm nh hng n kt qu, ta ko di tn hiu trong min thi gian ra bng cch chn thm cc mu bng 0 (zero-padding) vo pha cui ca tn hiu.
V d:

Cho x[n] = u[n] u[n 5] . Tm X[k] vi N nh sau: (a) N = 5.

- 101 -

Chng V (b) N = 10

5.2.4 Cc tnh cht ca bin i Fourier ri rc

Hu ht cc tnh cht ca DFT tng t nh cc tnh cht ca DTFT, nhng c vi im khc nhau. im khc nhau l do DFT chnh l mt chu k trch ra t dy DFS tun hon vi chu k N.
% By gi ta thay i k hiu, k hiu x[n] l dy tun hon chu k N, x[n] l mt chu k trch % ra t x[n] : % x[n] = x[n]
k =

[n kN ]

k =

x[n kN]
- 102 -

Chng V
1. Dch vng

Nu x[n] X [k ] th x[n m] W km X[k ] vi WN = e

V d:
DFT
j 2N

DFT

Dch vng i m mu s cho kt qu trng vi dich vng i (m mod N) mu.

2. Tng chp vng
x1[n] x2 [n] X 1[k ] X 2 [k ]
DFT , N

y:
y[n] = x1[n] x2 [n] = x1[ p]x2 [n p]mod N
p =0 N 1

Du l k hiu tng chp vng. Nhc li cng thc tng chp tuyn tnh:
y[n] = x1[n] x2 [n] =

p =

x1[ p ]x2 [n p]

- 103 -

Chng V Thot nhn, ta thy biu thc tnh tng chp vng rt ging tng chp tuyn tnh. Tuy nhin, hai php chp khc nhau nhng im sau y: Php chp vng ch p dng cho hai dy di hu hn v bng nhau, kt qu cng l mt dy cng chiu di, ngha l x1[n] , x2 [n] , and y[n] u c chiu di l N. Trong khi , php chp tuyn tnh p dng cho hai dy c chiu di bt k: nu x1[n] di N x1 , x2 [n] di N x1 th y[n] di Php dch trong tng chp vng l php dch vng, khc vi php dch trong tng chp tuyn tnh l php dch tuyn tnh.

V nhng im khc nhau trn nn kt qu ca tng chp vng v tng chp tuyn tnh ca cng hai dy c th khng trng nhau. Tuy nhin, ta c cch lm cho hai kt qu trng nhau nh sau: Chuyn tng chp tuyn tnh sang min tn s:
Y() = X 1 ().X 2 ()

Ly mu Y() vi s mu l N N y = N x1 + N x 2 1 , ta c: Y[k ] = X[k ].H[k ] Tnh DFT ngc, ta c: y[n] = x[n] * h[n]

y chiu di ca y[n] , x[n] v h[n] l:

N N y = N x1 + N x 2 1 Nh vy, bng cch ko di cc tn hiu x1[n] v x2[n] ra n chiu di N N y = N x1 + N x 2 1 ri ly chp vng, ta c hai kt qu ca tng chp vng v chp tuyn tnh l trng nhau:
y[n ] = x 1 [n ] x 2 [n ] = x 1 [n ] x 2 [n ]

V d:

Tm x1[n] x2 [n] = z[n] , vi x1[n] = [1, 2, 0, 0] , x2 [n] = [1,1, 0, 0] v N = 4. Kt qu ny c trng vi tng chp tuyn tnh khng?

- 104 -

Chng V
V d:

Tm y[n] = x[n] x[n] , vi x[n] = [1, 0,1,1] trong hai trng hp: (a) N = 4 (b) N = 8 N bng bao nhiu l tng chp vng trng vi tng chp tuyn tnh?

5.3 MT S NG DNG CA DFT

Phn ny s gii thiu s lc v mt s ng dng ca DFT trong thc t

5.3.1 Phn tch ph tn hiu

Trong chng trc, ta bit c ngha ca ph trong vic phn tch tn hiu, t ph ca tn hiu ta bit c mt s thng tin cn thit. tm ph ca tn hiu (c lin tc v ri rc), ta cn phi bit gi tr ca tn hiu ti tt c cc thi im. Tuy nhin trong thc t, do ta ch quan st c tn hiu trong mt khong thi gian hu hn nn ph tnh c ch l xp x ca ph chnh xc. DFT c ng dng rt hiu qu trong vic tnh ton ph xp x ny. Trong thc t, nu tn hiu cn phn tch l tn hiu lin tc, trc ht ta cho tn hiu i qua mt b lc chng chng ph ri ly mu vi tn s Fs 2B , vi B l bng thng ca tn hiu sau khi lc. Nh vy, tn s cao nht cha trong tn hiu ri rc l Fs/2. Sau , ta phi gii hn chiu di ca tn hiu trong khong thi gian T0 = LT, vi L l s mu v T l khong cch gia hai mu. Cui cng, ta tnh DFT ca tn hiu ri rc L mu. Nh trnh by trn, mun tng phn gii ca ph ri rc, ta tng chiu di ca DFT bng cch b thm s 0 vo cui tn hiu ri rc trc khi tnh DFT. V d sau y minh ha mt ng dng ca DFT trong vic phn tch ph tn hiu in tm (ECG): Hnh v (a) l th ca 11 nhp tim ca mt bnh nhn. 11 nhp tim ny xut hin trong khong thi gian 9 giy, tng ng vi 11/9 = 1.22 nhp trong mt giy, hay 73 nhp trong mt pht. Hnh (b) l chi tit na u ca nhp tim th t. Hnh (c) l mt on ph bin DFT c c sau khi ly mu on 11 nhp tim (a) vi tn s ly mu l 8 kHz. Nhn (c) ta thy c hai im bin cao nht xut hin tn s 88 Hz
- 105 -

Chng V v 235 Hz. tm hiu ph k hn, ta tnh DFT ca tn hiu hnh (b)- ph ny th hin hnh (d), y ta thy r hai im bin cao nht tn s 88 Hz v 235 Hz bn trong mi nhp tim. Tuy nhin, ta khng thy tn s lp li nhp tim l 1.22 Hz trong DFT hnh (c). Hnh (e) gii thch r hn iu ny. N l phin bn m rng ca cc nh nhn trong di tn t 60 Hz n 100 Hz. Trong khi tn s 1.22 Hz qu nh nn khng thy r trong hnh (c) th trong hnh (e) ny, ta thy r cc hi ca tn s 1.22 Hz v thy r khong cch gia hai nh nhn l 1.22 Hz.

5.3.2 Tnh tn hiu ra h thng ri rc LTI

Tn hiu ra h thng ri rc LTI c tnh bng cch chp tn hiu vo vi p ng xung ca h thng:

y[n ] = x[n ] h[n ]

Ta c hai cch tnh tng chp ny: mt l tnh trc tip, hai l tnh thng qua tng chp vng nh phn tch trong mc 5.2.4. Cch tnh qua tng chp vng s c li hn v mt thi gian. L do l tng chp vng c th tnh thng qua DFT, m DFT c th c tnh nhanh nh thut ton tnh nhanh FFT. tnh y[n], ta thc hin theo cc bc sau y: Ko di x[n] n di N = Nx + Nh - 1
- 106 -

Chng V Ko di h[n] n di N = Nx + Nh - 1 Tnh DFT ca x[n] N mu, ta c X[k] Tnh DFT ca h[n] N mu, ta c H[k] Nhn X[k] vi H[k], ta c Y[k]: Y[k] = X[k].H[k] Tnh DFT ngc ca Y[k], ta c y[n] Vic tnh DFT v DFT ngc c thc hin nh mt thut ton tnh nhanh DFT, gi l FFT (Fast Fourier Transform). Phn sau s trnh by v thut ton FFT.
5.4 TNH NHANH DFT BNG THUT TON FFT

DFT c ng dng rng ri trong x l tn hiu ri rc/ s nn nhiu nh ton hc, k s rt quan tm n vic rt ngn thi gian tnh ton. Nm 1965, Cooley v Tukey tm ra thut ton tnh DFT mt cch hiu qu gi l thut ton FFT. Cn lu FFT khng phi l mt php bin i m l mt thut ton tnh DFT nhanh v gn hn. nh gi hiu qu ca thut ton, ta s dng s php tnh nhn v cng phc. S php nhn v cng phc lin quan trc tip n tc tnh ton khi thut ton c thc hin trn cc my tnh hay l cc b x l chuyn dng.
5.4.1 Hiu qu tnh ton ca FFT

Cng thc tnh DFT ca dy di N:

X [k ] = x[n]W kn
n =0 N 1

Qua y ta thy tnh mi gi tr DFT ta cn N php nhn v cng phc. tnh ton b DFT ta cn N 2 php nhn v cng phc. Tuy nhin, nu tnh DFT nh thut ton FFT th s php nhn v cng phc gim xung ch cn N log 2 N . 2 V d nh N = 210 = 1024 th nu tnh trc tip DFT cn N 2 = 220 = 106 php nhn v cng phc, trong khi tnh qua FFT th s php nhn v cng phc gim xung ch cn N log 2 N = 2 5120. S php tnh gim i gn 200 ln! Hnh sau cho thy r hiu qu ca thut ton FFT:
10000 Number of Operations

8000

6000

4000

2000

0 0

20

40 60 N, Size of DFT or FFT

80

100

- 107 -

Chng V C nhiu thut ton FFT khc nhau bao gm FFT phn chia theo thi gian v FFT phn chia theo tn s. Trong phn ny ta tp trung vo thut ton FFT c s 2 ( N = 2i where i is an integer ) phn chia theo thi gian.
5.4.2 Nguyn tc ca FFT

Nguyn tc c bn m cc thut ton FFT u da vo l phn chia DFT N mu thnh cc DFT nh hn mt cch lin tc: Vi N = 2i, u tin ta phn chia DFT N mu thnh cc DFT N mu, sau phn chia DFT 2 N N 2 mu thnh DFT 4 mu v c tip tc nh th cho n khi c cc DFT di N = 2. Vic tnh DFT nh hn r rng s cn t php tnh nhn v cng phc hn. Trc tin, chia x[n] thnh cc dy con chn v l:
X [k ] =
neven

x[n]W
2 mk

kn

+ x[n]W kn
nodd

t n = 2m vi n chn v n = 2m + 1 vi n l:
X [k ] = x[2m]W
m=0
N 1 2

+ x[2m + 1]W k (2 m +1) =

m=0

N 1 2

m=0

x[2m](W )

N 1 2

2 mk

+W

m =0

x[2m + 1](W

N 2

2 mk

X [k ] = X e [k ] + W k X o [k ] = G[k ] + W k H [k ] X e [k ] v X o [k ] l DFT
Tip theo chia dy con
N 2 N 2

mu.

mu l x[2m] lm i bng cch t m = 2 p :

N 1 4

X e [k ] = x[4 p](W ) + W
4 kp p =0

2k

x[4 p + 2](W
p =0

N 4

4 kp

) =

Thc hin tng t nh vy cho dy con x[2m+1]

V d: N = 8

Qu trnh phn chia DFT 8 mu thnh cc DFT nh hn c minh ha trn lu . u tin, chia x[n] thnh 2 dy con, dy th nht l dy chn x[0], x[2], x[4], x[6] v dy th hai l dy l x[1], x[3], x[5], x[7]. Tip theo, chia dy chn thnh 2 dy con, dy th nht l x[0], x[4] v dy th hai l x[2], x[6]. Tng t, dy l c chia thnh 2 dy con, l dy x[1], x[5] v dy x[3], x[7]. Cc DFT 2 mu c tnh n gin nh sau: G[k ] = g[n ]W , 0 k 1, W = e
nk n =0 1 2 2

= 1 (ch cn php cng v tr)

G[0] = g[0]W 0.0 + g[1]W 1.0 = g[0] + g[1] G[1] = g[0]W

0.1

+ g[1]W

1.1

= g[0] g[1]
- 108 -

Chng V

- 109 -

Chng V
FFT c s: A Butterfly

0 WNr

WN(r + N/2) Lu : WN(r + N/2) gin nh sau: = WN N/2 WNr = -1 WNr = - WNr , do c th v li lu FFT n

- 110 -

Chng V

Ph lc 1
Summary: The Common Types of Fourier Transforms
Continuous in Time x(t ) = Aperiodic in Frequency Fourier Series (FS): Periodic in Time, = Discrete in Frequency
ak =
1 jk t T x(t )e 0 dt T
k =

Discrete in Time x[n] = Periodic in Frequency Discrete Fourier Series (DFS) and Discrete Fourier Transform (DFT):
X [k ] = x[n]WNkn , 0 k N 1
n=0 N 1

x(t ) =

ae
k

jk0t

x[n] =

1 N

X [k ]W
k =0
j 2N

N 1

kn N

, 0 n N 1

where WN = e

Aperiodic in Time, = Continuous in Frequency

Fourier Transform (FT):

X ( ) = x(t )e jt dt

Discrete-Time Fourier Transform (DTFT):

X () =
n =

x(t ) = X ( )e

jt

dt

x[n]e
2

jn

1 x[n] = 2

X ()e

jn

- 111 -

Chng V

Ph lc 2
Some Fourier Relationships
The Fourier transform is the Laplace transform evaluated on the j axis.
X ( ) = x(t )e jt dt = X ( s ) s = j = x(t )e st dt s = j

The discrete-time Fourier transform is the z-transform evaluated around the unit circle. X () = x[n]e jn = X ( z ) z =e j = x[n]x n n = n = z = e j

Discrete-time periodic signals can also be described by a Fourier Series expansion: x[n] = and ak = 1 N
n< N > k< N >

ak e jk 0 n

synthesis equation

x[n]e jk 0 n

analysis equation

then using the DTFT of the impulse train, P () that we previously found, the DTFT of an arbitrary discrete-time periodic signal can be found from X 0 () the DTFT of one period x0 [n] 2 X () = X 0 () N = 2 N

(
k

2 k ) N

X
k

2 k 2 k ) ( ) N N

The DFT is simply a scaled version of the terms of one period of the discrete time Fourier transform for a periodic sequence: X [k ] = X 0 ( for =
2 k N
N 1 2 k kn ) = x[n]WN , 0 k N 1 N n=0

, k = 0,1,, N 1 , i.e. only look at the N distinct sampled frequencies of X 0 () .

N 1 n=0

Also important, the orthogonality of exponentials:

W
where WN = e
j 2N

kn N

= N [k ]

- 112 -