Mn hc: Mng thng tin s liu

Ni dung
Tng quan v lp lin kt s liu
Cc loi li
Bi 3

Phn d
Pht hin v sa li

Pht hin li so vi sa li
M ha

Mai Quc Khnh

khanhmqmsc@gmail.com
Tham kho: Behrouz A. Forouzan, Data Communication and Networking, 5th Ed, 2013 2

Lp lin kt s liu Kim sot li

Pht hin li (Error Control)
Sa li
Cung cp dch v cho
Sa li trc (Forward Error Correction)
Yu cu truyn li t ng (Automatic Repeat
Request)

Nhn dch v t

3 4
Cc loi li Phn d
Li n: ch mt bit trong n v d liu b thay i pht hin v sa li, cn phi a thm vo
d liu cc bit d (redundant bits)

Li cm: 2 hay nhiu bit trong n v d liu b

thay i

5 6

M ha XOR
Qu trnh b xung thm cc bit d pht hin Php ton chnh dng cho cc m pht
v sa li hin v sa li
Hai loi m sa li:
M khi (Block codes)
Chia d liu cn truyn thnh cc khi
Thng tin sa li c gn vo mi khi
Khng nh (memoryless)
M chp (Convolutional codes)
X l d liu nh mt chui bit, v tnh ton m trn mt
chui lin tip
M c tnh cho mt tp bit ty thuc u vo hin ti v
trc

7 8
M ha khi V d: m ha khi 4B/5B
Bn tin c chia thnh cc khi k-bit
c gi l cc t d liu (datawords) Data Code Data Code
0000 11110 1000 10010
B xung thm r bit d k=?
0001 01001 1001 10011
Cc khi tr thnh n = k + r bits r=?
c gi l cc t m (codewords) 0010 10100 1010 10110
n=?
0011 10101 1011 10111
0100 01010 1100 11010
0101 01011 1101 11011
0110 01110 1110 11100
0111 01111 1111 11101

9 10

Pht hin li trong m ha khi Pht hin li trong m ha khi

Mt m pht hin li ch c th pht hin
cc loi li m n c thit k
Cc loi li khc khng th pht hin c.

Pht hin mi loi li l khng kh thi

11 12
Sa li V d: M sa li

k, r, n = ?
My thu nhn c 01001, hy tm t d liu (dataword) gc?
(gi thit ch 1 bit b hng)
13 14

Khong cch Hamming Khong cch Minimum ti thiu

Khong cch Hamming gia hai t m l s bit khc Khong cch Hamming ti thiu l khong cch
nhau gia cc bit tng ng Hamming nh nht gia mi cp c th c trong
mt tp cc t
d(01, 00) = ?
Hy tm khong cch Hamming ti thiu
d(11, 00) = ?
ca codebook sau
d(010, 100) = ?
00000
d(0011, 1000) = ? dmin = ?
01011
10101
11110
15 16
Kh nng pht hin li ca m Kh nng sa li ca m
m bo pht hin ra cc s bit li, m bo sa c t bit li, khong
khong cch hamming ti thiu trong mt cch Hamming ti thiu trong mt m
m khi phi l khi phi l
dmin = s + 1 dmin = 2t + 1

17 18

V d: Khong cch Hamming Cc phng php pht hin li

Mt s m c khong cch Hamming
dmin = 4. Hy phn tch kh nng pht Cc phng php pht hin li thng dng
hin li v kh nng sa li ca s bao gm:
ny? Kim tra chn l (Parity check)

Kim tra lng d theo vng (Cyclic

Redundancy Check)
Tng kim tra (Checksum)

19 20
Parity check V d: Parity Check
Phng php thng dng v n gin Gi s bn gi cn truyn i t world. Trong ASCII,
nht 5 k t trong t world c m ha (vi even
parity) nh sau
Mi khi c b xung thm 1 bit (bit
chn l) 1110111 1101111 1110010 1101100
1100100
Cc s Parity check:
Even parity Duy tr s bit 1 lun l s chn Cc t m thc s c truyn i s l:
VD: 1011 10111 11101110 11011110 11100100 11011000 11001001
Odd parity Duy tr s bit 1 lun l s l
VD: 1011 10110

21 22

V d: Parity Check Parity-Check: M ha/Gii m

My thu nhn c chui cc t ny

11111110 11011110 11101100 11011000
11001001
Nhng khi no c chp nhn? nhng khi no b
loi b?

Parity bit: r0 = a3 a2 a1 a0
Syndrome: s0 = b3 b2 b1 b0 q0
23 24
 Phm cht ca Parity Check 2D Parity Check
C th pht hin ra cc li 1-bit hay khng? Dataword c t
C th pht hin ra cc li 2-bit hay khng? chc thnh bng

C th pht hin ra cc li 3-bit hay khng? Tnh cc parity bit

theo hng v ct
...
Bng c gi ti
my thu
My thu tnh
syndrome cho mi
hng v ct

Phm cht ca s m kim tra chn l 2 chiu?

25 26

2D Parity Check: Phm cht 2D Parity Check: Phm cht

1 li nh hng ti 2 bit parity 2 li nh hng ti 2 parity

M kim tra chn l ny c th pht hin ti 3 li xy ra bt

1 li nh hng ti 2 bit parity 2 li nh hng ti 2 parity
c v tr no trong bng. Cc li 4 bit khng th pht hin
c.
27 28
M vng M vng: M ha/Gii m
Trong mt m vng (cyclic code), dch
vng mt t m lun to ra mt t m
khc. V d:

r0 = a2 a1 a0 s0 = b2 b1 b0 q0
r1 = a3 a2 a1 s1 = b3 b2 b1 q1
r2 = a1 a0 a3 s2 = b1 b0 b3 q2
29 30

B sinh trong m vng Kim tra trong m vng

Ghi ch:
Dividend s b chia
Divisor s chia
Quotient thng s
Remainder phn d
Dataword t d liu
Codeword t m

31 32
 Biu din bng a thc Cc php ton a thc
Thng dng hn cch biu din nh phn Cng
D phn tch (x5 + x4 + x2) + (x6 + x4 + x2) x6 + x5
S chia trong m vng thng c gi l a thc
sinh (generator polynomial) hay b sinh (generator)
Nhn
(x5 + x3 + x2 + x) (x2 + x1 + 1)
= x7 + x6 + x5 +x5 + x4 + x3 + x4 + x3 + x2 + x3 +
x2 + x
= x7 + x6 + x3 + x

34
33

Cc php ton a thc Cc php ton a thc

Dch Chia

Ghi ch:
Dividend s b chia
Divisor s chia
Quotient thng s
Dch tri 3 bit: 10011 tr thnh 10011000

Remainder phn d
hay x4 + x + 1 tr thnh x7 + x4 + x3 Dataword t d liu
Codeword t m

Nhn mi s hng ca a thc vi xm, vi m - s bit dch

Dch phi 3 bit: 10011 tr thnh 10

hay x4 + x + 1 tr thnh x
Chia mi s hng ca a thc cho xm , vi m - s bit dch

35
36
Phn tch m vng Phn tch m vng
K hiu: Dataword:
C th c phn tch bng a thc
l mt a thc vi Codeword:
cc h s nh phn Generator: Trong m vng
1. Nu mt hoc nhiu bit b li.
Syndrome:
2. Nu mt trong hai trng hp
Error:
sau c th xy ra:
a. Khng c bit no b li, hoc
b. Mt s bit b li, nhng b gii m khng pht
hin c
= +
37
38

Phn tch m vng M vng vi cc li bit n

Khi chia ht cho , my thu s xc
nh t m thu c khng c li. iu ny
xy ra khi:
t m thu c thc s khng Cc m vng, vi c t nht 2 s hng
c li, hoc v h s ca x l 1, c th pht hin c
0

t m thu c c li nhng mi li bit n

my thu khng th pht hin c

M vng khng th pht hin c cc li

m c th chia ht cho
39 40
M vng vi cc li bit n M vng vi cc li bit n
Tr li
V d: phn tch kh nng pht hin li bit a. Khng c no ( l v tr ca bit) c th chia ht
cho 1 (do / 1 lun c d)
n ca cc a thc sinh sau y 0 pht hin c mi li n.
a b. Vi 3, th khng chia ht cho

3 (c

b 3 d) syndrome 0 pht hin c li n cc v

c tr 1 ti 3; Vi 3, th lun chia ht cho
3 (khng c d) 0 my thu
khng pht hin c li sai!
c. Vi mi , lun chia ht cho 1 (khng c
d) khng th pht hin c bt c li no

41 42

M vng vi 2 li n tch bit M vng vi 2 li n tch bit

V d: Phn tch kh nng pht hin 2 li
Cc m vng, c khng th c chia ht bi n tch bit ca cc b sinh sau
vi , c th pht hin c mi
cp li n tch bit
4
l chiu di t m
7 6

15 14

43 44
M vng vi 2 li n tch bit M vng vi s bit li l
Tr li
a. B sinh ch c th pht hin 1 li n, khng th pht hin
2 li n, ngay c khi chng lin k ( 2 v tr lin tip).
b. B sinh khng th pht hin ra 2 li cch nhau 4 v tr. 2 Cc m vng, vi cha h s , c th
li ny c th bt c u trong t m, nhng nu pht hin c mi li c s lng bit li l l
khong cch gia chng l 4 th khng th pht hin c.
c. B sinh tt cho mc ch ra

d. B sinh ny khng th c chia ht bi 1 nu

32768, ngha l b sinh ny c th pht hin c 2 li
n tch bit lin k nhau hoc cch nhau ti 32,768 bit
trong t m

45 46

M vng vi s bit li l M vng vi li cm

V d: Phn tch kh nng pht hin cc li
vi s bit li l s l ca b sinh sau y Pht hin c mi li cm vi
4 2 Pht hin c, vi xc sut , mi li
cm c chiu di
Tr li
4 2 3 2 Pht hin c, vi xc sut , mi li
cm c chiu di
B sinh c th pht hin mi li vi s bit
l chiu di ca cm li, l bc ca a thc sinh
li l s l

48
47
 M vng vi li cm M vng vi li cm
V d: Phn tch kh nng pht hin li cm Tr li
ca cc b sinh sau y a. B sinh ny c th pht hin mi li cm vi bit;
6 li cm vi bit khng th pht hin c;
18 7 li cm vi khng th pht hin c.

32 23 7 b. B sinh ny c th pht hin mi li cm vi bit;

li cm vi khng th pht hin c;
li cm vi khng th pht hin c.

a. B sinh ny c th pht hin mi li cm vi bit;

li cm vi khng th pht hin c;
li cm vi khng th pht hin c.
49 50

Tm tt: Tiu ch a thc sinh tt u im ca m vng

Phm cht tt trong pht hin li n, li

C t nht 2 s hng
cp, li s l v li cm.
H s ca s hng x0 bng 1
D thc hin bng phn cng v phn mm.
Khng th c chia ht bi xt + 1, vi t gia 2
v n Thc hin nhanh, c bit khi thc hin
bng phn cng.
C h s x + 1
Hin nay, m vng n gin v nhiu loi
m vng phc tp hn (VD: Reed Solomon
code) c s dng trong nhiu mng.
51 52
Checksum Checksum: S hc b 1

K thut pht hin li, thc hin network- C th biu din cc s khng du gia 0 v
1 ch dng bit.
layer v transport-layer, p dng cho cc bn
tin di ty Nu s biu din qu bit, th cc bit (ngoi
bit) ngoi cng bn tri c cng vi cc
Gn y, checksum c xu hng c thay bit ngoi cng bn phi
th bng CRC (do kh nng pht hin li km Khi nim: wrapping cun.
hn?)
Mt s b c th c biu din bng cch o
mi bit (10 v 01) ca s tng ng.
Tng ng vi tr s ny i .

53 54

Checksum: V d Checksum: V d (tip theo)

My pht cn truyn tp (7,11,12,0,6) ti my thu,
yu cu ch s dng cc s 4-bit
My pht truyn (7,11,12,0,6,36), vi 36 = sum
My thu tnh tng cc s thu c (khng bao gm
sum) ri so vi sum ra quyt nh chp nhn d liu
hay khng
n gin hot ng ca my thu, my pht truyn
i (7,11,12,0,6,-36), vi -36 = checksum
My thu tnh tng cc s thu c (bao gm c
checksum) ri so vi 0 ra quyt nh chp nhn d
liu hay khng
Biu din cc s (7,11,12,0,6,-36) ch dng 4-bit th no?
Biu din nh phn ca 36 cn 5-bit (100100)2
Biu din 4-bit ca 36 (sum) theo cch sau: cng 2 bit
ngoi cng bn tri vi 4 bit bn phi
(10)2 + (0100)2 = (0110)2 (6)10
Biu din 4-bit ca -36 (checksum) bng cch o cc bit
ca sum (0110)2 c (1001)2 (9)10
Tp truyn i s l (7,11,12,0,6,9)
My thu tnh checksum theo cch tng t quyt nh
chp nhn d liu thu c hay khng
55 56
Checksum: V d (tip theo) Checksum: Internet checksum

1 1 1 1
10 0 0 1 0 0 0 0

57 58

Internet checksum Internet checksum: V d

Pha pht Pha thu Tnh checksum ca mt vn bn 8 k t

1. Bn tin c chia thnh cc t 1. Bn tin (gm checksum) c (Forouzan)
16-bit. chia thnh cc t 16-bit.
2. Gi tr ca t checksum c 2. Mi t c cng bng cch Vn bn ny c chia thnh 2 t 2-byte (16-bit)
khi ng v 0. dng php cng b 1.
3. Mi t (gm c checksum) 3. Tng c b v tr thnh
Dng Bng ASCII bin i mi byte thnh mt s
c cng bng cch dng checksum mi. hexa 2 ch s
php cng b 1 (ones 4. Nu gi tr ca checksum mi
complement addition). = 0, bn tin c chp nhn; V d: F 0x46 v o 0x6F
4. Tng c b v tr thnh nu 0, bn tin b loi b.
checksum. Qu trnh thc hin xem slide tip theo
5. Checksum c gi i cng vi
d liu.

59 60
Internet checksum: V d Sa li trc (FEC)
2 phng php sa li
Truyn li sau khi pht hin li
Sa li trc
F F

Truyn li khng hu ch i vi truyn

dn a phng tin thi gian thc (do
tr) sa li trc (FEC)
F F F F

3.61
62

Sa li trc (FEC) FEC s dng Hamming Distance

Cc phng php sa li trc: pht hin c li
S dng Hamming sa c li
S dng thuc tnh ca XOR
V d: sa 10 bit li trong mt gi tin, cn
Ghp xen cc on (Chunk Interleaving)
Kt hp khong cch Hamming v ghp xen 21 bits
Kt hp cc gi tin High v Low-Resolution Nh vy, cn truyn rt nhiu bit d cng d liu
V d: trong m BCH, nu d liu l 99 bit, cn
truyn 255 bit (156 bit d), sa ch 23 bit li c
th xy ra.

63 64
 FEC s dng thuc tnh ca XOR Ghp xen (Interleaving)

1 2
1 2

Chia 1 gi tin thnh on

To XOR ca on
Truyn 1 on, gm on d liu ( 1, 2, , ) v
kt qu XOR ( )
Nu 1 on no b mt, n c th ti to c my thu
nh thuc tnh ca XOR
Vn t ra: ?
V d: m Hamming sa cc li cm
V d: Nu = 4 cn gi i 5 on tng 25% so vi
d liu gc 65 66

Kt hp Hamming Distance v
Interleaving Kt hp cc gi tin high v low resolution

To cc gi tin -bit c th sa c li bit

Ghp xen hng, ri truyn i theo tng ct

Kt qu: C th t ng sa cc li cm ti
( li

To 1 bn sao ca mi gi tin vi d low-resolution

Truyn kt hp bn sao ca 1 gi tin vi bn gc ca gi tin tip theo
Nu 1 gi tin b mt, ly bn sao low-resolution ca n t gi tin tip theo
67 68
M Hamming M Hamming
Mt loi FEC n gin v mnh, thng dng V d: Bng m Hamming 7, 4
(v d: ECC memory s dng trong b nh
my tnh)
M Hamming (tho lun y) c thit
k vi c th pht hin ti 4 li
v sa c 1 li n
Mi quan h gia v trong cc m ny
l

69 70

M Hamming: M ho/Gii m M Hamming

Bng 10.5 Quyt nh logic thc hin bi mt logic analyzer

2 1 0

2 1 0 3 2
1 3 2 1 1
0 2 1 0 0
V d:
Nu 0 b li 0 b nh hng 001
r0 = a2 a1 a0 s 0 = b 2 b1 b0 q0 Nu 2 b li 0 v 1 b nh hng 011
r1 = a3 a2 a1 s 1 = b 3 b2 b1 q1 Nu 1 b li c 0 , 1 , 2 u b nh hng
r2 = a1 a0 a3 s 2 = b 1 b0 b3 q2 111
 M Hamming: kh nng sa li M Hamming
V d: xt 3 trng hp sau V d: Ta cn mt dataword di t nht 7 bit. Tnh gi
1. Dataword 0100 pht codeword 0100011 tr ca v tha mn yu cu ny?
Gi s thu c codeword 0100011 syndrome = 000
khng c li dataword pht l 0100 KL ng! Tr li
Ta cn lm cho 7, hay 2 1 7
2. Dataword 0111 pht codeword 0111001
Gi s thu c codeword 0011001 syndrome = 011 b2 1. Nu cho 3 23 1 7 v 7 3 4
b li (10) dataword pht phi l 0111 KL ng! khng tha mn yu cu!

3. Dataword 1101 pht codeword 1101000 2. Nu cho 4, th 24 1 15 v 15 4 11

Gi s thu c codeword 0001000 syndrome = 101 b0 tha mn yu cu!
b li (01) dataword pht phi l 0000 KL Sai! Nh vy, m s l 15,11

Kt lun: M ny khng th sa c 2 li 74
73

M Hamming: Sa li cm M Hamming: Sa li cm

tng: phn tn cm bit li gia mt s t m V d: cm li 4-bit trn khung c phn tn trn 4 t m

my thu, mi t m c 1 bit li d sa
m Hamming c th sa cc cm li c kch
thc -bit, cn to khung t t m
T chc cc t m thnh bng, truyn i theo tng
ct cc bit trong bng (t di ln trn)
Khung, c to ra t t m, c gi n my
thu

75 76
Sc mnh ca m Hamming
Khong cch Hamming ti thiu l 3 Ti liu tham kho:
C th sa hu ht cc li 1 bit 1. Forouzal B. A., Data Communications and Networking, 5th edition,
Mc Graw Hill 2013, chapter 10
C th pht hin hu ht cc li 2 bit
Nhng khng sa c c 2 bit!!! (Ti sao?)
Hi v
SECDED M Hamming m rng vi 1 tho lun
parity bit
t c khong cch Hamming ti thiu l 4
C th phn bit gia cc li 1 bit v 2 bit Ht bi 3

77

Ph lc

ASCII
Table