Scribd
Upload
48 views17 pages

A Class of One-Step Majority Logic Decodable Codes: Presented by

1) The document discusses one-step majority logic decodable codes and presents a theorem stating that an extended cyclic code Ce is invariant under affine permutation if every root of the generator polynomial g(x) of the cyclic code C is mapped to another root under affine permutation. 2) An example is provided to illustrate the construction of a (15,6) one-step majority logic decodable cyclic code C and its corresponding type1 code C1. 3) The code C can correct up to t=[5/2]=2 errors using majority logic decoding and is generated by the polynomial g(x)=(1+x+x4+x5+x6+x9).

Uploaded by

santhu141986
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
48 views17 pages

A Class of One-Step Majority Logic Decodable Codes: Presented by

1) The document discusses one-step majority logic decodable codes and presents a theorem stating that an extended cyclic code Ce is invariant under affine permutation if every root of the generator polynomial g(x) of the cyclic code C is mapped to another root under affine permutation. 2) An example is provided to illustrate the construction of a (15,6) one-step majority logic decodable cyclic code C and its corresponding type1 code C1. 3) The code C can correct up to t=[5/2]=2 errors using majority logic decoding and is generated by the polynomial g(x)=(1+x+x4+x5+x6+x9).

Uploaded by

santhu141986
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 17

St.

Joseph Engineering College


Vamanjoor, Mangaluru

Department of Electronics and Communication

A class of one-step majority logic


decodable codes

4/26/16

Presentedby:

Santhosh
USN:4SO14LDS09
4thSemM.Tech(DECS)

Department of ECE, SJEC,


Vamanjoor

Let C be a (n , k) cyclic code generated by g (x), where n = 2m


1. we extend the vector v = (v0, v1, , v n-1) by adding overall
parity bit v where

New vector Ve is
(, v0, v1, . V(n-1))
Ve
V =1 if weight of v is odd
V =0 if weight of v is even
Hence 2k extended vector form an (n+1, k) linear code denoted
by Ce.
4/26/16

Department of ECE, SJEC,


Vamanjoor

numbered as
is

V0 is numbered as

And for 1i -1 the component Vi is numbered as

All these numbers are known as location numbers

Y-> location of the component of Ve

Affine permutation is given by


Z=aY+b

4/26/16

Department of ECE, SJEC,


Vamanjoor

Example
the following vector of 16 components which
Concider
are numbered
with the elements of GF()

Applying affine permuntation


Z= aY+b

The resultant vector is

4/26/16

Department of ECE, SJEC,


Vamanjoor

4/26/16

Department of ECE, SJEC,


Vamanjoor

is invariant under affine permutation if every


Ce
permutation
carry every code word in Ce into another

code word in Ce

h is non negative integer and is given by


h=++..
is the another non negative integer less than and is given by

is said to be descendant of h if

4/26/16

Department of ECE, SJEC,


Vamanjoor

Theorem :
Let C be a cyclic code of length n= 2m-1 generated by g(x)
Let Ce be the extended code obtained by applying overall
parity check digit to the C. let be the primitive element
of the GF(2m). Then the extended code Ce is invariant
under affine permutation if and only if for every that is a
root of generator polynomial g(x) of C and for every
is also a root of g(x)
A cyclic code of length n= 2m-1 whose generator
polynomial satisfies the condition given in above theorem
is said to have the doubly transitive invariant property

4/26/16

Department of ECE, SJEC,


Vamanjoor

Let J and L be the two factors of 2m-1 such that


J.L= 2m-1

Then the polynomial X


X

2m-1

+1 is factorized as

+1 = (1+XJ) (1+ XJ+ X2J+ ..X(L-1)J)

2m-1

Where
= (1+ XJ+ X2J+ ..X(L-1)J)

Since
(L)J =

1+XJ has a root 1,

2L

2m-1

(J-1)L

4/26/16

Department of ECE, SJEC,


Vamanjoor

To
form a polynomial H(X) over GF(2):

H(X) has

as a root if and only if

is a root of

is also a root of

To show that code C is one step majority logic


decodable
First we need to determine the J vector from C which
is the dual of C

Let V0 V1.V
X(J-1)

4/26/16

J-1

be the J code vectors of ,X ,.

Department of ECE, SJEC,


Vamanjoor

overall parity check bit we obtain a J vector


Adding

u u .u

J-1

Since L is odd the overall parity check digit is 1

Now applying the affine permutation


Z=

To the vector u0 u1.u


also in Ce

J-1

2m-2

to achieve z0 z1.z

J-1

which is

Deleting digit at location at from z0 z1.z J-1 we obtain J


vector w0 w1.wJ-1 which are the vectors in C and are
orthogonal on the digit at location 2m-2
Therefore the cyclic code generated by g(x)= X 2m-k-1 G(X-1) is
the one step majority logic decodable code and it is also
known as type0 one step majority logic decodable DTI code.
4/26/16

Department of ECE, SJEC,


Vamanjoor

10

Example
m=5
TheLet
factorization applies as

Thus J=5 L=3 and


(1+X5) has a roots 1,

(1+X5+X10) has a roots


H(X) has a root

4/26/16

12

10

11

13

14

Department of ECE, SJEC,


Vamanjoor

11

(x) is the minimal polynomial for

Then H(X) can be calculated as

(x) is the minimal polynomial for

10

(x) 5(x) = (1+X+X4) (1+X+X2)


H(X)= (1+X3+X4+X5+X6)

The polynomial ,X , X2, X3, X4 are the code


polynomials in C

The dual code of C is generated by


g(x)= X 9G(X -1)= (1+X+X4+X5+X6+X9)

To decode:
The vector corresponding to ,X , X2, X3, X4 are given as
4/26/16

Department of ECE, SJEC,


Vamanjoor

12

Adding overall parity bit

4/26/16

Department of ECE, SJEC,


Vamanjoor

13

Applying affine permutation z= Y+

14

Deleting overall parity bits

4/26/16

Department of ECE, SJEC,


Vamanjoor

14

Let r=(r0, r1, r2, r3, r4, r5, r6, r7, r8, r9, r10, r11, r12,
r13, r14)

Then the parity check sums orthogonal on e 14 are

4/26/16

Department of ECE, SJEC,


Vamanjoor

15

Therefore the (15,6) cyclic code C generated by g(x) is


one-step majority decodable and is capable of
correcting t ML=[5/2]=2 or fewer error
Let H 1 (X)=(X+1)H(X)
C 1 -cyclic code generated by H 1 (X)
C

- cyclic code generated by H(X)

Dual code of C 1 is denoted by C 1 is the one-step


majority logic decodable
And C 1 is called type1 DTI code its dimensions is
one greater than that of its corresponding typ0 DTI
code
4/26/16

Department of ECE, SJEC,


Vamanjoor

16

Thank you

4/26/16

Department of ECE, SJEC,


Vamanjoor

17

You might also like