LI NI U

Hng nm c s quan tm ca ban gim hiu, sinh vin trng i hc Giao

thng vn ti c iu kin thc hin nghin cu khoa hc. Nm hc 2011-2012 cng
khng phi ngoi l, nh vy sinh vin kha 49 chng em c c hi tham gia sn chi
b ch ny. c s gip ca cc thy c trong khoa in in t v b mn K
thut vin thng, nhm chng em ng k tham gia vi mc tiu hc hi thm nhng
kin thc mi m chng em kh c c hi tip cn trn ging ng. Nhng g chng
em thu c trong hot ng nghin cu ln ny s gp phn khng nh vo hnh trang
ca chng em khi bc vo thc t cng vic sau khi tt nghip.
V vy, chng em xin dnh trang u ca bo co gi li cm n chn thnh
ti ban gim hiu Trng i hc giao thng vn ti, cc thy c trong Khoa in
in t ni chung v cc thy c trong b mn K thut vin thng ni ring m ra
sn chi ny v h tr chng em c v kin thc, k nng cng nh kinh nghim trong
hot ng nghin cu khoa hc. c bit, chng em xin chn thnh cm n thy L
Minh Tun l ngi trc tip hng dn chng em thc hin ti ny.
V thi gian v iu kin c hn nn ti ca chng em khng khi nhng thiu
st. V vy knh mong qu thy c, ban gim kho cng ton th cc bn tham gia gp
cho chng em nghin cu c hon ho hn. V phn mnh, chng em cng s ht
sc n lc hon thin ti.

MC LC

PHN 1 - TNG QUAN V M HA......................................................................4

1.1. M ha mt bin php chng nhiu trong truyn dn s.............................4
1.2. Cc loi m....................................................................................................5
2.1. Trng........................................................................................................... 6
2.1.1. S lc v trng....................................................................................6
...................................................................................................................... 7
2.1.2. Tr ring ca mt trng .........................................................................7
2.1.3. Chu k ca mt phn t .........................................................................8
2.2. Trng GF(2) v GF(2m)................................................................................8
2.2.1. Trng GF(2) v a thc trn trng GF(2)..............................................8
2.2.2. Xy dng trng GF(2m) t GF(2)...........................................................9

PHN 3 - TNG QUAN V M KHI TUYN TNH.........................................11

3.1. M khi tuyn tnh.......................................................................................11
3.1.1. Ma trn sinh v cch m ha.................................................................11
3.1.2. Kh nng pht hin v sa sai...............................................................12
3.1.3. Cch pht hin sai ca m khi tuyn tnh.............................................13
3.1.4. Cch sa sai v thut ton gii m........................................................14
3.2. M vng.......................................................................................................16
3.2.1. nh ngha v cc tnh cht c bn ca m vng...................................16
3.2.2. Cch m ha ca m vng.....................................................................17
3.2.3 M BCH nh phn....................................................................................17
3.2.4 M BCH khng nh phn..........................................................................18

PHN 4 - M REED SOLOMON.........................................................................20

4.1. a thc sinh v cch m ha.......................................................................20
4.2. M Reed Solomon hiu qu i vi li chm..............................................22
4.3. Gii m m Reed Solomon........................................................................22
4.3.1.Tnh Syndrome.......................................................................................22

4.3.2. a thc nh v li (X)..........................................................................23

4.3.3. Xc nh gi tr li..................................................................................26
4.3.4. V d......................................................................................................26

PHN 5 KHI PHN MM THC THI M HA REED SOLOMON V

CHNG TRNH M PHNG...............................................................................28
5.1. Khi phn mm thc thi m ha Reed Solomon........................................28
5.2. Chng trnh m phng m ha Reed Solomon ........................................28
5.2.2. S khi m t hot ng ca phn mm...........................................33

KT LUN V HNG PHT TRIN CA TI.........................................34

PHN 1 - TNG QUAN V M HA

1.1. M ha mt bin php chng nhiu trong truyn dn s
Vi thp k gn y, nhu cu v nhng h thng truyn dn s vi tin cy v
hiu qu cao tng mnh do i hi v nhng mng s liu c quy m ln, tc cao cho
trao i, x l v lu tr thng tin s phc v cho qun s, chnh tr, kinh t - ti chnh
v nhng nhu cu trao i thng tin khc ca con ngi. V th s kt hp gia truyn
thng v cng ngh thng tin l bt buc c th to nn nhng h thng ny m mc
tiu chnh l kim sot c li trong qu trnh truyn dn, gip cho pha thu nhn c
chnh xc thng tin m pha pht pht i.
Nm 1948, Claude Elwood Shannon chng minh rng ch cn m ha thng
tin theo cch thch hp th kh nng xy ra li do nhiu tc ng ln knh truyn c th
c gim ti mc mong mun m khng phi nh i bi tc truyn dn hay
khng gian lu tr. y l tin cho rt nhiu nhng n lc sau ny nhm tm kim
mt phng thc m ha cng nh gii m hiu qu kim sot li xy ra trong truyn
dn trn nhng mi trng nhiu cao. V ngy nay, vic s dng m ha kim sot li
tr thnh mt phn tt yu trong cc h thng truyn thng v my tnh s.
Hnh 1.1 th hin s khi khi qut mt h thng truyn dn:

Hnh 1.1 S khi khi qut mt h thng truyn dn

tng ca vic m ha c th khi qut li nh sau:

Gi s chng ta c ngun pht l mt ngun nh phn i xng pht i tn hiu 0
v 1. u nhn ta quy c c ch gii m l nu nhn c tn hiu 0 th on bn
pht pht i tn hiu 0, nu nhn c tn hiu 1 th on bn pht pht i tn hiu
1. Vi c ch gii m nh th ny, xc sut xy ra li kh cao.
C mt hng lm gim xc xut gii m li: gi tn hiu 0 th thay v gi
i mt, chng ta gi mt chui 3 tn hiu 0 v tng t vi tn hiu 1. u nhn, ta

quy c c ch gii m l nu chui nhn c nhiu tn hiu no hn th gii m thnh tn

hiu . V d nu chui nhn c l 010 th gii m thnh 0, nu nhn c 110 th
gii m thnh 1. C ch ny hin nhin lm gim xc sut gii m li nhng li ny
sinh vn khc l lm gim hiu sut truyn thng tin i 3 ln.
Nu m ha tn hiu 0 thnh mt chui 2n + 1 tn hiu 0 v 2n + 1 tn hiu 1 m
ha cho tn hiu 1 th xc sut gii m sai tin ti 0 khi n tin ti . i li, hiu sut
truyn thng tin s gim i 2n + 1 ln.
Chng ta c th gim xc sut gii m xung gn bng 0 nhng khng gim hiu
sut truyn thng tin xung gn bng 0 m ch nh hn mt ngng no chp nhn
c. tng ca phng n ny cng khai thc tng ca phng n pha trn
ch: thay v gi i 0 v 1 khc bit 1 bit th chng ta s m ha chng thnh 000 v
111 khc bit 3 bit lm gim xc sut gii m li.
1.2. Cc loi m
Ngy nay, c 2 loi m c s dng rng ri l m khi v m chp.
i vi m khi, b m ha s chia nh chui thng tin thnh cc bn tin c
di k bit v c thm vo n k bit d to thnh mt t m c di n bit. n k bit
d ny c c nh a k bit thng tin qua mt thut ton c bit, gip cho m c kh
nng pht hin v sa li. V u vo c k bit bn tin nn tng ng s c 2k t m
di n bit u ra b m ha, tp hp 2k t m ny to thnh mt m khi (n, k).
Hin nhin l nu s lng bit d cng ln th kh nng pht hin v sa li ca
m cng ln nhng hiu sut truyn tin ca m cng nh. tng kh nng pht hin v
sa li m khng lm gim hiu sut truyn tin ca m, chng ta c th tng lng bit
d ng thi tng di t m.
B m ha ca m chp cng to ra t m di n vi k bit bn tin v n k bit
d. Tuy nhin t m ca m chp khng ch ph thuc vo k bit bn tin hin ti m cn
ph thuc vo m bn tin trc nh mt b nh bc m.
Trong khun kh ti nghin cu khoa hc ny, nhm chng em xin khng
cp ti m chp.

PHN 2 - C S TON HC CA M
2.1. Trng
2.1.1. S lc v trng
Nhn chung trng l mt tp hp cc phn t m trong tp hp chng ta c
th cng, tr nhn chia m kt qu vn nm trong tp hp. Php cng v nhn phi c
tnh giao hon, kt hp v phn phi.
Gi F l mt tp hp m trn tn ti 2 php ton nh phn cng v nhn. Tp F
cng 2 php ton cng v nhn l mt trng nu tha mn iu kin:
-

F l mt nhm giao hon vi php cng, phn t n v i vi php cng gi l

phn t khng v k hiu l 0.

Tp hp cc phn t khc 0 trong F l mt nhm giao hon vi php nhn. Phn

t n v i vi php nhn gi l n v hoc n v nhn ca F v k hiu l 1.

Php nhn c tnh cht phn phi vi php cng, vi mi 3 phn t a,b,c F:
a.(b + c) = a.b + a.c

Php tr a cho b trong mt trng l php cng ca a vi b. Nu b 0, php

chia a cho b l php nhn ca a vi b-1.
Mt s tnh cht c bn ca trng:
-

Vi mi phn t a trong mt trng: a.0 = 0.a =0

Vi 2 phn t a, b 0 bt k trong mt trng: a.b 0

a.b = 0 v a 0 b = 0

Vi mi a, b thuc trng: -(a.b) = (-a).b = a.(-b)

Vi a 0, a.b = a.c => b = c

Tp hp {0,1} vi php cng v php nhn modul 2 c cho trong bng 2.1 v
bng 2.2 to thnh mt trng c 2 phn t, thng c gi l trng nh phn. Mt
trng c s phn t xc nh c gi l trng hu hn hoc trng Galois. Do ,

trng nh phn cn c k hiu l GF(2). Trng nh phn GF(2) c vai tr quan trng
trong l thuyt m ha m c s dng rng ri trong my tnh s v truyn dn s
(hoc lu tr).

Bng 2.1 Php cng modul 2

Bng 2.2 Php nhn modul 2

2.1.2. Tr ring ca mt trng

Xt mt trng GF(q). Xt cc dy tng ca cc phn t n v

V trng ng vi php cng nn kt qu ca nhng tng ny cng l cc phn

t ca trng. V k c th nhn v hn gi tr m trng ch c q phn t nn tn ti hai
gi tr k1 v k2 khc nhau (gi s k1 > k2 ) sao cho:

T y suy ra:

n y chng ta dn ra khi nim tr ring ca mt trng.

Tr ring ca mt trng l s nguyn dng nh nht sao cho

2.1.3. Chu k ca mt phn t

Xt mt phn t a bt k khc 0 ca trng GF(q). Xt cc lu tha ak ca a vi
k = 1, 2, 3, V trng ng vi php nhn nn cc ak cng l cc phn t ca trng.
V k c th nhn v hn gi tr m trng ch c q phn t nn tn ti hai gi tr k1 v k2
khc nhau (gi s k1 > k2 ) sao cho:
.
T y suy ra:
=1
n y chng ta dn ra khi nim chu k ca mt phn t ca trng.
Chu k ca mt phn t a ca mt trng GF(q) l s nguyn dng nh nht n
sao cho an = 1.
2.2. Trng GF(2) v GF(2m)
2.2.1. Trng GF(2) v a thc trn trng GF(2)
Nhn chung, chng ta c th xy dng m vi cc k t t bt k trng GF(q)
no, trong q l s nguyn t hoc ly tha ca s nguyn t. Tuy nhin, m vi k t
t trng nh phn GF(2) hay trng m rng ca n GF(2m) c s dng rng ri
trong truyn dn s v cc h thng lu tr bi thng tin trn cc h thng s thng
c m ha dng nh phn.
Trong s hc nh phn, ta dng php cng modul 2 v php nhn modul 2. Hu
ht u ging nh ton hc thng thng ch tr vic ta coi 2 = 1 + 1 = 0. Ch rng 1
+ 1 = 0 => 1 = -1.
Mt a thc trn trng GF(2), chng hn k hiu l f(X), l a thc c dng
f(X) = a0 + a1X + a2X2 + + anXn
trong cc h s ai GF(2). GF(2) c 2 phn t l 0 v 1.
a thc trn GF(2) c th cng, tr, nhn, chia theo cch thng thng. Php
cng v nhn i vi cc h s l php cng v nhn modul 2. Cc a thc trn GF(2)
lun tha mn cc tnh cht giao hon, kt hp v phn phi.

Mt a thc bc m trn GF(2) c gi l ti gin nu n khng th c phn

tch thnh tch ca cc a thc c bc nh hn m v ln hn 0.
V d:
X2 + X khng phi a thc ti gin nhng X2 + X + 1 l a thc ti gin

Ngoi ra, a thc trn trng GF(2) cn c mt tnh cht rt ng ch . Gi f(X)

l mt a thc trn GF(2), ta c:
f2(X) = (f0 + f1 X + + fn Xn)2
= [f0 + (f1X + f2X2 + + fnXn)]2
=

+ f0(f1X + f2X2 + + fnXn)

+ f0(f1X + f2X2 + + fnXn) + (f1X + f2X2 + + fnXn)2

+ (f1X + f2X2 + + fnXn)2

Tip tc khai trin phng trnh trn ta c:

f2(X) =

+ (f1X)2 + (f2X2)2 + + (fnXn)2

Do cc h s ca a thc l 0 hoc 1 nn

= fi. V vy:

f2(X) = f0 + f1X2 + f2(X2)2 + + fn(X2)n

= f(X2)
T phng trnh trn, vi mi l 0:
=
2.2.2. Xy dng trng GF(2m) t GF(2)
a thc nguyn thy
Cho p(X) l mt a thc ti gin bc m trn GF(2) v mt s nguyn dng n.
Nu n l s nguyn dng nh nht ng thi tha mn 2 iu kin sau:
n = 2m + 1

10

Xn + 1 chia ht cho p(X)

th p(X) c gi l a thc nguyn thy.
V d:
p(X) = X3 + X + 1
Ta thy vi n = 1, 2,..., 6 th Xn +1 khng chia ht cho p(X) nhng vi n = 23 1 = 7 th:
X7 + 1 = (X3 + X + 1) (X4 + X2 + X + 1) nn p(X) = X3 + X + 1 l mt a thc nguyn thy.
Xy dng trng GF(2m) t a thc nguyn thy

Vic xy dng trng GF(2m) t mt a thc nguyn thy bc m kh n gin.

Chng em xin c a ra mt v d minh ha, vic chng minh phng php ny thy
c v cc bn c th xem trong ti liu tham kho.
Gi s ta cn xy dng trng GF(23) t a thc p(X) = X3 + X + 1
Cho p() = 3 + + 1 = 0 suy ra:
3 = + 1
4 = 3. = ( +1) = 2 +
5 = .4 = 3 + 2 = 2 + + 1
6 = .5 = 3 + 2 + = + 1 + 2 + = 2 + 1
7 = .6 = 3 + = + 1 + = 1 = 0
Vy 8 phn t ca trng GF(23) l {0, 0, 1, 2, 3, 4, 5, 6}

11

PHN 3 - TNG QUAN V M KHI TUYN TNH

Nh ni trn, m khi tuyn tnh l mt loi m c dng ph bin trong
vic chng nhiu. Gi l m tuyn tnh v loi m ny c xy dng da trn l thuyt
ca i s tuyn tnh. phn tng quan ny, chng em xin ch xin cp ti m nh
phn. Lp m khng nh phn cng c c im tng t ch khc mt iu l cc k t
m ca m khng nh phn c ly t trng m rng ca GF(2).
3.1. M khi tuyn tnh
3.1.1. Ma trn sinh v cch m ha
Ni mt cch ngn gn nht, mt m khi c chiu di n gm 2k t m c gi
l m tuyn tnh C(n, k) nu v ch nu 2k t m hnh thnh mt khng gian vc-t con
k chiu ca khng gian vc-t n chiu gm tt c cc vc-t n thnh phn trn trng
GF(2). Do vy c th tm c k t m c lp tuyn tnh trong C, chng hn (g0, g1,...,
gk-1) sao cho mi t m trong C l mt t hp tuyn tnh ca k t m ny:
v = a0g0 + a1g1 +... + ak-1gk-1
vi ai {0, 1} vi mi i = 0, 1,..., k-1.
t k t m c lp tuyn tnh ny thnh nhng hng chng ta c c mt ma
trn cp k n nh sau:

vi gi = (gi0, gi1, , gi(n-1)), vi i = 0, 1, , k-1.

Ma trn G gi l ma trn sinh ca b m v mi t m u c th c to ra
thng qua ma trn ny.

12

Tuy nhin, nu theo phng php trn s kh cho vic xy dng b m. V vy,
chng ta xt mt khi nim mi l m tuyn tnh h thng:
Mt m tuyn tnh C(n, k) gi l m tuyn tnh h thng nu mi t m c
k bit thng tin tch bit vi n k bit d.
k bit thng tin

n k bit d

n k bit d

k bit thng tin

Hoc

T , ma trn sinh G ca b m c dng nh sau:

C c ma trn sinh, m ha thng tin u = (a0, a1, a2, , ak-1) ta ch cn ly u

nhn vi G s c t m v(v0, v1, v2, , vn-1)
3.1.2. Kh nng pht hin v sa sai
Trng s Hamming v khong cch Hamming
Nm 1950, Richard Wesley Hamming a ra 2 khi nim v cng quan trng
trong l thuyt m ha l khong cch Hamming v trng s Hamming nh sau:
Trng s Hamming ca mt chui k hiu v = a1a 2a n trong ai {0, 1, ,

m 1} l s k hiu khc 0 ca chui, k hiu l w(v)

V d
Trng s Hamming ca 11101l 4
Trng s Hamming ca 00000000 l 0
Khong cch Hamming ca 2 chui k hiu v1, v2 vi chiu di bng nhau l s

v tr khc nhau ca 2 chui, k hiu l d(v1, v2)

13

V d
Khong cch Hamming gia 1011101 v 1001001 l 2.
Khong cch Hamming gia 2143896 v 2233796 l 3.
Khong cch Hamming ca b m A vi iu kin A l m u l khong cch

Hamming nh nht gia 2 t m bt k thuc A.

B :

d(v1, v2) = w(v1 + v2)

d(v1, v2) + d(v2, v3) d(v1, v3)
T nhng nh ngha trn c th rt ra kt lun sau:
Mt b m nh phn c khong cch Hamming d c th:
-

Pht hin c t bit sai nu d t + 1

Sa c t bit sai nu d 2t + 1

Chng minh:
Gi vi l t m pht, ri l dy nhn c tng ng. chng minh th nht
chng ta thy rng nu sai ti a t > 0 bit th khong cch Hamming gia t m pht v
t hp nhn s khng vt qu t. Do t hp nhn s khng th trng vi bt k t m
no v khong cch Hamming gia hai t m bt k l t + 1. V vy bn nhn c th
pht hin c sai.
Tng t trong trng hp th hai chng ta s c d(vi, ri) t. Mt khc, ta c
d(vi, vj) 2t + 1, vi vj l mt t m bt k khc vi nn theo bt ng thc tam gic v
khong cch Hamming chng ta c d(vj, ri) t + 1 vi mi t m vj vi. V vy bn nhn
c th gii m ng vi thnh ri da trn s khc bit v khong cch Hamming ny.
3.1.3. Cch pht hin sai ca m khi tuyn tnh
Cch n gin nht pht hin mt t m nhn c c b li hay khng l so
trng n vi cc t m c th c ca b m. Tuy nhin, cch lm th cng ny s khin
chng ta tn s bc bng tng s t m ca b m v nu em ng dng trong thc t

14

th chng ta phi nh i qu nhiu ch cho vic kim tra li (thi gian, ti nguyn h
thng). V vy cn tm mt phng php khc hiu qu hn.
Cho S l mt khng gian con k chiu ca khng gian n chiu V. Nu Sd l
tp hp tt c cc vec-t trong V sao cho: u S, v Sd, u.v = 0 (php nhn
y l php nhn v hng ca 2 vc-t) th Sd l mt khng gian con ca V v c
s chiu l n k. Sd gi l khng gian b trc giao ca S v ngc li.
Da trn kt qu ny chng ta suy ra rng lun tn ti ma trn H(n k) n vi n k
hng c lp tuyn tnh sao cho G HT = 0 vi HT l ma trn chuyn v ca H. Ni
cch khc, cc vc-t hng ca H u trc giao vi cc vc-t hng ca G. T y ta c
mt cch nhn bit t m sai nh sau:
Nu v l mt t m c sinh ra t ma trn sinh G c ma trn trc giao tng
ng l H th do v l mt t hp tuyn tnh ca cc vc-t hng ca G nn
v HT = 0
V ngc li nu v HT = 0 th v phi l mt t hp tuyn tnh ca cc vc-t
hng ca G do v l mt t m. v HT thng c gi l syndrome ca v v k hiu
l s(v). Vy chng ta c:
v l t m khi v ch khi s(v) = 0
3.1.4. Cch sa sai v thut ton gii m
Vc-t li
L vc-t biu din cc v tr li gia t m truyn v t hp nhn, mi v tr li
c biu din bng bit 1, cn cc v tr cn li s c gi tr 0.
Nu t m c truyn i l v, vc-t li l e v vc-t nhn l r th chng ta c:
r=v+e
e=r+v
V d:
Nu t m v = 1011011, vc-t li l e = 0010100 c ngha l sai v tr s 3 v 5 (tnh t tri,
bt u bng 1) th vc-t nhn s l r = v + e = 1001111. Ngc li nu t m v = 0110010

15

cn vc-t nhn l r = 0010011 th vc-t li l e = v + r = 0100001 c ngha l c li xy

ra cc v tr s 2 v s 7.

Tp gii m coset
Chng ta s xy dng mt ma trn kch trc 2n k 2k ca m C(n, k) theo quy
tc nh sau:

Hng u tin gm 2k t m ca b m, bt u bng t m v1 = (0, 0, , 0)

Trong s 2n 2k vc-t (r0, r1, r2, rn-1) cn li, chn 1 vc-t e2 bt k, cc

phn t trong hng th 2 ca ma trn c xy dng bng cch cng e2 vi
phn t ct tng ng.

Tip tc chn 1 vc-t e3 bt k trong s 2n 2k+1 vc-t (r0, r1, r2, rn-1) cn
li v xy dng hng th 3 theo quy tc nh trn.

Lp i lp li cc bc trn ti khi ton b 2n t hp n bit c in vo ma

trn.

V ta c mt ma trn c dng:

Mi hng trong ma trn trn c gi l mt coset. Phn t u tin trong hng

gi l coset leader. Cc phn t ca mt tp coset c cng mt syndrome v cc
coset khc nhau c syndrome khc nhau.
Chng minh:
Tht vy, nu wi l mt phn t bt k ca coset no th:
s(v + wi) = (v + wi) HT = (v HT) + (wi HT) = ( v HT) + 0 = (v HT) = s(v)

16

V vy cc phn t ca mt coset c syndrome nh nhau v d nhin c cng

syndrome vi coset leader ca tp.
Mt khc, gi s u v v thuc 2 coset khc nhau v s(u) = s(v), suy ra
u HT = v HT (u + v ) HT = 0 u + v = wi (wi l mt t m) u = v + wi
Tc l u v v cng thuc 1 coset (mu thun).
Rt ra thut ton gii m

B gii m lu tr mt bng quy chiu gia syndrome v coset leader c

xy dng sn (coset leader y l vc-t li e)
Vi mi vc-t nhn r, b gii m s tnh syndrome s = r HT
Nu s = 0 th vc-t nhn chnh l t m c pht i
Nu s 0 th b gii m s tra bng tm vc-t li tng ng v gii m
ra t m c pht i l v = r + e

3.2. M vng
M vng l mt lp con quan trng ca m khi tuyn tnh. Vic m ha v tnh
syndrome cho m vng c th c thc hin d dng vi cc thanh ghi dch c hi tip.
Hn na, do m vng k tha cc nghin cu t i s tuyn tnh nn c th tm nhiu
phng php gii m.
3.2.1. nh ngha v cc tnh cht c bn ca m vng
Mt m tuyn tnh C(n, k) c gi l m vng nu v = v0v1vn-2vn-1 l mt t
m th v = vn-2v0v1vn-2 cng l mt t m.
M vng c mt s tnh cht c bn sau:
-

a thc m khc 0 c bc nh nht g(X) l duy nht. Hay ni cch khc khng
tn ti hai a thc m khc 0, khc nhau v cng c bc nh nht

H s t do g0 ca g(X) phi bng 1

17

Mt a thc v(X) trn trng GF(2) c bc n - 1 l a thc m nu v ch nu

n l mt bi s ca g(X). Tc l n c th vit v(X) = q(X)*g(X). g(X) c gi
l a thc sinh ca m

a thc sinh ca mt m vng C(n, k) c bc r = n k

a thc sinh ca mt m vng C(n, k) l mt c s ca Xn + 1

3.2.2. Cch m ha ca m vng

M vng c mt phng php m ha kh n gin m khng cn s dng ma
trn sinh nh sau: gi u(X) l a thc tng ng vi bn tin u. Do , bc ca u(X)
khng qu k - 1. Chia Xn k u(X) cho g(X) ta c:
Xn k u(X) = q(X) g(X) + r(X) Xn k u(X) + r(X) = q(X) g(X)
V Xn k u(X) + r(X) l bi ca g(X) nn n l a thc m. t m tng
ng vi a thc m ny c k bit sau l k bit bn tin cn n k bit u l cc bit d.
V d:
M vng C(7, 4) c ma a thc sinh l g(X) = 1 + X + X 3. T m tng ng vi bn tin
u(X) = 1 + X2 + X4 l:
X3 (1 + X2 + X4) = X3 + X5 + X7
3.2.3 M BCH nh phn
M BCH (m Bose, Chaudhuri v Hocquenghem) l mt loi m sa li vng
ngu nhin quan trng, c kh nng sa c nhiu li v c ng dng rt rng di.
Trong m BCH c 2 lp con l m BCH nh phn v m BCH khng nh phn. M BCH
nh phn c Hocquenghem a ra vo nm 1959, sau c Bose v Chaudhuri tm
ra mt cch c lp vo nm 1960.
Vi mi s nguyn dng m (m 3) v t (t < 2m -1) lun tn ti mt m BCH nh
phn vi nhng c tnh sau:
di t m:

n = 2m 1

S lng cc bit kim tra (parity): n k mt

Khong cch ti thiu:

dmin 2t + 1

18

a thc sinh v cch m ha

M BCH di t m 2m 1 vi kh nng sa t li c a thc sinh g(X) l a
thc c bc nh nht trn GF(2) c , 2, 3, ,, 2t l nghim. Nu gi i(X) l a
thc ti thiu ca i trn trng GF(2) th g(X) phi l bi chung nh nht ca cc a
thc 1(X), 2(X), , 2t(X). Nu i l mt s chn, i c th c biu din di dng
i = i 2L trong i l mt s l v L 1. Suy ra i = (i

. V vy m i v i c chung

a thc ti thiu do mt tnh cht ca a thc trn trng GF(2) nu trn nh sau:
=
Vy g(X) = Bi chung nh nht ca { 1(X), 3(X), , 2t - 1(X)}
C g(X), vic m ha din ra nh ni mc 3.2.2.
Thut ton gii m
Thut ton gii m m BCH c 4 bc nh sau
a. Tnh syndrome
b. Xc nh a thc nh v li
c. Tm nghim cho a thc nh v li
d. Xc nh gi tr li (sa li)

3.2.4 M BCH khng nh phn

Nu p l mt s nguyn t v q l ly tha ca p, chng ta s c cc m vi k t
trong trng GF(q), cc m ny gi l m q-phn. Cc khi nim v tnh cht c trin
khai cho m nh phn trong cc phn trc c p dng cho m q-phn vi mt cht
sa i. Mt m tuyn tnh (n, k) vi k t trong GF(q) l mt khng gian con k chiu
ca khng gian vect ca tt c t hp n bit trn GF(q). Mt m vng q-phn (n, k) c
to bi mt a thc c bc n k vi h s t GF(q) l mt c s ca X n - 1. M ha v
gii m i vi m q-phn tng t nh m nh phn.
i vi bt k s nguyn dng s v t, tn ti mt m BCH q-phn c di
n = q - 1, c kh nng sa cha t hn t li t hp bt k trong khi ch cn khng qu
2st s k t kim tra. Gi l mt phn t trong GF(q S). a thc sinh g(X) ca m BCH
q-phn sa cha t li l a thc c bc thp nht vi h s t GF(q) m , 2,..., 2t l
nghim. Gi i(X) l a thc ti gin ca i:
S

19

g(X) = LCM{ 1(X), 2(X), , 2t(X)}

Bc ca mi a thc ti gin nh hn s. g(X) c bc ln nht l 2st, do s k
t kim tra ca m to ra bi g(X) khng qu 2st.

20

PHN 4 - M REED SOLOMON

M Reed Solomon c tm ra bi Irving S. Reed v Gustave Solomon, sau ny
l nhn vin ca phng th nghim MIT Lincoln. Nm 1960, Irving S. Reed v Gustave
Solomon xut bn mt bi bo trong nht bo Society for Industrial and Applied
Mathematics. Bi vit ny ni v mt h m sa li mi m sau ny c gi l m
Reed Solomon (RS). Khi bi bo c vit, mt thut ton gii m hiu qu vn cha
c tm ra. Mi n nm 1969, Elwyn Berlekamp v James Massey gii thiu mt
thut ton lp gii m m RS m sau ny c bit n vi tn thut ton Berlakamp
Massey.
4.1. a thc sinh v cch m ha
Mt m Reed Solomon (RS) c kh nng sa t li v c cc k t m c ly t
trng GF(q) c cc c tnh sau:
di t m:

n=q1

S lng cc bit kim tra (parity): n k 2t

Khong cch ti thiu:

dmin 2t + 1

a thc sinh ca m RS(n, k) c bc n k = 2t tc l bng vi s k t parity

trong t m. V a thc sinh g(X) c bc 2t nn phi c 2t ly tha lin tip ca l
nghim ca g(X) l , 2, 3, , 2t nn ta c:
g(X) = (X + ) (X + 2) (X + 3) (X + 2t)
Khai trin ra v sp xp cc h s theo bc ca X:
g(X) = g0 + g1 X + g2 X2 + + g2t - 1 X2t - 1 + X2t
Vic xc nh nghim cho a thc sinh kh n gin, ta ch cn xy dng trng
GF(2 ) v chn 2t phn t t i ti i + 2t 1 l nghim ca g(X). Gi tr ca i l ty v
khng nh hng ti tnh cht ca m.
m

21

C c a thc sinh, thut ton m ha vi u vo l a thc bn tin u(X), u

ra l a thc m v(X) din ra ht sc n gin theo 3 bc sau:

1. Nhn u(X) vi Xn k
2. Chia u(X) Xn k cho a thc sinh g(X), ly phn d b(X)
3. v(X) = b(X) + u(X)Xn k

Xt v d sau thy r hn:

Xy dng m RS(7, 3) c kh nng sa 2 li v m ha bn tin u= (1, 3, 5)
Trc ht ta nhn thy m RS(7, 3) c t m c cc tnh cht sau:
-

di t m l

: n = 7 = 23 1

S k t parity l

: n k = 2t = 4

Do , cc k t m l phn t ca trng GF(23). Vic cn lm u tin l xy dng

trng GF(23).Sau khi xy dng xong trng GF(23) chng ta s i xc nh a thc
sinh ca m. Theo quy tc nu trn ta c:
g(X) = (X + ) (X + 2) (X + 3) (X + 4)
Sau khi khai trin g(X) = 3 + 1 X + 0 X2 + 3 X3 + X4
Bc 1 trong thut ton m ha:
u(X) Xn k = (1 + 3 X + 5X2) X4 = 1 X4 + 3 X5 + 5X6 (*)
Bc 2 trong thut ton m ha:
Chia a thc (*) cho g(X) ta c phn d l b(X) = 0 + 2X + 4X2 + 6X3
Bc 3 trong thut ton m ha:
v(X) = b(X) + u(X)Xn k = 0 + 2X + 4X2 + 6X3 + 1 X4 + 3 X5 + 5X6
Vy t m cn tm l v = (0, 2, 4, 6, 1, 3, 5)

22

4.2. M Reed Solomon hiu qu i vi li chm

Khi mt t m c truyn trn knh truyn qua mt vng chu nh hng ca nhiu, n
c th b nhiu lm thay i mt cch ngu nhin. S thay i ny c th gy nn 2 loi
li khc nhau l li ngu nhin v li chm. Li ngu nhin c th hiu l cc bit li
nm ri rc trong t m cn li chm l cc bit li nm lin tip nhau
Vy ti sao m Reed Solomon li hiu qu i vi li chm?
Xt m RS(255, 247) vi mi k t m c biu din bi 8 bit. V n k = 8 nn m ny
c th sa c ti a t =

= 4 li trn mi t m 255 k t.

Gi s nhiu tc ng ln knh truyn gy ra li chm 25 bit lin tip nhau trn mt t

m nh hnh 4.1 di y:
25 bit li chm

K t 1

K t 2

K t 3

K t 4

K t 5

K t 6

Hnh 4.1 Minh ha li chm

Vi 25 bit li nh trn, chng ta c tt c 4 k t m b li. M RS(255, 247) c kh nng

sa 4 li bt k loi li l li ngu hin hay li chm. By gi gi s 25 bit li ny
nm ri rc trn 25 k t m, tc l chng ta c 25 k t li, vt qu kh nng sa li
ca m. l nguyn nhn ti sao m Reed Solomon hiu qu i vi li chm.
4.3. Gii m m Reed Solomon
4.3.1.Tnh Syndrome
Syndrome l kt qu ca vic kim tra thc hin trn r xc nh xem r c l
mt phn t hp l ca tp hp t m hay khng (r l a thc nhn c pha thu).
Nu r l mt t m, syndrome S c gi tr 0 v ngc li, nu S 0 cho thy c li xy
ra.
Syndrome S l mt mng n k phn t, k hiu {Si} (i = 1,..., n k), gi tr ca n
c th c tnh bi a thc r(X) nhn c pha thu.
C th thy rng mi a thc m hp l v(X) l mt bi s ca a thc sinh g(X).
V vy, nghim ca g(X) cng phi l nghim ca v(X). V r(X) = v(X) + e(X) nn

23

r(X) cng l mt t m th n phi l bi ca g(X). Ta c th tnh syndrome theo biu

thc sau v nhn ra rng bt k li no cng s dn vic syndrome c gi tr khc 0:

4.3.2. a thc nh v li (X)

Gi s c li trong t m ti v tr Xj1, Xj2,..., Xjv. Cc a thc li e(X) c th
c vit nh sau:
e(X) = ej1 Xj1 + ej2 Xj2 ++ ejv Xjv
Ch s 1, 2,... v xem nh li u tin, th hai,...,th v v ch s j xem nh v tr
li. sa t m b hng, mi gi tr li ejl v v tr li Xjl, vi l = 1, 2,..., phi c
xc nh. Ta nh ngha s v tr li l = j1. Chng ta c n k = 2t k t syndrome bng
cch thay th i vo a thc nhn r(X) vi i = 1, 2,... 2t:

C 2t n (t gi tr li v t v tr v 2t phng trnh. Tuy nhin, 2t phng trnh

khng th gii theo cch thng thng. Mt a thc nh v li (X) c nh ngha
nh sau:
(X) = (1 + 1 X) (1 + 2 X)... (1 + v X)
= 1 + 1 X + 2 X 2 + + v Xv
H s ca (X) v s v tr li c quan h vi nhau theo h phng trnh sau:

24

T hai h phng trnh (4.1) v (4.2) ta thy cc h s ca a thc nh v li (X) cng

c quan h vi cc phn t ca syndrome

Lu rng cc h s ca (X) l cha bit v chng ta cn xc nh chng.

Nm 1967, Elwyn Ralph Berlekamp a ra mt thut ton lp gip xc nh cc h s
ca (X) nh sau:
Bc u tin l xc nh 1 a thc (1)(X) c bc nh nht m cc h s ca n
tha mn phng trnh u tin trong h (4.3)
Tip theo l kim tra cc h s ca (1)(X) c tha mn phng trnh th 2 ca h
(4.3) hay khng.
Nu tha mn, ta t (2)(X) = (1)(X)
Nu khng tha mn, ta cng thm mt s hng no vo (1)(X) to
thnh (2)(X) sao cho (2)(X) tha mn c 2 phng trnh u ca h (4.3)
Lp li bc trn, ta kim tra cc h s ca (2)(X) c tha mn phng trnh th
3 ca h (4.3) hay khng.
Nu tha mn, ta t (3)(X) = (2)(X)
Nu khng tha mn, ta cng thm mt s hng no vo (2)(X) to
thnh (3)(X) sao cho (3)(X) tha mn c 3 phng trnh u ca h (4.3)

C lm nh vy cho ti khi ta thu c a thc (2t)(X) v (2t)(X) chnh l a thc nh

v li. S khi ca thut ton trn c m t nh hnh 4.2, trong :
n v k l bin lp
L l bc ca a thc (X) ti bc ang xt
D(z) a thc nh v li
d l bin kim tra iu kin cc h s ca (X) bc hin ti c tha mn
phng trnh trong h (4.3) hay khng

25

Hnh 4.2 S khi thut ton Berlekamp

26

4.3.3. Xc nh gi tr li
Khi c a thc nh v li (X), ta c th xc nh gi tr li. Gi
Z(X) = 1 + (S1 + 1)X + (S2 + 1 S1 + 2)X2 ++ (Sv + 1 Sv 1 + 2 Sv 2 ++ v)Xv
Khi , gi tr li ti v tr l = ji c tnh theo cng thc:

4.3.4. V d
Xt m RS sa 3 li vi k t trong trng GF(24). a thc sinh ca m l:
g(X) = (X + ) (X + 2) (X + 3) (X + 4) (X + 5) (X + 6)
= 6 + 9X + 6X2 + 4X3 + 14X4 + 10X5 + X6
Gi vec-t 0 l vc-t m c truyn v r = (0 0 0 7 0 0 3 0 0 0 0 0 4 0 0) l
vc-t nhn. Vy, r(X) = 7X3 + 3X6+ 4X12
Bc 1: Tnh syndrome

S1 = r() = 10 + 9 + = 12
S2 = r(2) = 13 + 1 + 13 = 1
S3 = r(3) = + 7 + 10 = 14
S4 = r(4) = 4 + 12 + 7 = 10
S5 = r(5) = 7 + 3 + 4 = 0
S6 = r(6) = 10 + 9 + = 12
Bc 2: Tm a thc nh v li theo thut ton Berlekamp trnh

by trn, chng ta c bng 4.1

27

Bng 4.1 Kt qu thc hin thut ton Berlekamp

Nh vy, (X) = 1 + 7X + 4X2 + 6X3

Bc 3: Thay 1, , 2, , 14 vo (X), ta thy rng 3, 9 v 12 l

nghim ca (X), nghch o ca chng l 12, 6 v 3 l s v tr li ca

e(X). Nh vy, li c pht hin cc v tr X3, X6 v X12.

Bc 4: Ta c:
Z(X) = 1 + 2X + X2 + 6X3
Suy ra gi tr li ti cc v tr X3, X6 v X12 l:

=
Vy:

=
=
=

e(X) = 7X3 + 3X6 + 4X12

28

Ta thy r(X) v e(X) ging nhau nn v(X) = r(X) + e(X) = 0, ni cch khc, t m
c pht i l r = (0 0 0 0 0 0 0 0 0 0 0 0 0 0 0)

PHN 5 KHI PHN MM THC THI M HA REED

SOLOMON V CHNG TRNH M PHNG
5.1. Khi phn mm thc thi m ha Reed Solomon
Da vo nhng kt qu ca hot ng nghin cu trnh by trn, nhm chng em
di s hng dn ca thy L Minh Tun xy dng thnh cng khi phn mm thc
thi m ha Reed Solomon.
Khi phn mm ny bao gm 4 hm chc nng sau:
Hm sinh trng GF(2m)

Hm sinh a thc g(X) t a thc nguyn thy

Hm m ha
Hm gii m
Ngn ng lp trnh xy dng khi phn mm trn l Visual Basic.NET
5.2. Chng trnh m phng m ha Reed Solomon
Chng trnh c cc tnh nng nh sau:
Cho php ngi s dng la chn c tnh ca m RS thng qua cc tham s
di t m, s li c th sa, kch thc mt k t m tnh theo bit.
Cho php ngi s dng nhp vo mt bn tin dng vn bn pha pht ri gi
ti pha thu thng qua knh truyn.
Trn knh truyn ny cho php ngi s dng nhp li tc ng ln t m c
truyn hoc t sinh li ngu nhin

Phn mm c giao din n gin v hin th trc quan gip ngi s dng c th
d dng nm bt cc bc c bn m ha v gii m m RS.

29

5.2.1. Giao din phn mm m phng

30

31

32

5.2.2. S khi m t hot ng ca phn mm

33

KT LUN V HNG PHT TRIN CA TI

Sau mt thi gian nghin cu di s ch dn ca thy L Minh Tun, nhm chng em
hiu c tm quan trng ca vic m ha trong truyn dn cng nh c nhng kin
thc nht nh v m khi tuyn tnh, c bit l v m Reed Solomon, mt loi m c
kh nng sa li mnh.
Nhn chung mt m Reed Solomon thng c k hiu l RS(n, k) vi cc k t m
bit, trong n l s k t trong mt t m v k l s k t d liu. B m ho ly k k t
d liu (mi k t c kch thc m bit) ri thm vo n k k t kim tra to thnh
mt t m n k t. S li ti a trong mt t m m m RS(n, k) c th m bo sa
c l t =

, thng thng n = 2m 1. Nu n nh hn s ny th m c gi l m

rt gn. Mt m Reed Solomon c c trng bi hai a thc: a thc nguyn thy

xc nh trng Galois m cc k t m c ly t trng v a thc sinh nh
ngha cc k t kim tra c sinh ra nh th no. M Reed Solomon c bit hiu qu
i ph li hin tng li chm (cc bit li lin tip nhau trong mt t m).
Vi khi phn mm thc thi m ha xy dng c, chng em c th d dng chuyn
i qua cc nn tng khc nhau nh nhng vo cc vi iu khin trong cc thit b nh
modem xDSL, in thoi di ng hay cc thit b lu tr hoc xy dng cc chng
trnh tin ch m ha thng tin trn cc h iu hnh Windows, Linux

34

TI LIU THAM KHO

Ting Vit
1. H Vn Qun, Bi ging l thuyt thng tin, Khoa CNTT i hc Bch khoa Tp.HCM

Ting Anh
2. Peter Sweeney (2002), Error Control Coding: From theory to practice, John Wiley & Sons,
Inc.,
3. Shu Lin & Daniel J. Costello, Jr (1983), Error Control Coding: Fundamentals And
Applications, PRENTICE-HALL, INC.