Professional Documents
Culture Documents
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
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)
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
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
17 18
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
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
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
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
Remainder phn d
hay x4 + x + 1 tr thnh x7 + x4 + x3 Dataword t d liu
Codeword t m
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
41 42
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
45 46
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.
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
1 1 1 1
10 0 0 1 0 0 0 0
57 58
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
3.61
62
63 64
FEC s dng thuc tnh ca XOR Ghp xen (Interleaving)
1 2
1 2
Kt hp Hamming Distance v
Interleaving Kt hp cc gi tin high v low resolution
Kt qu: C th t ng sa cc li cm ti
( li
69 70
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!
Kt lun: M ny khng th sa c 2 li 74
73
M Hamming: Sa li cm M Hamming: Sa li cm
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