Professional Documents
Culture Documents
ECCodingBCH and Reed Solomon
ECCodingBCH and Reed Solomon
,.r_,1t.... ,,''',1.!
n'.r
Prooerties For oositiveintegers ) I . i < 2' I : m Blocklength Parity ckeckdigits Minimum distance : Hamrning codes t: i, dm,n 3 : : : : , n:2^-t n-k: mr d*i" : 2t-l ( ,.-r tl r .f , " - l
l,,,aa o 3' .^lo I ' .,. ,. L\lL / .-. rfo.r.'! "" r ,,,'r
,q,.,t l,o)
i' . t
'-,
oenn 67 I -)
Gn")
\]'1
r^'
l"t'
rLn
| ') 'r _ |
.) tt,tl
rl.,(- /,
: cr.i o i'z' = (o i )r' = ui is a conjugate a, . of d', cr' havethe sameminimalpolynomial, $,(x): $,.(x) i.e.
.'.
"?,?',")i' .'
Minimum Dstance of Code . l Any codepolynomialc(x): cn+ c1x+...; c,-,xn : a(x)g(x) cr, cr2,..., cr2t and their conjugates roots ofc(x). are
t-3
ifa polynomial y(x) has a, crr, .... crr'asroots then y(x) is dirisible by g(x) :
LCM{{1(x), 0,("),...,0"(x)}.
:> .. .. y(x) is a codepolynomial. c(x) is a codepolynomial iffit hasa, cr2, o.:'asroots..,, c ( o . ' ) : 6 , , + 6 c r + c r ( c [ ' ) 2 + . , + c "r ( s i ; ' r : g ' i I cr'
or [ c a c ; c 1 . . . c n1 ]
L(r' l'=0,
| A(n )\
l<i<tr
matrix; Consider
il ,. ,art o t .......-.. l cJ.u
i
H:
r:r, (",I
6,1
(",).,
6"I
cHr :0 for anyc e C + BCHcode. H is thepariry check matrix. is If cC a conjugates ofa'then c(d) : 0 iffc(cr'): 0. Write H as
1 ct d.' s3
trn'
1 crr
H:
("'I
r ..,i (",I
I c{.2'I (""'I
6,i
6,)-'
6'1
6'.,1. . ..,
0,I'
(.,' *r)'r
74
omit rows ctr o": (0.), a- : la, )_ To prove daa > 2t+1 zqq
6'I
cHr: 1c,,,c,, l u ,....,c,,
I x v matnx
("''I
("")' ("")'
("'l'
(" ')"
l'.^-"'
I
: [0]'
(l
(q')
(," ',)"
('' t'
("')'
L'r,.,,
t1
l r " IA
("'i'
6'i'
v x \ mat]x r "h o s e e t : 0 d
")
[:,":1
6,'I 6',)'
6'l'
(-) / 75
Vandermonde Matrix
Aside VandermondeNlatrix
xr
x.
tv rr \-t/
.._ x,,
... f^I / t u
(x,)'
(pxp)
X =\ Proof :
I f b y induction(only ii True l o r _ -
',
n titlttx,
. [ r r ]
t
Then.D(x) : det
X,
(x,)t
-r
Xu
(""I
I (,r,)' ]
.i
: -,,
,(r 5'""
r. 'r. "o,lr
:^'
t
1
,/
'' t-t
(r.)'
XF
. . . .( r . ) u '
(r-I
(x"I'
Iix : X1, 2 <i < V, thenD(X,): 0 ('l r',.o rows are same),i.e., thesept-I of rhem. [r' I
i6
1 '.:t
r\
D(X,) + 0. i.e.. the dererminanr VandermondeMarix ; 0 of iix=X1 =X,.2<i<u. , (*) = determinantof Vandermonde Matrix : 0 contradiction .. Y> 2t+2 ed diste CH code.
2t+ I is calle
d..-rnay lg']arycr.
.tr\amDte
+, . 1 , 1
ll'
il'
fi'
FIar a ( i 5. 7) cr clic BCH coderrirh an enor correctinrcapabilirl. 2. c of * Noie :n. t arespeciiied: k-follows.
Generaliy A BCII cycliccodeis defined follorvs:Choosc m and p anv as , q, element GF(q-) oi ordern. Thenfor anypositiveinteger and integer rhe of j0. r generator pol),nomial BCH cycliccodeofblocklength is givenby ofa n
71
?CZ
D e,"r.
c ' i{hm.
a{
BLH
Cid"--'.t
a EC-- (1_:_,.,) core_:rrr-: crie _a_,:_1-:. fual x r t .rir,ri:_eroi - r - r - . I _ i . =.\- x-- a -g r-::::-t"' lri pol,",tot:.all r c - : -: .:'- : ' . .ihd= is ri:r) '.t. ii" --o, lr..,o. pui,rr".lr.i
eiToa.
).liL!!lO!'\
A.."'Ai"g
5.-i t- - 3
r (
I L (
I - j
io
,
Caie n
S"..- q h
t,
'i lte r.
(
" 5 <
< .
-< .
M=l.t -'
-'J
t. I
=l't=
i -i
,r
{?J
.J
'/t
"(,^-: ,
i , r .L
.: -.
-:
I s
\ .
-'.
{ ,
' ^ " ,
'.J
.ir
l = I
-- *
ft1 )
. .:* -:C
t _
o
J .]
. t . C
1'-'---
"11a'
...".--: ! r"\ ) -
, L
i
3
- _
L6
.l
i.-
i " L- ,l :l - n ' \ - s : l r I
l -r' (-" | L
rJ
i-s ) +
,61 ! i
I
.< I 1 - l
t t' r ?\ -
I + .,.1 | '. 1
l.r+". I L"- J
./-
t
.- ^ i'.^'. i:1 i
, : : -
l'!
a x) :
4 l E > 1
'
; - J
)
j . I Sc!\! Si !
, h - - * :
l
'
.
,
l
, Y \
r.cc6{G.\^...J
n'
J '
e^-A-
cl
l\--
^r.'^p-<rc {
}* ri,
,{\r
!!vr!
n ^.al
c{'"^-1:$^.r-...,tr.
t\,.e { {OY
ys!',.r-^'*(
( ^ "
>/t
r,.LG'* ; . i r
cc-) 9ee
1ei.L.t 1
tb:'
to
' ,
. - )
-. :
i)
\ S r, 1. , rt * J = \ , , . , . * r, jI * t? ! . , l ,! L;L
t. t.
S,
\.5
*,o Ja.
c4,,r
I t-. t
Lt.
t+/ t
c r ,\J,j
.f
1
-
,lL- r
;t ;l=1,
C ':-c\
t"t i: : < -
It
:r+r)
b !"-. a. J tl
'. :ia L
t/t
Reed-SolomonfRS) Codes BCH codesrvherethe block lenslh. n. divldesthe mulriplicative orderof the s)'rnbol alphabet, m : 1. i.e., 3 Symbol lield GF(q) and extensionfield GF(q-) are the sameas m:l and n:9_ I x-B.
Minimal polvnomialover GF(q)of element in the samcCIF(q) {(x): is B A1l minimal polvnomials linear. arc .. g(x) (x-a)( -ur).....(x-(]:r'l \ nk 2t
g(x) hasdeeree = 2t
isrnLclt ,rk.
"='te it - a - l k=l t
ta)a
' icat'
Codetakesa binarybit stream (informatron): blocksir into blocksof4, maps1l blockswhich arerepresented in hex into 15her s_vnbols. norv
7t
ll Encoderilp
--,,i____tt____l \
2 . . . . . . . . . . . . . ,5. . . 1.
Fi
..
l-i llcx 6 { )b i l s
lr'heret or fewer coelflcientsare nonzeros. Assumev S t errorc ccur in locations i2,....r,. i1, .. e { \ ) - e .x ' ,+ e , x -.... e \'
- /
+ magnitude error (:
>
ilo.'
n r t
It,
l t t
t
l
ti.,,,
,..
i for binarycode)
W el a n o rc ( a i ): 0, i = l , 2 , . . . , 2 t v
R ( o , ' ) :e ( c ' ) i, : l , 2 , . . . , 2 t
..9
. (")
errorlocator number
S , : Y 1 X ' r+ Y . 1 1 "a . . . p Y , a . r t
D e t i n . \ ( r ): I l - r \ ) ( L \ \ : ) . . . ( l - x - \ . ) e
: -\,x -.. ., -1.1 1 e - o r - l o c l t o rp o l r . n o n t i r l ) .\. r'
0 : \ . / X ,'r( t , . \ L \ , , , . \ r \ / , , . _ . t \
T rr
tt
. \ : \1 x/
L=l
...rr,l rr ,,
/=t
:S,-" '
:Sr- r
:Sj
Ifj 5 v
sr s.
S . Sr S.
Sr
Sr
. . .s . . , s .
''' S" S'*r
_ S,_r S,,
sr,,
- s,,
find zerosof
Thus ifmatrix is non singular,we havesolutionfor A(x) ... ,\(x) to get error locations.
SO
Consider
S, }I: lS.
ft,
t.
s.
s.
... s i
... s, .. S,,,,
s"
Su-r S,,-,
Claim d e t l N l+ 0 i f r i l !!!!
r::Cifp>r
L gi
lr
Xl {
i(.
(\ )
X.
i\. il
(X ) )
x,, (.r I
" .j n
Llr
[t'-t
. .
Y,X- ... 0
ll
\'.\.
(\.
)'
X,
fi = \'\ a.
or. l. r=l
detlMl: derlA]detfB]derfA]
det[A] + 0 (Vandermonde Matrix) if p : v d . t l B l , U r V a n d e r m o n d ea r i x ' )i f p r v M
lfu>r'
detilf, t! :l
: Y, (LL>r,-) 0
detlM]: 0
2)
r)
No. oferrors kno*1. I n r c n ) I C o m n ' r - r\ 1 1 ) Find zerosof :\fx) iirr findingeror locarions Do this simplybv trial Xt. and eror (Chiensearch) thenerrorr ectorknor otherulse magnituclcs. (iomnute eror maSniiuries ljom
[r,
(\ l j )-
\.
'''
\ , )
(\.)
. i \
.... (\
l i v tl
\',,
l(\ )'
(\,1
,,
:\,1
il,l i,]
S]
Berlekamp-ryIessey -{lgorithm for Decoding ]BCII Codes) Syn&omes related follorvs: are as
q:Lr s
error locatoroolr.nomial coeffi cienrs Above is an autore,qressive rvith coefficients.\. . ....r,. Generatecl filter i:l bv
i<-...,.....:..
<-r
a6
Problem : Desigrt smaiiesr hnear-iiedback rccister thatrvill produce klonn sequence s.,lldromes. ol = A(x) is oismallesrdegiee- v only one, sinceoriginal.solLrtion was unique.
If syndromes represent colTectable a elTorpattemthenrishtnost tap "+0. To designthe shift resjsterneedto deterrrrine 1) L - shift regrsterlength 2) A(x):A,x'+,t,1x''r+........+1,1+1 Feedbackconnecrion pollnomial DesignProcedure- Inductive Assumewe have desigled a seriesof shili registers.
\ ! r . | ' l l \ ^ ) l
LI
C o r n l u t eo u t n u i i i l . , . o
. \ \ i
\'
S
r - .) .l -
' I
5 Lra3
l)
.\
'-\
l- \
lr:r:il \
.
'.rr il.. \
,. 1
: r , illri:(rfL:riri1 r
\ 1 , , , .15: n . i . '
:L:.: . .a
. ' . ( \ r \
i , . i , ,
\
.J',.,.'.
A,i'rs,,.=|
J- )
is equalto zcro. No'.v.\.' : A, 1 -A:\; if 1 is chosen re rr,n r io = So, Choosem so that A- + 0 and A = -.\ \.A , ' : L \ .- A , A m ' r ^ m : 0
'iir'ilusr Ftnail.,- c.rric: trl bc -;ilci t:tl: L- is:iti si.rltaf. i-ltss-,f,il r t i i i J . a : t a , r al:: i h e n o s t ; e c : : : i t e l a : l o : tl i , r , . ' . : : : . : I . . I _
_r)
"
rri l- : .ritJ.: i . : i: I . L.r'-n go io l. { liei3iro:rscontinueuntil r 2t) '11.,..: l.::l::l :l-:L,l;hm itrrittes L. rn,-lthe co;rec.:-.: ;-ol|nrtililJ ii:111sas iiliou ::
( -oi:rlrL:i
. S,, : Sc,
ira)ril
' L S.
. ) ' r l i l , ) l. r i b L r l\h = t l a n d l l . , r :r l
:ll
iiavinl lr:r,::Lr i:c error locatirtns (A(r)) t,.:.;lsrt;r :s tLr(iijiinnrrr r-ia rilri nrag:lii;.lts (lor nonbinan BCll codcs). Again ml.-rr ilr.'rsion is circurlventedusins Froier's liconthnt.
D:lir:
: , . . ,\
,l \
,
l:
s f r . r , ,' , ,
li
ti .1,l
, ,
', " ,/ _
+ ( ./
2{;.
'/,
) i ..,
, , , ' / '
f!r
:r
'Xlrr '
'
T T I l _
:.'.;,l
ELrd l\- )
Lr-1i=1
I
_t_ l :
) 1Y , X ,i t
I T l tli ::=i
.\,
\.-\ l1 \ - .
ii T l r I
i := . ! .- :
r..l rt(ta t )
\_' \ r fl T r l - \ . r ) I
t.-
alairi rilll{ilLLJCa::: -,
1 r 1,
l,L\
: l-iir r,.\ l
i ' r r r r i Fror i-1
r _ \ 1 I tt ir l l
i=i i='
\'i\
I*
\rt\
-\r /
- x,\, ,l .-'
)'oil
i X,fI(1 r , \ , )
-\'(X,') : Finall): ir r:c:e thar t er;oisoccurs algoriilu l:i]s. r: . an ulcorreci:ble eror
Di1[elll Occ',I{ed.
x,fI(r
)=!
xj'xrJ
,:-p