You are on page 1of 4

5: Pht hin v sa sai theo m Hamming

M Hamming l mt m sa li tuyn tnh c t tn theo tn ca ngi pht


minh ra n, Richard Hamming. M Hamming c th pht hin v sa c sai cho mt
s bit nht nh
a) Nguyn tc:
Mt t m Hamming gm m bit nh phn d liu v p bit kim tra chn l (2p -1
m + p), p bit kim tra c b tr ti cc v tr thch hp pht hin chnh xc v
tr li l cc s m ca 2 v d: 20, 21, 22,
Tt c cc v tr bit khc c dng cho d liu s c m ha. (cc v tr 3, 5,
6, 7,
Mi bit chn l tnh gi tr chn l cho mt s bit trong m bit. V tr ca bit chn
l quyt nh chui cc bit m n lun phin kim tra v b qua
V tr 1 (n=1): b qua 0 bit(n-1), kim 1 bit(n), b qua 1 bit(n), kim 1
bit(n), b qua 1 bit(n), v.v. p1 (20)
o V tr 2(n=2): b qua 1 bit(n-1), kim 2 bit(n), b qua 2 bit(n), kim 2
bit(n), b qua 2 bit(n), v.v. p2 (21)
o V tr 4(n=4): b qua 3 bit(n-1), kim 4 bit(n), b qua 4 bit(n), kim 4
bit(n), b qua 4 bit(n), v.v. p3 (22)
o V tr 8(n=8): b qua 7 bit(n-1), kim 8 bit(n), b qua 8 bit(n), kim 8
bit(n), b qua 8 bit(n), v.v. p4 (23)
o V tr 16(n=16): b qua 15 bit(n-1), kim 16 bit(n), b qua 16 bit(n),
kim 16 bit(n), b qua 16 bit(n), v.v. (24)
o V tr 32(n=32): b qua 31 bit(n-1), kim 32 bit(n), b qua 32 bit(n),
kim 32 bit(n), b qua 32 bit(n), v.v. (25)
o v tip tc nh trn.
Xc nh v tr li bng cch ly mudul 2 (xor) ca cc bit chn l ca d liu
sau v trc khi truyn nu = 0 th khng c li, ngc li th v tr li l kt ca php
mdul 2 chuyn sang h thp phn.
o

b) V d 1: cho m bit d liu cn truyn l: 0110101 hy chn cc bit cn thit vo


theo phng php m sa sai Hamming. (cho bit dy truyn t phi sang tri )
Gii:
- m = 7, p = 4 (2p -1 7 + 4) cc bit p1, p2, p3, p4 c b tr vo cc v tr 1,2,4,8
- Cc v tr 3,5,6,7,9,10,11 l cc bit d liu
- Xc nh p1, p2, p3, p4 theo thut ton kt qu l: 1000
p1= 01011 = 1 (xor)
p2= 01001 = 0
p3= 110 = 0
p4= 101 = 0
- Ri cc bit va tnh c vo trong xu gc ta c xu cn truyn l: 10001110010

Xc nh v tr bit li nh sau:
- Gi s sau khi truyn nhn c dy nh phn l: 10001100100.

- Bng cch xc nh cc bit chn l p1, p2, p3, p4 nh trn ta c: p1=0, p2=1, p3=0, p4=1
- Thc hin php xor cc bit chn l trc v sau khi truyn ( ch phi vit ngc li)
P4
p3
p2
p1
1
0
1
0
Xor 0
0
0
1
1
0
1
1
= 11(10) v tr li l 11
c) v d 2: Cho chui bit gc m = 1101100111, hy chn cc bit cn thit vo theo

phng php m sa sai Hamming. (cho bit dy truyn t tri sang phi )
Gii:

- m = 10, p = 4 (24 -1 > 10 + 4) cc bit p1, p2, p3, p4 c b tr vo cc v tr


1,2,4,8
- Cc v tr 3,5,6,7,9,10,11,12,13,14 l cc bit d liu
- Xc nh p1, p2, p3, p4 theo thut ton kt qu l:
p1= 110011 = 0
p2= 110111 = 1
p3= 110110 = 0
p4= 011011 = 0
Ri cc bit va tnh c vo trong xu gc ta c xu cn truyn l:
11011000110110
Gi s sau khi truyn xu nhn c l: 1 1 0 1 1 0 0 1 1 1 0 1 1 0 hy xc
nh v tr li
Tm p1, p2, p3, p4 ca xu nhn:
P1 = 111011 = 1
P2 = 111111 = 0
P3 = 111011 = 1
P4 = 011011 = 0
- V tr li l
p4
p3
p2
0
1
0
Xor
0
0
1
0
1
1

p1
1
0
1 V tr li l 7

Ly v d nh ny cho d hiu nh:

Cho chui bt cn truyn:


101110101100011

>> c tt c 15 bt tt c

Bc 1: Thm cc bt Pi vo cc v tr cho ti khi no ht chui th thi


Cc v tr l: i = 2k

k= 0->n

Thnh: 1011p41010110p3011p21p1p0

1101100111
Bc 2:
V tr cc bt 1: 3,5,10,11,13,15,17,18,21
00011 ~3
00101~5
01010 ~10
..

= P4 p3 p2 p1 p0 =???
Sau tin hnh cng modulo (cng khng nh) tt c cc gi tr li c gi tr cui
cng: p4p3p2p1p0
>> chui bt cn truyn (thay cc pi vo chui ban u)

Bn nhn kim tra:


kim tra cc bt c gi tr bng 1
cng modulo cc gi tr bng 1 li nu sai bt no th kt qu l gi tr , nu
ng th kt qu =0

You might also like