Bi ging: X l s tn hiu

Chng 4

X L TN HIU MIN THI GIAN

Ni dung:
4.1 p ng xung ca h thng ri rc
4.1.1 p ng xung
4.1.2 Cc phng php tnh tch chp
4.1.3 p ng xung ca h thng ghp ni
4.1.4 S n nh ca h thng
4.2. H thng FIR v IIR
4.2.1 H thng FIR
4.2.2 H thng IIR
4.3. Phng php x l mu
4.3.1 X l mu cho h thng FIR
4.3.2 X l mu cho h thng IIR
Bi tp
5/22/2010

Bi ging: X l s tn hiu
Chng 4

X L TN HIU MIN THI GIAN

4.1 p ng xung ca h thng ri rc:

4.1.1 p ng xung (impulse response):
p ng xung ca h thng chnh l tn hiu ra khi tn hiu vo l xung n v.
h(n) th hin c tnh thi gian ca h thng ri rc.
H thng
Tn hiu vo

(n)

Tn hiu ra

ri rc

h(n)
1

-1

-1

Quan h ng vo- ng ra trong min thi gian:

y (n) = h(n) x(n) = x(n) h(n) =

x(k )h(n k )

k =

5/22/2010

Bi ging: X l s tn hiu
Chng 4

X L TN HIU MIN THI GIAN (tt)

4.1 p ng xung ca h thng ri rc:

4.1.2 Cc phng php tnh tch chp:
a. Tnh trc tip:
Dng trc tip nh ngha tch chp
V d 1: Tm p ng ng ra y(n) khi bit:

x(n) = u(n);
h(n) = anu(n), |a|<1.

Li gii:
Ta c:

y (n) = h(n) x(n) =

x(k )h(n k ) =

k =

h(k ) x(n k )

k =

1 a n +1
= a u ( k )u ( n k ) = a =
, | a |< 1; n 0

a
1
k =
k =0
y (n ) = 0, n < 0

5/22/2010

Bi ging: X l s tn hiu
Chng 4

X L TN HIU MIN THI GIAN (tt)

4.1.2 Cc phng php tnh tch chp:

b. Dng bng tch chp:
Lp bng tch chp c dng nh sau:

x0
x1
x2
x3
x4
x5
x6
h0 h0x0 h0x1 h0x2 h0x3 h0x4 h0x5 h0x6
h1y0 h1x0 h1x1 h1x2 h1x3 h1x4 h1x5 h1x6
h2y1 h2x0 h2x1 h2x2 h2x3 h2x4 h2x5 h2x6
y2

y8
y7
y9
y4
y5

y6
y3
Tnh gi tr ng ra:

y0 = h0x0;
y1 = h1x0+ h0x1;
y2 = h2x0 + h1x1+ h0x2, vv

5/22/2010

Bi ging: X l s tn hiu
Chng 4

X L TN HIU MIN THI GIAN (tt)

4.1.2 Cc phng php tnh tch chp:

Chiu di L

b. Dng bng tch chp:

V d 2: Tm p ng ng ra y(n) khi bit:

x(n) = [1,1,2,1,2,2,1,1];
h(n) = [1,2,-1,1].

Li gii:

Chiu di M

Lp bng tch chp:

h\x

-1

-1

-1

-2

-1

-2

-2

-1

-1

Ng ra:
5/22/2010

y(n) = [1, 3, 3, 5, 3, 7, 4, 3, 3, 0, 1]

Chiu di L+M-1
5

Bi ging: X l s tn hiu
Chng 4

X L TN HIU MIN THI GIAN (tt)

4.1.2 Cc phng php tnh tch chp:

b. Dng khi cng chng lp (overlap-add block form):
dng khi chui d liu ng vo rt di
L
x:

Khi x0

y0:

Khi x1

Khi x2

M
y1:

M
y2:

n=0

n=L

Cc gi tr ng ra:
5/22/2010

n = 2L

M
n = 3L

y0 = h*x0; y1 = h*x1.; .
6

Bi ging: X l s tn hiu
Chng 4

X L TN HIU MIN THI GIAN

V d 3: Tm p ng ng ra y(n) khi bit:

x(n) = [1,1,2,1,2,2,1,1];
h(n) = [1,2,-1,1].
Chia d liu ng vo thnh cc khi nh u nhau (L = 3).
Chn thm
x0 = [1,1,2];

x1 = [1,2,2];

zeros

x2 = [1,1,0];

Chp mi khi nh vi h, ta c: (dng bng cng chng lp)

y0 = h*x0 = [1,3,3,4,-1,2];

h \ x

y1 = h*x1 = [1,4,5,3,0,2];

-1

-1

-2

-1

y2 = h*x2 = [1,3,1,0,1,0];
Lp bng cng chng lp:

5/22/2010

y0
y1
y2

4
1

-1
4

2
5

10

3
1

0
3

2
1

1
7

Bi ging: X l s tn hiu
Chng 4

X L TN HIU MIN THI GIAN (tt)

4.1.3 p ng xung ca h thng ghp ni:

a. Hai h thng ghp ni tip:
x(n)

h1(n)

h2(n)

y (n)

x(n)

x(n)

h1(n)

h2(n)

y (n)

x(n)

h1(n)*h2(n)

h2(n)

h1(n)

y (n)

y (n)

b. Hai h thng ghp song song:

x(n)

h1(n)

y (n)

x(n)

h1(n) + h2(n)

y (n)

h1(n)
5/22/2010

Bi ging: X l s tn hiu
Chng 4

X L TN HIU MIN THI GIAN (tt)

4.1.3 p ng xung ca h thng ghp ni:

V d 4: Cho h thng nh hnh v, bit rng:
h1(n) = [1,2,1];
h2(n) = h3(n) = (n+1)u(n);
h1(n)
h4(n) = (n-2)
x(n)
Xc nh p ng xung h(n) ?
Li gii:
Ta c:

h2(n)

_
h3(n)

y (n)

h4(n)

h(n) = h1(n)*[h2(n)-h3(n)*h4(n)] = h1(n)*h2(n)*[1-h4(n)]

Nhn xt: x(n) chp vi (n-k) tng ng vi vic dch x(n) i k mu

Do vy:
h1(n)*h2(n) = [(n+1)u(n)]*[(n) + 2(n-1) + (n-2)]
= (n+1)u(n) + 2nu(n-1) + (n-1)u(n-2)
h1(n)*h2(n)*h4(n) = [(n+1)u(n) + 2nu(n-1) + (n-1)u(n-2)]*(n-2)
= (n-1)u(n-2) + 2(n-2)u(n-3) + (n-2)u(n-4)
Thay vo biu thc trn, ta c:
h(n) = (n+1)u(n) + 2nu(n-1) -2(n-2)u(n-3) - (n-3)u(n-4)
5/22/2010

Bi ging: X l s tn hiu
Chng 4

X L TN HIU MIN THI GIAN (tt)

4.1.4 S n nh ca h thng:
h thng c gi l n nh (stable) nu n lun c p ng b chn vi mi
kch thch b chn. Ngha l:
Nu:

| x(n) | M x

th:

| y (n) | M y , n

iu kin h thng LTI c p ng xung h(n) n nh :

| h(n) | <

n =

V d 5: Cho h thng c p ng xung: h(n) = anu(n).

Tm iu kin ca a h thng n nh ?
Li gii:
h thng n nh:

n =

n=0

n
2
|
h
(
n
)
|
=
|
a
|
=
1
+
|
a
|
+
|
a
|
+.... <

iu kin trn c tha mn khi : |a| < 1. Lc :

5/22/2010

| h(n) |=

n =

1
1 | a |
10

Bi ging: X l s tn hiu
Chng 4

X L TN HIU MIN THI GIAN (tt)

4.2 H thng FIR v IIR:

da vo p ng xung h(n), ngi ta chia cc h thng ri rc ra lm 2 loi:
H thng c p ng xung hu hn FIR (Finite Impulse Response).
H thng c p ng xung v hn IIR (Infinite Impulse Response).
4.2.1 H thng FIR: (b lc FIR)
p ng xung h(n) c gi tr trn khong thi gian hu hn 0 n M, ngha l:

h(n) = [h0 , h1 , h2 ,..., hM , 0, 0,...]

trong :

M: bc ca b lc

chiu di ca
vector p ng
xung l M+1

h0,h1,h2,hM: h s ca b lc (filter weights, filter taps)

Phng trnh b lc FIR:

y (n) = h(n) x(n) =

Phng trnh I/O:

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

y ( n ) = h 0 x ( n ) + h1 x ( n 1) + h 2 x ( n 2 ) + ... + h M x ( n M )
5/22/2010

11

Bi ging: X l s tn hiu
Chng 4

X L TN HIU MIN THI GIAN (tt)

4.2 H thng FIR v IIR (tt):

V d 6:
a. B lc FIR c p ng xung h(n) = [1,2,1,-3].
Phng trnh I/O: y(n) = x(n) + 2x(n-1) + x(n-2) - 3x(n-3)
b. B lc FIR phng trnh I/O: y(n) = x(n) - x(n-4)
p ng xung ca b lc h(n) = [1,0,0,0,-1].
4.2.1 H thng IIR: (b lc IIR)
c khong thi gian p ng xung h(n) v hn.
Phng trnh b lc IIR:

y (n) = h(n) x(n) =

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

hay:

y (n) =

k =1

ak y (n k ) +

l=0

bl x ( n l )

Phng trnh I/O:

y(n) = a1 y(n 1) + a2 y(n 2) +... + aM y(n M) + b0 x(n) + ... + bL x(n L)

5/22/2010

12

Bi ging: X l s tn hiu
Chng 4

X L TN HIU MIN THI GIAN (tt)

4.2 H thng FIR v IIR (tt):

V d 7: B lc c biu din dng quy sau c phi l b lc IIR khng?
y(n) = 0.25y(n-2) + x(n)
Li gii:
p ng xung:
h(n) = 0.25h(n-2) + (n)
Gi s h thng l nhn qu: h(-1) =h(-2) = 0.
B lc nhn qu:
Lc :
h(n) = 0, n<0
h(0) = 0.25h(-2) + (0) = 1;
h(1) = 0.25h(-1) + (1) = 0;
h(2) = 0.25h(0) + (2) = 0.25 = (0.5)2;
h(3) = 0.25h(1) + (3) = 0;
h(4) = 0.25h(2) + (2) = (0.25)2= (0.5)4, vv.
Suy ra dng biu thc ca h(n):

0
h( n) =
n
(0.5)

n : odd
n : even

V h(n) tn ti v hn nn y l b lc IIR.
5/22/2010

13

Bi ging: X l s tn hiu
Chng 4

X L TN HIU MIN THI GIAN (tt)

4.3 Phng php x l mu:

4.3.1 Phng php x l mu v phng php x l khi:
Phng php x l khi (Block processing methods)
D liu ng vo c thu thp v x l theo tng khi.
Qu trnh x l: thc hin vic nhn chp tng khi ng vo vi p ng xung
ca h thng cho khi d liu ra.
ng dng: x l nh, phn tch ph dng FFT,vv
Phng php x l mu (Sample processing methods)
D liu c thu thp v x l tng mu tng thi im
Qu trnh x l: mi mu d liu ng vo c h thng x l cho ra mu
d liu ng ra.
Dng trong cc ng dng x l thi gian thc (real time processing).
ng dng: x l tn hiu thch nghi, iu khin, vv
5/22/2010

14

Bi ging: X l s tn hiu
Chng 4

X L TN HIU MIN THI GIAN (tt)

4.3.2 Phng php x l mu cho b lc FIR:

B lc FIR bc M:

h(k ) x(n k )

y (n) = h(n) x(n) =

k =0

y ( n ) = h 0 x ( n ) + h1 x ( n 1) + h 2 x ( n 2 ) + ... + h M x ( n M )
S khi v thut ton x l mu:
h0
+
x(n)
0(n)

Vi mi mu d liu ng vo x:
y(n)

Z-1
1(n)

0 = x;

h1

y = h00+h11+h2 2+ +hMM;

Z-1
2(n)

M(n)

i = i -1;
}

Z-1

5/22/2010

For i = M,M -1,M -2,,1 do

h2

hM

Trc khi x l d liu ng vo, cc gi

tr trng thi ni i phi c gn zeros

15

Bi ging: X l s tn hiu
Chng 4

X L TN HIU MIN THI GIAN (tt)

4.3.2 Phng php x l mu cho b lc FIR:

V d 8: B lc FIR c phng trnh I/O: y(n) = x(n) x(n - 4).
D liu ng vo: x = [1,1,2,1,2,2,1,1].
a. V s khi v vit thut ton x l mu.
b. Tnh gi tr ng ra da vo thut ton trn.
Li gii:
Vi mi mu d liu ng vo x:
a. S khi v thut ton x l mu:
{
+
x(n)
0(n)
y(n)
0 = x;
Z-1

y = 0 - 4;

1(n)

4 = 3;

Z-1
2(n)

3 = 2;

Z-1

2 = 1;

3(n)

1 = 0;

Z-1
4(n)
5/22/2010

-1

}
16

Bi ging: X l s tn hiu
Chng 4

X L TN HIU MIN THI GIAN (tt)

V d 8 (tt):
b. Lp bng hot ng nh sau:

5/22/2010

0
1
2
3
4
5
6
7
8
9
10
11
.

1
1
2
1
2
2
1
1
0
0
0
0

0 1 2 3 4
1
1
2
1
2
2
1
1
0
0
0
0

0
1
1
2
1
2
2
1
1
0
0
0

0
0
1
1
2
1
2
2
1
1
0
0

0
0
0
1
1
2
1
2
2
1
1
0

0
0
0
0
1
1
2
1
2
2
1
1

y = 0 - 4
1
1
2
1
1
1
-1
0
-2
-2
-1
-1

17

Bi ging: X l s tn hiu
Chng 4

X L TN HIU MIN THI GIAN (tt)

4.3.3 Phng php x l mu cho b lc IIR:

B lc IIR:

y(n) = a1 y(n 1) + a2 y(n 2) +... + aM y(n M) + b0 x(n) + ... + bL x(n L)

S thc hin dng trc tip (direct-form realization) v thut ton x l mu:
Vi mi mu d liu ng vo x:

x(n)

v0(n)

Z-1
v1(n)
v2(n)

Z-1

y(n) {

0(n)

b0

Z-1
b1
b2

a1
a2

Z-1
vL(n)

5/22/2010

1(n)

v0 = x;
0 = a11+ a2 2 +

Z-1
2(n)

+ b0v0 + b1v1 ++ bLvL ;

y = 0 ;
i = i -1; i = M,M -1,,1

Z-1
bL

aM

M(n)

vi = vi -1; i = L,L-1,,1
}
18

Bi ging: X l s tn hiu
Chng 4

X L TN HIU MIN THI GIAN (tt)

4.3.3 Phng php x l mu cho b lc IIR:

V d 9: B lc IIR c phng trnh I/O:
y(n) = y(n - 5) + x(n - 1) + 2x(n - 2) + 3x(n-3) + 4x(n - 4)
V s khi v vit thut ton x l mu.
Li gii:
S thc hin dng trc tip v thut ton x l mu:
x(n)
y(n) Vi mi mu d liu ng vo x:

v0(n)

0(n)

Z-1
v1(n)
v2(n)
v3(n)

Z-1
Z-1
Z-1

v4(n)

5/22/2010

Z-1
1

Z-1

Z-1
Z-1

3
4

Z-1

1(n)

v0 = x;

2(n)

0 = 5 + v1 + 2v2 + 3v3 + 4v4 ;

y = 0 ;

3(n)

i = i -1; i = 5,4,3,2,1

4(n)
5(n)

vi = vi -1; i = 4,3,2,1
}
19

Bi ging: X l s tn hiu
Chng 4

X L TN HIU MIN THI GIAN (tt)

4.3.3 Phng php x l mu cho b lc IIR (tt):

Thc hin dng chnh tc (canonical-form realization) v thut ton x l mu:
s phn t nh l ti thiu
0(n)

x(n)

Z-1
a1
a2

1(n)

Z-1

2(n)

b0
b1

y(n)

Vi mi mu d liu ng vo x:
{
0 = x + a11+ a2 2 ++ aMM
y = b00+ b11 ++ bLL;

b2

i = i -1; i = K,K -1,,1

K = max{M,L}

Z-1
aM

M(n)

bL

(M = L)

5/22/2010

20

Bi ging: X l s tn hiu
Chng 4

X L TN HIU MIN THI GIAN (tt)

V d 10: B lc IIR c phng trnh I/O:

y(n) = y(n - 5) + x(n - 1) + 2x(n - 2) + 3x(n-3) + 4x(n - 4)
V s khi v vit thut ton x l mu.
Li gii:
S phn t nh ti a: K =max{M,L} = 5
x(n)

Z-1
Z-1

2(n)
3(n)

Z-1

0 = x + 5;
y = 1+22+33+44;

5 = 4;
2

Z-1

4(n)
Z-1

5(n)
5/22/2010

{
y(n)

0(n)
1(n)

Vi mi mu d liu ng vo x:

4 = 3;
3 = 2;
2 = 1;
1 = 0;
}
21

Bi ging: X l s tn hiu
Chng 4

X L TN HIU MIN THI GIAN (tt)

Bi tp:
4.1 (bi 5.1.4 trang 177)
4.2 (bi 5.1.5 trang 177)
4.3 (bi 5.2.11 trang 179)
4.4 (bi 5.3.4 trang 180)
4.5 (bi 5.5.2 trang 182)
4.6 (bi 5.5.3 trang 182)
4.7 (bi 5.6.6 trang 184)
4.8 (bi 5.6.8 trang 184)

5/22/2010

22