dce

2011

Chng 2

Tn hiu v H thng Ri Rc
theo Thi Gian
BK
TP.HCM

2011, TS. inh c Anh V

dce

2011

Ni dung (1)
Tn hiu RRTG
Cc t/h c bn
Phn loi t/h
Cc php ton c bn

H thng RRTG
M t theo quan h vo-ra
M t theo s khi
Phn loi h/t RRTG

Phn tch h LTI trong min thi gian

Phn gii t/h RRTG theo p ng xung n v

Tng chp v cc thuc tnh
Biu din hm p ng xung n v cho h nhn qu, n nh
H FIR, IIR

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

dce

2011

Ni dung (2)
Phng trnh sai phn

LTI v phng trnh sai phn tuyn tnh h s hng

Gii PTSPTT HSH
p ng xung n v ca h/t qui LTI

Hin thc h RRTG

Cu trc trc tip dng 1

Cu trc trc tip dng 2

Tng quan gia cc t/h

Tng quan v t tng quan

Thuc tnh ca tng quan
Tng quan ca cc t/h tun hon
Gii thut tnh s tng quan

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

dce

2011

Tn hiu RRTG (1)

Gii thiu
K hiu: x(n), n: nguyn
x(n) ch c nh ngha ti
cc im ri rc n, khng
c nh ngha ti cc im
khc (khng c ngha l x(n)
bng 0 ti cc im )
Thng thng, x(n) = xa(nTs)
(Ts: chu k mu)
n: ch s ca mu tn hiu,
ngay c khi t/h x(n) khng
phi t c t ly mu t/h
xa(t)

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

dce

2011

Tn hiu RRTG (2)

Mt s dng biu din
1) Dng hm
x(n) =

1, n = 1, 3
4, n = 2
0, n khc

2) Dng bng
n |-2 -1 0 1 2 3 4 5
x(n) |... 0 0 0 1 4 1 0 0
3) Dng chui
: ch v tr n=0
{,0,0,1,4,1,0,0,} t/h v hn
{0,0,1,4,1,0,0}

t/h hu hn

4) Dng th
DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

dce

2011

Tn hiu RRTG c bn (1)

T/h mu n v
(xung n v)
K hiu:
(n)
nh ngha:
1 n = 0
(n ) =
0 n 0

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

dce

2011

Tn hiu RRTG c bn (2)

T/h bc n v
K hiu:
nh ngha:

u(n)

1 n 0
u(n ) =
0 n < 0

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

dce

2011

Tn hiu RRTG c bn (3)

T/h dc n v
K hiu:
nh ngha:

ur(n)

n n 0
ur ( n ) =
0 n < 0

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

dce

2011

Tn hiu RRTG c bn (4)

T/h m

nh ngha:
Hng s a
a: thc
a: phc

x(n) = an, n
x(n): t/h thc
a rej
x(n) = rnejn
= rn(cosn + jsinn)

2 cch biu din

xR(n) = rncosn
xI(n) = rnsinn
hoc
| x(n) | = rn
x(n) = n
DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

dce

2011

Tn hiu RRTG c bn (5)

T/h m x(n)=an (vi a=0.9)

gim dn khi n tng

DSP Tn hiu v h thng trong min thi gian

T/h m x(n)=an (vi a=1.5)

tng dn khi n tng

2011, inh c Anh V

10

dce

2011

Tn hiu RRTG c bn (6)

xr(n) = (1.5)ncos(n/10)

DSP Tn hiu v h thng trong min thi gian

xr(n) = (0.9)ncos(n/10)

2011, inh c Anh V

11

dce

2011

Phn loi tn hiu RRTG (1)

T/h nng lng v t/h cng sut
Nng lng ca t/h x(n)

E x = x(n )

Nu Ex hu hn (0 < Ex < ) x(n): t/h nng lng

Cng sut TB ca t/h x(n)

Nu Px hu hn (0 < Px < )

N
1
2
(
)
P = lim
x
n

2
1
N
+
N
n = N

x(n): t/h cng sut

Nng lng t/h trn khong [-N,N]

Nng lng t/h

E = limEN

Cng sut t/h

P = lim

DSP Tn hiu v h thng trong min thi gian

EN =

1
EN
2N + 1

x(n )

n = N

2011, inh c Anh V

12

dce

2011

Phn loi tn hiu RRTG (2)

T/h tun hon v khng tun hon
x(n) tun hon chu k N x(n+N) = x(n), n
Nng lng

Hu hn nu 0 n N 1 v x(n) hu hn
V hn nu n +

Cng sut hu hn
1 N 1
2
P = x(n )
N n =0
T/h tun hon l t/h cng sut
DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

13

dce

2011

Phn loi tn hiu RRTG (3)

T/h i xng (chn) v bt i xng (l)
Cho t/h x(n) thc
x(n) = x(n), n
x(n) = x(n), n

t/h chn
t/h l

Bt c t/h no cng c biu din

x(n) = xe(n) + xo(n)
Thnh phn t/h chn

xe(n) = ()[x(n) + x(n)]

Thnh phn t/h l

xo(n) = ()[x(n) x(n)]

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

14

dce

2011

T/h RRTG: Cc php ton c bn

Cc php ton c bn
Delay
Advance
Folding
Addition
Multiplication
Scaling

: lm tr (TD)
: ly trc (TA)
: o (FD)
: cng
: nhn
: co gin

DSP Tn hiu v h thng trong min thi gian

Php bin i
bin c lp (thi gian)

2011, inh c Anh V

15

dce

2011

Php lm tr Php ly trc

Php lm tr: dch theo thi

gian bng cch thay th n bi
nk
y(n) = x(nk)
k >0
y(n) l kt qu ca lm tr
x(n) i k mu
Trn th: php delay
chnh l DCH PHI chui t/h
i k mu
Php ly trc: dch theo thi
gian bng cch thay th n bi
n+k
y(n) = x(n+k)
k >0
y(n) l kt qu ca ly trc
x(n) i k mu
Trn th: php ly trc
chnh l DCH TRI chui t/h
i k mu

DSP Tn hiu v h thng trong min thi gian

x(n)

Lm
tr

Ly
trc
y(n) = x(nk)

2011, inh c Anh V

16

dce

2011

Php o Php co gin

Php o: thay th n bi n
y(n) = x(n)
y(n) l kt qu ca vic o
tn hiu x(n)
Trn th: php folding
chnh l O th quanh
trc ng
Ch
FD[TDk[x(n)]] TDk[FD[x(n)]]
Php o v lm tr khng
hon v c
Php co gin theo thi gian:
thay th n bi n ( nguyn)
y(n) = x(n)
: nguyn
y(n) l kt qu ca vic co
gin t/h x(n) h s
Php ti ly mu nu t/h x(n)
c c bng cch ly mu
xa(t)

x(n)

DSP Tn hiu v h thng trong min thi gian

o
y(n) = x(-n)

2011, inh c Anh V

17

dce

2011

Cc php ton c bn
Cho hai t/h x1(n) v x2(n) n: [,+]
Php cng
y(n) = x1(n) + x2(n)

n: [,+]

Php nhn
y(n) = x1(n).x2(n)

n: [,+]

Php co gin bin

y(n) = ax1(n)
DSP Tn hiu v h thng trong min thi gian

n: [,+]
2011, inh c Anh V

18

dce

2011

H thng RRTG
Gii thiu
Tn hiu chuyn sang dng biu din s Cn thit k
thit b, chng trnh x l n
H thng RRTG = thit b, chng trnh ni trn
y(n)

x(n)

Tn hiu vo
(Tc ng)
x(n)
DSP Tn hiu v h thng trong min thi gian

Tn hiu ra
(p ng)
y(n) = T[x(n)]
2011, inh c Anh V

19

dce

2011

H/t RRTG: M t quan h vo-ra

Ch quan tm mi quan h gia u vo u ra
Khng quan tm n kin trc bn trong ca h
Xem h nh l
y(n) = T[x(n)]
n

V d b tch ly

= x(k )

y (n )

n 1

x(k ) + x(n )

= y (n 1) + x (n )
Nu n n0 (ch tnh p ng t thi im n0),

y(n0) = y(n0 1) + x(n0)

y(n0 1): iu kin u, bng tng cc t/h p ln h/t trc thi im n0
Nu y(n0 1) = 0
h/t trng thi ngh (khng c tc ng trc n0)
DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

20

dce

2011

M t quan h vo-ra
V d khc
y(n) = x(n)
y(n) = x(n4)
y(n) = (1/3)(x(n1) + x(n) +x(n+1))
y(n) = MAX[x(n1), x(n), x(n+1)]
xc nh p ng ca cc h nu trn cho t/h x(n)
nh sau
x(n) = 1,
n: [33]
0,
n khc

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

21

dce

2011

H/t RRTG: M t s khi

Kt ni cc khi phn t c bn

B cng
x1(n)
+

y(n) =x1(n)+x2(n)

x2(n)
B tr n v
x(n)

Z1

y(n) = x(n1)

B co-gin
x(n)

y(n) = ax(n)

B nhn
B tin n v
x(n)

y(n) = x(n+1)

x1(n)
x2(n)

y(n) =x1(n).x2(n)

Du * dng ch mt php ton

khc tng chp

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

22

dce

2011

M t s khi
V d
M t bng s cu trc cho h c quan h vo ra sau:

y(n) = 2x(n) 3x(n1) + 1.5y(n1) + 2y(n2)

c t iu kin u ca h: {tr cc Z1}
y(n)

x(n)

Z1
3

1.5
+
2

DSP Tn hiu v h thng trong min thi gian

Z1

Z1

2011, inh c Anh V

23

dce

2011

H/t RRTG: Phn loi (1)

Mt h thng c gi l c tnh cht X nu tnh cht X tho
mn cho mi tn hiu vo ca h thng
H ng h tnh
H tnh

Ng xut ch ph thuc cc mu thi im hin ti (khng ph thuc

mu tng lai hay qu kh)
Khng dng b nh
Khng xut hin cc Z1 trong s khi
Khng xut hin cc x(nk) hay y(nk) trong quan h vo ra

H ng

Ng xut ti thi im n ph thuc cc mu trong [nN, n] (N 0)

H c dng b nh
C xut hin cc Z1 trong s khi
C xut hin cc x(nk) hay y(nk) trong quan h vo ra

N=0
h/t tnh
> N > 0 h/t c b nh hu hn
N=
h/t c b nh v hn
DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

24

dce

2011

H/t RRTG: Phn loi (2)

V d: h no tnh/ng ?
1.
2.
3.
4.
5.

y(n) = x(n) 3x(n3)

y(n) = nx(n) 9
y(n) = 3x(n)
y(n) = (n1)y(n1) + x(n)
y(n) = (n1)[x(n) + y(n)]

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

25

dce

2011

H/t RRTG: Phn loi (3)

H bin thin v bt bin theo thi gian
H bt bin theo thi gian

c trng vo-ra khng thay i theo thi gian

nh l:
T
H ngh T l bt bin nu v ch nu

x(n) y (n)

T
x(n k ) y (n k )

x(n), k

H bin thin theo thi gian

H khng c tnh cht trn

V d: xem xt tnh bt bin cho cc h sau

y(n) = T[x(n)] = x(n) x(n1)
y(n) = T[x(n)] = nx(n)
y(n) = T[x(n)] = x(n)
y(n) = T[x(n)] = x(n)cos(0n)
DSP Tn hiu v h thng trong min thi gian

bt bin
bin thin
bin thin
bin thin
2011, inh c Anh V

26

dce

2011

H/t RRTG: Phn loi (4)

H tuyn tnh v phi tuyn
H tuyn tnh

H tho nguyn l xp chng

nh l:
H l tuyn tnh nu v ch nu:
T[a1x1(n) + a2x2(n)] = a1T[x1(n)] + a2T[x2(n)]
ai, xi(n)
Tnh cht co gin:
nu a2 = 0 T[a1x1(n)] = a1T[x1(n)]
Tnh cht cng:
nu a1 = a2 = 1 T[x1(n) + x2(n)] = T[x1(n)] + T[x2(n)]

H phi tuyn

H khng tho mn nguyn l xp chng

y(n) = T(0) 0

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

27

dce

2011

H/t RRTG: Phn loi (5)

H tuyn tnh v phi tuyn
V d: xem xt tnh tuyn tnh ca cc h sau
y(n) = nx(n)
y(n) = x(n2)
y(n) = x2(n)
y(n) = Ax(n) + B
y(n) = ex(n)

tuyn tnh
tuyn tnh
phi tuyn
phi tuyn
phi tuyn

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

28

dce

2011

H/t RRTG: Phn loi (6)

H nhn qu v khng nhn qu
H nhn qu
H ch ph thuc cc mu hin ti v qu kh, khng
ph thuc cc mu tng lai
nh l:
H T c gi l nhn qu nu nh p ng ti n0 ch
ph thuc vo tc ng ti cc thi im trc n0 (v
d: n0 1, n0 2, )
y(n) = F[x(n), x(n1), x(n2), ]

H khng nhn qu: h khng tho nh l trn

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

29

dce

2011

H/t RRTG: Phn loi (7)

H n nh v khng n nh
H n nh
nh l:
H ngh c gi l BIBO n nh nu v ch nu mi
ng nhp hu hn s to ra ng xut hu hn
x(n): x(n) Mx <

y(n) = T[x(n)] My <

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

30

dce

2011

Bi tp
Xem xt cc tnh cht ca cc h thng sau
Tnh ng
Tuyn tnh khng tuyn tnh
Bt bin bin thin theo thi gian
Nhn qu khng nhn qu
n nh khng n nh
y(n) = cos[x(n)]
y(n) = x(n + 2)
DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

31

dce

2011

H/t RRTG: Kt ni
C th kt ni cc h RRTG nh, c bn, thnh cc
h thng phc tp hn
x(n)
y1(n)
y(n)
T1
T2
Hai cch kt ni
T
c

Ni tip

y1(n) = T1[x(n)]
y(n)
= T2[T1[x(n)]]
y(n) = T2[y1(n)]
= Tc[x(n)]
vi Tc T2T1
Th t kt ni l quan trng T2T1 T1T2
Nu T1, T2 tuyn tnh v bt bin theo thi gian
Tc T2T1 bt bin theo thi gian
T1T2 = T2T1

Song song
y(n)

= T1[x(n)] + T2[x(n)]
x(n)
= (T1+T2)[x(n)]
= Tp[x(n)]
vi TpT1+T2

DSP Tn hiu v h thng trong min thi gian

Tp
T1

y1(n)
+

T2

y(n)

y2(n)

2011, inh c Anh V

32

dce

2011

Phn tch h/t tuyn tnh LTI

K thut phn tch h/t tuyn tnh

Biu din quan h vo/ra bng phng trnh sai phn v gii PT ny
Phn tch t/h nhp thnh tng cc t/h c s sao cho p ng ca h/t
i vi cc t/h c s l xc nh trc.
Nh tnh cht tuyn tnh ca h/t, p ng ca h/t i vi t/h nhp n gin bng
tng cc p ng ca h/t vi cc t/h c s

Phn gii t/h nhp x(n) = ck xk (n)

k

gi s yk(n) = T[xk(n)]

y (n )

= T [ x(n)]
= T [ ck xk (n)]
k

= ckT [ xk (n)]
k

y (n ) = c k y k (n )
k

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

33

dce

2011

H/t LTI Phn gii t/h nhp

Phn gii t/h nhp ra p ng xung n v

Chn cc t/h thnh phn c s
Ta c
x(n)(nk) = x(k)(nk)

Biu thc phn tch t/h x(n)

x (n )
=

xk(n) = (nk)

x(k ) (n k )

k =

V d:
th

x(n) = {2 4 3^ 1}
x(n) = 2(n+2) + 4(n+1) + 3(n) + (n1)

p ng ca h/t LTI vi t/h nhp bt k: tng chp (convolution sum)

p ng y(n, k) ca h/t vi xung n v ti n=k c biu din bng h(n, k)

y(n, k) h(n, k) = T[(nk)]
< k <
n: ch s thi gian
k: tham s ch v tr xung n v

Nu t/h nhp c co gin h s ck x(k), p ng ca h/t cng co gin

ckh(n, k) = x(k)h(n, k)

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

34

dce

2011

H/t LTI Tng chp (1)

= T [ x(n)]

y (n )

x(n)

LTI

y(n)

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

x(k )T [ (n k )]

k =

x(k )h(n,k )

k =

Biu thc trn ng vi mi h/t tuyn tnh ngh (bt bin hoc bin
thin)
i vi h LTI, nu h(n) = T[(n)] th h(nk) = T[(nk)]
y (n )
=

x(k )h(n k )

k =

H/t LTI c c trng hon ton bng hm h(n)

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

35

dce

2011

H/t LTI Tng chp (2)

Cch tnh ng xut ca h/t ti mt thi im n0

=
y (n0 )

x(k )h(n

k =

k)

1. o: h(k) h(k): i xng h(k) quanh trc k=0

2. Dch:
h(k) h(k + n0)
: dch h(k) i mt on
n0 sang phi (tri) nu n0 dng (m)
3. Nhn:
vn0(k) = x(k) h(k + n0)
4. Cng:
tng tt c chui vn0(k)

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

36

dce

2011

H/t LTI Tng chp (3)

Trong biu thc tng chp, nu thay m=nk (tc
k=nm), ta c
y (n ) =

x (n m )h(m ) =

m =

x(n k )h(k )

k =

Cng thc ny cho cng kt qu nh cng thc tng chp,

nhng th t tnh ton khc nhau
Nu
vn(k) = x(k)h(nk)
vn(k) = wn(nk)
wn(k) = x(nk)h(k)

=
y (n )

=
v (k ) w

k =

k =

DSP Tn hiu v h thng trong min thi gian

(n k )
2011, inh c Anh V

37

dce

2011

H/t LTI Tng chp (4)

Tm tt

x(n)

y(n)
LTI: h(n)

h(n) : Hm p ng xung n v ca h LTI

y ( n)

= x ( n) * h( n)
=

x ( k ) h( n k )

k =

DSP Tn hiu v h thng trong min thi gian

y ( n)

= h( n) * x ( n)
=

x ( n k ) h( k )

k =

2011, inh c Anh V

38

dce

2011

H/t LTI Tnh cht tng chp

Giao hon x(n)*h(n) = h(n)*x(n)
h(n)

y(n)

x(n)
h(n)

Kt hp

x(n)

[x(n)*h1(n)]*h2(n) = x(n)*[h1(n)*h2(n)]

Giao hon

Kt hp

y(n)

h1(n)

h2(n)

h2(n)

h1(n)

h(n) = h1(n)*h2(n)

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

39

dce

2011

V d
Xc nh p ng xung n v ca h thng
c cu trc bng cch ni tip ca cc h
thng c p ng xung n v
1
2

h1 ( n) = ( ) n u( n)

DSP Tn hiu v h thng trong min thi gian

1
4

h2 ( n) = ( ) n u( n)

2011, inh c Anh V

40

dce

2011

H/t LTI Tnh cht tng chp

Phn phi
x(n)*[h1(n) + h2(n)] = x(n)*h1(n) + x(n)*h2(n)

h1(n)
x(n)

y(n)

x(n)
Phn phi

y(n)
h(n) = h1(n) + h2(n)

h2(n)

V d: dng tng chp, xc nh p ng ca h thng

x(n) = anu(n) v h(n) = bnu(n) trong c 2 trung hp a=b v ab

x(n) = {0, 1, 2^, 1, 1, 0} v h(n) = (n) (n1) + (n4) + (n5)

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

41

dce

2011

H/t LTI Tnh nhn qu

Mt h LTI l nhn qu nu v ch nu cc p ng xung ca n bng 0

i vi cc gi tr m ca n [tc, h(n) = 0, n < 0]

=
y (n)
Chng minh

k =0

k =

( n k ) x ( k )h ( n k )
h(k ) x=

Ng xut ca h/t ti thi im n0

=
y ( n0 )
=

h(k ) x(n

k =

h(k ) x(n
k =0

k)

k) +

h(k ) x(n

k =

k)

Thnh phn tng th 2 bao gm cc t/h tng lai i vi n0. H nhn qu nu

h(n)=0 n < 0

Qui c

Chui bng 0 n < 0

Chui khc 0 n: n<0 v n>0

DSP Tn hiu v h thng trong min thi gian

chui nhn qu
chui khng nhn qu
2011, inh c Anh V

42

dce

2011

H/t LTI Tnh nhn qu

Nu t/h nhp l chui nhn qu [x(n) = 0, n < 0]
=
y (n)

( n k ) x ( k )h ( n k )
h(k ) x=

=
k 0=
k 0

p ng ca h/t nhn qu vi chui nhn qu l nhn qu

[y(n) = 0, n<0]

V d: xc nh p ng ca h/t c h(n)=(bn+1)u(n)
i vi t/h x(n)=anu(n)
x(n) v h(n) u l chui nhn qu

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

43

dce

2011

H/t LTI Tnh n nh

H LTI l n nh nu hm p ng xung n v l kh tng
tuyt i

=
y ( n ) x ( n k )h ( k )
Ta c
k =

x(n ) M x

Chng minh

y (n ) =

x ( n k )h ( k )

k =

y (n ) M y <

k =

x(n k ) h(k ) M x

n=
u Sh

h(k )

k =

h(k ) <

k =

V d: xc nh tm gi tr a, b sao cho h LTI sau n nh

a n

h=
(n) 1
b n

n0
1 n < 0
n < 1

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

44

dce

2011

H/t LTI FIR v IIR

H c p ng xung hu hn FIR (Finite-duration Impulse
Response)
h(n) = 0 n: n < 0 v n M

=
y (n)

M 1

h(k ) x(n k )
k =0

H FIR c b nh di M

H c p ng xung v hn IIR (Infinite-duration Impulse

Response)
Gi s h/t c tnh nhn qu

=
y (n)

h(k ) x(n k )
k =0

H IIR c b nh v hn
DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

45

dce

2011

H/t RRTG qui

Trung bnh tch ly ca t/h x(n) trong khong 0 k n

1 n
y (n) =
x(k )

n + 1 k =0
Vic tnh y(n) i hi lu tr tt c gi tr ca x(k)
khi n tng, b nh cn thit cng tng

Cch khc tnh y(n): qui

( n + 1) y ( n=
)

n 1

x(k ) + x(n=)

n yn
( 1) + x ( n )

k =0

x(n)

n
1
=
y (n)
y ( n 1) +
x(n)
n +1
n +1
y(n0 1): iu kin u

y(n)

1
n+1

Z1

H/t qui l h c y(n) ph thuc khng ch t/h nhp m cn gi tr qu

kh ca ng xut

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

46

dce

2011

H/t RRTG Khng qui

H/t khng qui nu
y(n) = F[x(n), x(n1), , x(nM)]
Khc nhau c bn gia h/t qui v h/t khng qui

x(n)

F[x(n), x(n1), , x(nM)]

y(n)

x(n)

F[x(n), x(n1), , x(nM),

y(n1), y(n2), , y(nN)]

y(n)

Z-1

ngha
H/t qui phi tnh cc gi tr ng xut qu kh trc
H/t khng qui c th xc nh gi tr ng xut thi im bt k m
khng cn tnh gi tr ng xut qu kh
H qui: h tun t
H khng qui: h t hp

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

47

dce

2011

H/t LTI RRTG PT sai phn h s hng

Tp con ca h/t qui v khng qui

V d h/t qui c m t bi PTSP bc 1: y(n) = ay(n1) + x(n)
Phng trnh xut nhp cho h LTI
Tc ng vo h/t t/h x(n) n 0 v gi s tn ti y(1)

y(0) = ay(1) + x(0)

y(1) = ay(0) + x(1) = a2y(1) + ax(0) + x(1)

y(n) = ay(n1) + x(n) = an+1y(1) + anx(0) + an-1x(1) + + ax(n1) + x(n)

Hoc
n

y (=
n) a n +1 y (1) + a k x(n k )

n 0

k =0

Nu h/t ngh ti n=0, b nh ca n bng 0, do y(1) = 0

B nh biu din trng thi h/t h/t trng thi 0 (p ng trng thi 0 hoc p
ng cng bc yzs(n))

=
y zs (n)

x(n k )

k =0

y l tch chp ca x(n) v h(n) = anu(n)

p ng trng thi 0 ph thuc bn cht h/t v t/h nhp

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

48

dce

2011

H/t LTI RRTG PT sai phn h s hng

Nu h/t khng ngh [tc y(1) 0] v x(n) = 0 n: h thng
khng c t/h nhp
p ng khng ng nhp (hay p ng t nhin) yzi(n)
y=
a n +1 y (1)
zi ( n)

H/t qui vi iu kin u khc khng l h khng ngh, tc n vn

to ra p ng ng ra ngay c khi khng c t/h nhp (p ng ny do
b nh ca h/t)
p ng khng ng nhp c trng cho chnh h/t: n ph thuc bn
cht h/t v iu kin u
y ( n ) y zi ( n ) + y zs ( n )
Tng qut =

Dng tng qut ca PTSPTT HSH

N

y (n) =
ak y ( n k ) + bk x ( n k )

=
k 1=
k 0

hoac

N: bc ca PTSP

y (n =
k)

b x(n k )

k
=
k 0=
k 0

DSP Tn hiu v h thng trong min thi gian

( a0 1)
2011, inh c Anh V

49

dce

2011

H/t LTI RRTG PT sai phn h s hng

Xem li cc t/cht tuyn tnh, bt bin thi gian v n nh
ca h/t qui c m t bng PTSP TT HSH
H qui c th ngh hay khng ty vo iu kin u

Tuyn tnh

H l tuyn tnh nu n tha

1. p ng ton phn bng tng p ng trng thi khng v p ng khng

ng nhp
y(n) = yzs(n) + yzi(n)
2. Nguyn tc xp chng p dng cho p ng trng thi khng (tuyn tnh
trng thi khng)
3. Nguyn tc xp chng p dng cho p ng khng ng nhp (tuyn tnh
khng ng nhp)

H khng tho mt trong 3 /k trn l h phi tuyn

H qui c m t bng PTSP HSH tha c 3 /k trn tuyn tnh

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

50

dce

2011

H/t LTI RRTG PT sai phn h s hng

V d: xt tnh cht tuyn tnh ca h y(n) = ay(n1) + x(n)

/k 1.

y zs ( n )
=

a
k =0
n +1

y zi (=
n) a

y ( 1)

/k 2.
Gi s x(n) = c1x1(n) + c2x2(n)

y zs=
(n)

n 0
y ( n ) = y zs ( n ) + y zi ( n )
n 0

x(n k )

x ( n=
k)

=
k 0=
k 0
n

[c1 x1 ( n k ) + c2 x2 ( n k )]
n

= c1 a x1 ( n k ) + c2 a k x2 ( n k )
k

=
k 0=
k 0

= c1 y zs(1) ( n ) + c2 y zs(2) ( n )

/k 3.
Gi s y(1) = c1y1(1) + c2y2(1)

x(n)

y(n)

)
1) a n +1[c1 y1 ( 1) + c2 y2 ( 1)]
y zi ( n=
a n +1 y ( =
= c1a n +1 y1 ( 1) + c2a n +1 y2 ( 1)

Z1

= c1 y zi(1) ( n ) + c2 y zi(2) ( n )

Vy y(n) tuyn tnh

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

51

dce

2011

H/t LTI RRTG PT sai phn h s hng

Bt bin thi gian

n nh

ak v bk l hng s PTSP HSH l bt bin theo thi gian

H/t qui c m t bng PTSP HSH l LTI

H/t BIBO n nh nu v ch nu vi mi ng nhp hu hn v mi iu kin u hu

hn, p ng ca ton h/t l hu hn
V d: xc nh gi tr a h/t y(n) = ay(n1) + x(n) n nh
Gi s x(n) Mx <

y (=
n) a

n +1

n 0

y (1) + a x(n k )
k

n +1

y (1) +

k
a
x(n k )

=
k 0=
k 0

n +1

n +1

y (1) + M x a
y (1) + M x

1 a

n +1

1 a

My

n hu hn My hu hn v y(n) hu hn c lp vi gi tr a
Khi n, My hu hn ch nu a< 1 My = Mx/(1 a)
Vy h/t ch n nh nu a< 1

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

52

dce

2011

Gii PT sai phn tuyn tnh h s hng

Xc nh biu thc chnh xc ca y(n) khi bit x(n)
(n0) v tp cc /k u
2 phng php
Gin tip: bin i Z
Trc tip

Phng php trc tip

p ng ton phn y(n) = yh(n) + yp(n)
yh(n): p ng thun nht, khng ph thuc x(n) (x(n) = 0)
yp(n): p ng ring phn, ph thuc x(n)

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

53

dce

2011

p ng thun nht (1)

N

y (n k ) =
0

Gi s x(n) = 0

Cch gii PTSP TT HSH tng t cch gii PT vi phn TT HSH

Gi s p ng c dng yh(n) = n

k =0

PTSP thun nht

( nk )
a
=0

k
k =0

n N ( N + a1 N 1 + a2 N 2 + + aN 1 + aN ) =
0
hoc
Biu thc trong ngoc n: a thc c trng ca h/t
PT ny c N nghim 1, 2, , N
Dng tng qut nht ca nghim PTSP thun nht (gi s cc nghim
n ring bit)
yh ( n=
) C11n + C2 2n + + C N Nn
Ci c th c xc nh nh vo cc /k u ca h/t
Nu 1 l nghim bi bc m,
yh ( n=
) C11n + C2 n1n + C3 n 2 1n + + Cm n m 11n + Cm +1mn +1 + + C N Nn

PT ny c th c dng xc nh p ng khng ng nhp ca h/t

(bi v x(n) = 0)
DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

54

dce

2011

p ng thun nht (2)

V d

y(n) + a1y(n1) = x(n)

Cho x(n) = 0 v gi s yh(n) = n

n +a1n1 = 0
n1(+a1) = 0
= a1
p ng ng dng yh(n) = Cn = C(a1)n
Mt khc,
y (0) =
a1 y (1)

yh (0) = C

Do

C=
a1 y (1)

y zi (n) = (a1 ) n +1 y (1)

n 0

V d khc
y(n) 2y(n1) 3y(n2) = x(n) + 2x(n1)
DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

55

dce

2011

p ng ring phn

p ng ring phn yp(n) tho mn PT

N

a y

(n =
k)

b x(n k )

k p
=
k 0=
k 0

a0 1

V d y(n) + a1y(n1) = x(n)

xc nh yp(n) khi x(n) = u(n)

(a1< 1)

p ng ring phn c dng yp(n) = Ku(n)

K: h s co gin
Ku(n) + a1Ku(n1) = u(n)
Khi n 1, ta c
K + a1K = 1
K = 1/(1+a1)
p ng ring phn

y p ( n) =

1
u ( n)
1 + a1

x(n)

yp(n)

Dng tng qut ca p ng

ring phn

AMn

KMn

V d khc

AnM

K0nM + K1nM-1 + + KM

AnnM

An(K0nM + K1nM-1 + + KM)

y(n) = 5/6y(n1) 1/6y(n2) + x(n)

Vi x(n) = 2nu(n)

Acos0n
Asin0n

DSP Tn hiu v h thng trong min thi gian

K1cos0n + K2sin0n
2011, inh c Anh V

56

dce

2011

p ng ton phn

V d: xc nh p ng ton phn ca PTSP

vi x(n) = u(n) v y(1) l /k u

y(n) + a1y(n1) = x(n)

Theo trn, ta c

yh (n=
) C (a1 ) n
1

y (n) =C (a1 ) n +

1 + a1
y p ( n) = 1 + a
1

Mun xc nh p ng trng thi khng, ta cho y(1) = 0

1
y (0) + a1 y (1) =

1
y (0)= C +
1 + a1
1 (a1 ) n +1
=
y zs (n)
Vy
1 + a1

n0

a1
C=
1 + a1

n0

Nu tm C di /k y(1) 0, p ng ton phn s bao gm p ng trng thi

khng v p ng khng ng nhp

1
y (0) + a1 y (1) =

1
y (0)= C +
1 + a1

a
C =a1 y (1) + 1
1 + a1

DSP Tn hiu v h thng trong min thi gian

y ( n)

=(a1 )

n +1

1 (a1 ) n +1
y (1) +
n0
1 + a1

= y zi (n) + y zs (n)
2011, inh c Anh V

57

dce

2011

Gii PT sai phn tuyn tnh h s hng

Ngoi ra, c th xc nh p ng ring phn t p
ng trng thi khng
1
=
=
y p (n) lim
y zs (n)
n
1 + a1
yp(n) 0 khi n: p ng trng thi u
yp(n) = 0 khi n: p ng tim cn

Bi tp: xc nh p ng y(n), n0, ca h thng

y(n) 2y(n1) 3y(n2) = x(n) + 2x(n1) i vi ng
nhp x(n) = 4nu(n)
DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

58

dce

2011

p ng xung ca h/t qui LTI

x(n) = (n)

y zs (n) =

h( k ) x ( n k )

(n 0 )

k =0
n

h(k ) (n k )

k =0

= h( n)

yp(n) = 0 v x(n) = 0 khi n > 0

h(n) = yh(n)
Bt k h/t qui no c m t bng PTSP TT HSH u l IIR
N
p ng thun nht
n

yh ( n ) h ( n ) =
Ck k
k =1

{Ci} c xc nh nh /k u y(-1) = y(-2) = = y(-N) = 0

Tnh n nh

/k cn v cho s n nh ca mt h/t nhn qu IIR c m t bi PTSP TT HSH l tt c cc

nghim ca a thc c trng c gi tr tuyt i nh hn n v

N
N

CM

=
h( n)
=
n 0

C
k

n
k

Ck

=
=
n 0=
k 1
k 1

n
k
k
=
n 0=
n 0

=
n 0

n
k

Nu < 1k < h(n) <

Ngc li nu 1, h(n) khng cn kh tng, tc h/t khng n nh
DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

59

dce

2011

Hin thc h RRTG Cu trc

V d: Xt h bc 1

x(n)

b0

y(n) = a1y(n1) + b0x(n) + b1x(n1)

S cu trc

H1

Z-1
-a1

b1
H1
x(n)

b0

Z-1

Hon v hai h con

y(n)

Z1

-a1

H2

b1
H2

Gp hai nh
H3

y(n)

Z1

Cu trc trc tip dng 1

v(n) = b0 x(n) + b1 x(n 1)

a1 y (n 1) + v(n)
y ( n) =

v(n)

x(n)

Cu trc trc tip dng 2

(dng chun tc)

a1w(n 1) + x(n)
w(n) =

y (n) = b0 w(n) + b1w( n 1)

DSP Tn hiu v h thng trong min thi gian

w(n)

-a1

b0

y(n)

Z-1
b1
H3
2011, inh c Anh V

60

dce

2011

Hin thc h RRTG Cu trc

N

y (n ) =
ak y (n k ) + bk x (n k )

k 1=
k 0
=

Dng I
x(n)

b0

a1
+

bM1
Z-1

bM

Z-1

Z-1

a1

Z-1

+
Z-1

+
aN

Z-1

nh: M+N

b1
b2

y(n)

+
+

bM

+
aN1

Dng II
b0

a2
a2

x(n)

Z-1
b2

y(n)

Z-1
b1

aN1

Z-1

aN

Z-1

nh: Max(M,N)
Hon v

DSP Tn hiu v h thng trong min thi gian

Gp nh
2011, inh c Anh V

61

dce

2011

Hin thc h RRTG Cu trc

y ( n)
Khi ak = 0 =

b x(n k )
k =0

bk
h( n) =
0

h FIR khng qui vi

0k M
k khc

H bc 2: y(n) = a1y(n1) a2y(n2) + b0x(n) + b1x(n1) + b2x(n2)

x(n)
x(n)

b0

+
+

a1
a2

Z-1
Z-1

b1

y(n)

Z-1
b0

Z-1
b1

b2
+

+
a1=a2=0: h FIR

y(n)

b2

x(n) b0

+
a1

y(n)

+
a2
Z-1

Z-1

b1=b2=0: h qui thun

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

62

dce

2011

Hin thc h FIR bt qui

Hin thc khng qui
=
y ( n)

b x(n k )
k =0

p ng xung h(k) = bk
(0 k M)
V d
1 M
=
y ( n)
x(n k )

M + 1 k =0
1
=
0nM
h( n)
M +1
x(n)

Z1

Z1

Z1

DSP Tn hiu v h thng trong min thi gian

Z1

y(n)
1
M+1

2011, inh c Anh V

63

dce

2011

Hin thc h FIR qui

Hin thc qui
Bt k h/t FIR no cng c thc hin theo kiu qui
V d
1 M
=
y ( n)

x(n k )

M +1
k =0

1 M
1
(
1
)
[ x(n) x(n 1 M )]
=

+
x
n
k

M + 1 k =0
M +1
1
[ x(n) x(n 1 M )]
= y (n 1) +
M +1
x(n)

Z1

Z1

x(n1M)

Z1
+

+ 1
M+1

DSP Tn hiu v h thng trong min thi gian

y(n)

+
Z1

2011, inh c Anh V

64

dce

2011

Tng quan gia cc t/h RRTG

ng dng

nh ngha

o lng s ging nhau gia cc tn hiu

Trong cc lnh vc: truyn tn hiu, radar, sonar,
T/h pht
T/h nhn

D
w(n)

x(n)
y(n) = x(nD) +w(n)
: h s suy gim t/h
: thi gian tr truyn
: nhiu ng truyn

rxy (l )
=

y(n) so vi x(n)

rxy (l )
=

Tng quan
cho

=
ryx (l )
x(n) so vi y(n)

=
ryx (l )
DSP Tn hiu v h thng trong min thi gian

x ( n) y ( n l )

n =
+

x ( n + l ) y ( n)

n =
+

y ( n) x ( n l )

n =
+

y ( n + l ) x ( n)

n =

2011, inh c Anh V

65

dce

2011

Tng quan Gii thut

Cc bc tnh s tng quan gia y(n) so vi x(n)

1.

2.
3.

c y(nl), dch y(n) sang

+ phi nu l dng
+ tri nu l m
Nhn: vl(n) = x(n)y(nl)
Cng: tng cc vl(n)

Dch:

Nhn xt

rxy(l) = ryx(l)

ryx(l) l o ca rxy(l) qua trc l = 0

So vi tnh tch chp, php tnh tng quan khng phi thc hin
php o

C th dng gii thut tnh tch chp tnh tng quan v ngc li
rxy(l) = x(l)*y(l)

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

66

dce

2011

Tng quan V d
V d: Tm rxy(l), ryx(l) ?
x(n) = { 0 1 3 1^ 0 }
y(n) = { 0 1^ 3 1 0 }
rxy(l) = { 0 1 6 11 6 1^ 0 }
Max:
rxy(2) = 11
y(n) ging vi x(n) nht khi y(n) dch tri 2 mu
ryx(l) = { 0 1^ 6 11 6 1 0 }
Max:
ryx(2) = 11
x(n) ging vi y(n) nht khi x(n) dch phi 2 mu

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

67

dce

2011

T tng quan
T tng quan
=
r (l )
xx

=
rxx (l )

x ( n) x ( n l )

n =
+

x ( n + l ) x ( n)

n =

rxx (=
l ) rxx (l )

Tng quan ca chui nhn qu di N [i.e x(n)=y(n)=0 khi

n<0 v nN]
=
rxy (l )

=
rxx (l )

N k 1

x(n) y (n l )

n =i

N k 1

=
,k 0
i l =
Vi
=
k l
i 0,=

l0
l<0

x(n) x(n l )

n =i

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

68

dce

2011

Tng quan Tnh cht (1)

Tnh cht ca s tng quan gia cc t/h nng lng
Nng lng ca t/h chnh l s t tng quan ti l = 0

=
rxx (0)

2
=
x
( n) E x

n =

Trung bnh nhn ca nng lng l gi tr ln nht ca chui tng

quan

rxy (l ) Ex E y

rxx (l ) Ex rxx (0)

Chui tng quan chun ha khng ph thuc vo s co gin ca t/h
(xy(l) 1 v xx(l) 1)

xy (l ) =

rxy (l )
Ex E y

DSP Tn hiu v h thng trong min thi gian

rxx (l )
xx (l ) =
Ex
2011, inh c Anh V

69

dce

2011

Tng quan Tnh cht (2)

Tng quan ca t/h tun hon
Cho x(n) v y(n) l 2 t/h cng sut

M
1
rxy (l ) lim
x ( n) y ( n l )
=

M 2 M + 1
n= M
M
1
rxx (l ) lim
x ( n) x ( n l )
=

M 2 M + 1
n= M

Nu x(n) v y(n) tun hon chu k N

rxy(l) v rxx(l) tun hon chu k N
N 1

1
rxy (l )
=
N

x ( n) y ( n l )

1
(
)
rxx l
=
N

N 1

n =0

x ( n) x ( n l )
n =0

T/c ny c dng xc nh chu k ca t/h (SV c thm)

DSP Tn hiu v h thng trong min thi gian

2011, inh c Anh V

70