Chng 9: Pht Hin v Sa Li

I. Cu hi n tp:
1. Hy cho bit khc bit gia li 1 bit v li bt (burst eror)?
Li 1 bit: l li m ch c mt b trong n v d liu (byte, k t, n v d liu, gi) b sai
trong qu trnh tuyn, nhn d liu. Li 1 bt t xut hin trong phng thc truyn ni tip.
Thng xut hin trong phng thc truyn song song.
Li bt: l li m c 2 hay nhiu bt b sai trong 1 n v d liu. Trong li bt cc bit sai lch
khng nht thit phi lin tc, mt s bit trong phn bt li c th khng b sai. Chiu di ca
bt li tnh t bit sai u tin n bit sai cui cng.
2. Trnh by nim m tha trong pht hin li?
M tha l phn thng tin ph trong bn tin gi i.N ch gip kim tra li ca d liu, ch
khng c ngha trong ni dung thng tin.Sau khi xc nhn chnh xc ca qu trnh chuyn
m tha s c loi b.
3. Hy cho bit 4 dng kim tra m tha trong truyn d liu?
C 4 loi m tha kim tra s chnh sc ca vic truyn d liu:
- VRC (vertical redundancy check): kim tra tnh chn hay l ca tng bit 1 trong
n v d liu.
- LRC (longitudinal redundancy check): Kim tra tnh chn hay l ca tng bit 1
trong mt khi d liu.
- RCR (cyclic redundancy check): kim tra chu k d.
- Checksum: kim tra tng.

4. Phng php pht hin n v d liu b li bng cch dng bit parity?
Bit parity: l mt bit tha c gn thm vo cc n v d liu. ng vi tng kiu kim tra m
ngi ta nh bit thm vo lm cho tng s bit 1 ca n l chn hay l.
5. S khc bit gia parity chn v parity l?

Bit Parity chn Bit parity l
S dng lut s l ( tng l s chn):
- Nu tng bit l s chn th thm vo bit 0
- Nu tng bit l s l th thm vo bit 1
S dng lut s chn ( tng l s l):
- Nu tng bit l s l th thm vo bit 0
- N u tng bit l s chn th thm vo bit 1

6. Trnh by v phng php VRC v cho bit dng li khng pht hin
c?
Phng php VRC (vertical redundancy check) : kim tra tnh chn hay l ca tng bit 1 trong
n v d liu.
- To bit parity (qu trnh gi): tnh tng bit 1 trong mt n v d liu. Da vo
loi VRC chn/ l v gi tr tng m ta thm vo bit parity l bit 1 hay bit 0.
- Kim tra (qu trnh nhn): tnh tng bit 1 c trong mt n v d liu, xt lun c
cho bit parity thm phn gi.
Nu s dng VRC chn m kt qu tng l 0 th ng.
Nu s dng VRC chn m kt qu tng l 1 th sai.
o Nu s dng VRC l m kt qu tng l 1 th ng.
o Nu s dng VRC l m kt qu tng l 0 th sai.
Nhng li LRC khng th pht hin: nhng li c s chn bit b thay i nh: 2,4,6,.. bit b thay
i th LRC khng th pht hin c
Mch to bit parity VRC (s dng parity chn):

Mch kim tra VRC (s dng parity chn):

7. Quan h VRC v LRC ?
Qu trnh to VRC:
- Sp xp cc n v d liu thnh cc bng (gm cc hng v cc ct)
- Tnh VRC chn cho tng ct
- Gi tr VRC theo trt t l LRC
T ta thy VRC l mt phn t phn ct li ca LRC. V LRC ging nh l thc hin VRC
trn mt khi d liu
8. Trnh by v phng php LRC v cho bit dng li khng pht hin
c?
To LRC (qu trnh gi):
- Sp xp cc n v d liu thnh bng (gm cc hng v cc ct)
- Tnh VRC chn cho tng ct
- Gi tr VRC theo trt t l LRC
Kim tra LRC (qu trnh nhn):
- Sp xp cc n v d liu thnh bng (gm cc hng v cc ct) k c VRC c
tnh qu trnh gi.
- Tnh VRC cho tng ct
- Nu VRC c gi tr bng 1 th d liu sai. Nu VRC c gi tr bng 0 th d liu
ng.
Nhng li VRC khng th pht hin: khi s chn bit li cng 1 v tr ging nhau trong mt
n v d liu. V LRC khng pht hin c li trng hp .

9. B pht, CRC kt ni vi n v tn hiu no?
B pht kt ni vi cc n v:
- Data: d liu cn m ho li CRC
- Divisor: s chia (a thc sinh) c n+1 bit, d liu cho trc bn thu v pht
- CRC s d ca php chia, c n bit.

10. Hy cho bit quan h gia kch thc CRC v b chia ?
Quan h kch thc CRC v b chia:
- CRC c s bit l n
- B chia c kch thc n+1
11. B kim tra CRC pht hin li nh th no?
B ny hot ng ging ht nh b pht.Sau khi nhn c gia liu c gn thm phn CRC,
mch thc hin li php chia modulo 2.Nu kt qu l 0, ct b phn CRC v nhn d liu;
ngc li th loi b d liu v yu cu gi li. Gi s l khng c li, d s l 0 v d liu
c chp nhn.
12. Cho bit v iu kin dng a thc trong b CRC generator?
iu kin ng a thc trong b CRC generator l:
Khng c chia ht cho thc x
Chia ng cho a thc (x + 1)
13. u im ca CRC so vi LRC?
LCR ch cho php pht hin li bt.
Khi hai (s chn) bit cng sai cc v tr ging nhau trong mt n v d
liu th LRC khng pht hin c.
Ngoi ra CRC c th pht hin:
- Tt c cc nhiu bt nh hng ln cc bit c th t l.
- Cc nhiu bt c di b hn hay bng bc ca a thc.
- Cc nhiu bt c di ln hn bc ca a thc vi xc sut cao.

14. Cho bit cc phng php pht hin li trong cc giao thc lp trn?
Checksum l phng php pht hin li cao hn, da trn yu t s dng m tha. Checksum
cho php kim tra tng cc bit ca nguyn khi v pht hin li 1 cch hiu qu hn.
15. Php tnh dng cng cc segment trong b checksum generator v
checker?
Trong checksum c 2 php ton c s dng l php cng cc chi bit (cng nh phn) v
php b bit (chuyn 0 1, v 10)
16. Trnh by cc bc to checksum?
- B to checksum s chia cc n v d liu thnh k phn on, mi phn n bit (thng
l 8, 16)
- Cc phn on ny c cng li, theo php cng chui bit.
- Ly b 1 ca kt qu cng. Gi tr ny c gn vo ui ca d liu gc vc gi l
trng checksum.(Php b 1: 0 1; 1 0)
- Chhcksum c truyn cng vi d liu.
17. B checksum checker pht hin li ra sao?
- B kim tra checksum s chia cc n v d liu thnh k phn mi phn n bit (ging nh
bn pht).
- Cng cc phn trn, c tng (Sum).
- Ly b 1 ca tng.
- Nu kt qa ly b l 0 th d liu thu khng b sai, khc 0 th d liu b sai.

18. Checksum khng pht hin c li dng no?
Nu mt hay nhiu bit trong phn on b hng v bit tng ng hay bit c gi tr o trong
phn on th hai cng b li, th khi ly tng,khng nhn ra thay i v my thu khng pht
hin li c. Nu bit cui trong mt phn on l 0 v bi i thnh 1 khi truyn, th ta khng
th pht hin ra li nu bit 1 cui ca phn on th hai cng chuyn thnh 0.
19. Cng thc tnh s bit redundancy cn thit sa li bit, bit s bit d
liu?
t s bit d liu l (m); s bit d l (r)
(r) bit d biu din c t nht m + r + 1 trng thi (1 trng thi khng li, (m+r) v tr li),
th phi m bo h thc sau:

20. Mc ch ca m Hamming l g?
M Hamming c th pht hin mt bit hoc hai bit b li (single and double-bit errors). M
Hamming cn c th sa cc li do sai lch mt bit gy ra.


II. Cu hi trc nghim:

1. Pht hin li c dng trong lp no ca m hnh OSI:
a. vt l
b. kt ni d liu
c. mng
d. tt c u sai
2. Phng php pht hin li no bao gm bit parity ti mi n v d liu cng vi parity
bit ca ton n v d liu:
a. VRC
b. LRC
c. CRC
d. Checksum
3. Cho bit phng php no dng php b :
a. VRC
b. LRC
c. CRC
d. checksum
4. Cho bit phng php dng ch mt bit d trong n v d liu :
a. VRC
b. LRC
c. CRC
d. checksum
5. Phng php no c lin quan n nim a thc :
a. VRC
b. LRC
c. CRC
d. checksum
6. Pht biu no m t li mt bit
a. mt bit b o
b. mt bit b o trong mt n v d liu
c. mt bit b o trong mt ln truyn
d. tt c u ng
7. Trong m ASCII, k t G (100 0111) c gi i nhng nhn li c k t D(100 0100),
th l dng li g:
a. li mt bit
b. li nhiu bit
c. li bt
d. khi phc c
8. Trong m ASCII, k t H (1001000) c gi i nhng nhn li c k t I(100 1001) ,
th l dng li g:
a. li mt bit
b. li nhiu bit
c. bt
d. khi phc c
9. Trong phng php CRC, CRC c ngha l g:
a. b chia
b. thng s (kt qu php chia)
c. s bit chia
d. s d
10. Trong phng php CRC, b chia c kch thc so vi CRC nh th no:
a. cng kch thc
b. nh hn mt bit
c. ln hn mt bit
d. ln hn hai bit
11. Nu n v d liu l 111111, b chia l 1010, v d s l 110, hy cho bit gi tr s
b chia (divident) ti my thu?
a. 111111011
b. 111111110
c. 1010110
d. 110111111
12. Nu n v d liu l 111111, b chia l 1010, v d s l 110, cho bit s b
chia (divident) ti my pht?
a. 111111000
b. 1111110000
c. 111111
d. 1111111010
13. Khi dng phng php parity l trong pht hin li trong m ASCII, th s bit 0 trong
mt k t 8 bit l:
a. chn
b. l
c. khng chn, khng l
d. 42
14. Ti my thu, khi khng c li th tng ca checksum v d liu l:
a. 0
b. +0
c. phn b ca checksum
d. phn b ca d liu

15. M Hamming l phng php dng :
a. pht hin li
b. sa li
c. ng gi li
d. a v b
16. Trong CRC, khng c li khi thng s (quotient) ti my thu l:
a. bng vi d s ti my pht
b. bng khng
c. khc khng
d. l thng s (quotient) ca my pht
17. Trong CRC, thng s ti my pht s tr thnh:
a. s b chia (dividend)
b. b chia ti my thu
c. b loi b
d. l s d
18. Phng php pht hin li no dng bit parity:
a. VRC
b. LRC
c. CRC
d. a v b
19. Phng php pht hin li no c th pht hin li mt bit c:
a. VRC
b. LRC
c. CRC
d. tt c cc dng trn
20. Phng php pht hin li no c th pht hin li bt c:
a. VRC
b. LRC
c. CRC
d. b v c
21. Tnh chiu di LRC, c 10 nhm, mi nhm l 8 bit, th s bit trong LRC l:
a. 10
b. 8
c. 18
d. 80
22. Trong b pht LRC, phi thm yu t no vo n v d liu trc khi tin hnh php chia:
a. cc bit 0
b. cc bit 1
c. a thc
d. d s CRC
23. Trong b pht CRC, phi thm yu t no vo n v d liu sau khi tin hnh php
chia:
a. cc bit 0
b. cc bit 1
c. a thc
d. d s CRC
24. Trong b kim tra CRC, iu g cho bit l d liu b li:
a. chui cc bit 0
b. chui cc bit 1
c. chui lin tip cc bit 1 v 0
d. d s khc khng

III. Bi Tp:
1. Cho bit nh hng ln nht ca nhiu bt 2ms ln d liu truyn vi tc :
a. 1500 bps
Ta c tc truyn l 1500pbs l trong 1 giy (1000-ms) truyn c 1500 bit. Trong 2-ms th
truyn c: 2 x 1500 :1000 = 3 bit.
nh hng ln nht nhiu bt trn 2-ms l 3 bit.

b. 12.000 bps
Ta c tc truyn l 12 000pbs l trong 1 giy (1000-ms) truyn c 12 000 bit. Trong 2-ms
th truyn c: 2 x 12 000 :1000 = 24 bit.
nh hng ln nht nhiu bt trn 2-ms l 24 bit.

c. 96.000 bps; 192 bit sai
Ta c tc truyn l 96 000 pbs l trong 1 giy (1000-ms) truyn c 96.000 bit. Trong 2-
ms th truyn c: 2 x 96.000:1000 = 192 bit.
nh hng ln nht nhiu bt trn 2-ms l 192 bit.

2. Gi s ta dng parity chn (VRC), hy cho bit VRC trong cc n v d liu sau (v
mch to bit VRC):
a. 1001011 bit parity = 1

b. 0001100 bit parity = 0

c. 1000000 bit parity = 1

d. 1110111 bit parity = 0

3. My thu nhn c mu bit 01101011. H thng dng VRC parity chn, cho bit mu
c nhn ng khng (v mch kim tra VRC)?
Mch tr v 1 trong qu trnh truyn b li

4. Tm LRC ca khi cc bit sau: 10011001 01101111
- Sp xp cc n v d liu thnh cc bng (gm cc hng v cc ct):
Chi bit 1: 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1
Chi bit 2: 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1
- Tnh VRC cho tng ct: 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0
- Gi tr VRC c xp theo trt t l LRC: 11110110

5. Cho chui 10 bit: 1010011110 v b chial 1011, tm CRC, kim tra li kt qu.
tm CRC ta s dng php chia chi bit 1010011110 cho b chia l 1011:

T ta c CRC l s d ca php chia trn l: 001
Kim tra CRC:

6. C d s l111, n v d liu l 10110011, v b chia l 1001, cho bit n v d liu c li
khng?
Xt php chia: 10110011111: 1001

Ta thy s d ca php chia l 0000. Vy trong qu trnh truyn, d liu c m bo, khng
b li.
7. Tm checksum ca cc chui bit sau. Gi s dng cc phn on 16 bit:
1001001110010011
1001100001001101
Tnh Checksum:
- Tnh tng 2 phn 16bit ra c phn Sum: 1 0 0 1 0 0 1 1 1 0 0 1 0 0 1 1
+ 1 0 0 1 1 0 0 0 0 1 0 0 1 1 0 1
10 0 1 0 1 0 1 1 1 1 1 0 0 0 0 0
- Ly b 1 ca chui bit tng. Ta c Checksum: 1 1 0 1 0 1 0 0 0 0 0 1 1 1 1 1
8. Tm phn b ca 1110010001110011
i bit 0 1 v 1 0 ta c phn b: 0001101110001100
9. Cng 11100011 v 00011100 v ly phn b. Gii thch kt qu?
Cng 2 chui bit: 1 1 1 0 0 0 1 1
+ 0 0 0 1 1 1 0 0
1 1 1 1 1 1 1 1
Ly b 1: 0 0 0 0 0 0 0 0
Ta thy cc bit v tr trng nhau thi b nhau lm cho 2 chi bit l 2 chui b nhau. B ca
tng 2 chui bit b nhau th bng 0.
10. Trong cc n v d liu sau, tm s d ti thiu cn c c th sa li bit n:
a. 12
M = 12.
2
r
r >= m+1 = 12 + 1 = 13
chn r = 5
S d ti thiu cn c c th sa li bit n: 5
b. 16
M = 16.
2r r >= m+1 = 16 + 1 = 17
chn r = 5
S d ti thiu cn c c th sa li bit n: 5
c. 24
M = 24.
2r r >= m+1 = 24 + 1 = 25
chn r = 5
S d ti thiu cn c c th sa li bit n: 5

d. 64
M = 64.
2r r >= m+1 = 16 + 1 = 65
chn r = 7
S d ti thiu cn c c th sa li bit n: 7

11. To m Hamming cho chui bit 10011101?
S bit d liu l 8 => s bit d l r thoi mn : 2
r
8 + r + 1 => r = 4
12 11 10 9 8 7 6 5 4 3 2 1
1 0 0 1
R8
1 1 0
R4
1
R2 R1
R1(3,5,7,9,11) = 1R2(3,6,7,10,11) = 1 R4(5,6,7) = 0R8(3,5,7,9,11) = 1
M Hamming cho chui bit 10011101 l: 100111100111

12. Tm VRC v LRC ca cc chui bit sau dng parity bit chn:
0011101 1100111 1111111 0000000

Tnh VRC: 00111010 11001111 11111111 00000000
Tnh LRC:
0011101
1100111
1111111
0000000
-----------
0000101
Vy LRC cn tm : 0011101 1100111 1111111 0000000 0000101

13. B pht gi 01110001, my thu 01000001. Nu ch dng VRC, cho bit my thu c th
pht hin li c khng?
My pht: 01110001
My thu : 01000001
y l li bt 2 bt sai nn VRC khng pht hin c li. VRC ch pht hin c li bt 1
v li bt m tng s bt sai l 1 s chn(1, 3, 5, 7)
14. Khi bit sau s dng LRC, cc bit c li khng?
10010101 01001111 11010000 11011011
Kim tra LRC:
10010101
01001111
11010000
11011011
--------------
11010001 khc 00000000 nn d liu lc truyn b sai
15. H thng dng LRC vi khi 8 byte. Cho bit s bit d phi gi i trong mi khi? Cho bit t
s bit hu ch trn tng s bit?
Ta c phn d liu: 8 byte ~ 8 x (8 bit)
Phn m tha LRC 8 bit
Vy s bit d gi i xc nhn thng tin l 8 bit
T s bit hu ch/ tng s bit l (8*8) / (8*8+8) = 64/72
16. B chia l 101101, hy cho bit CRC c di l bao nhiu?
V di s bit d CRC nh hn 1 so vi di ca b chia (divisor), nn CRC ng vi b
chia ny, c di l 5 bit
17. Tm gi tr nh phn tng ng cho a thc: x
8
+ x
3
+ x + 1.
Gi tr nh phn tng ng vi a thc l: 1 0 0 0 0 1 0 1 1