One Step Majority Decoder
One Step Majority Decoder
One Step Majority Decoder
MULTIPLE
STEP
MAJORITY
LOGIC
DECODING
INTRODUCTION
Majority-Logic decoding algorithm was
devised in 1954 by Reed for a class of
multiple-error-correcting codes
discovered by Muller.
COMPUTATION
Definition A set of J parity check sums
A1,A2,,AJ
is said to be orthogonal on the set E if and only if
Every error digit eil in E is checked by every
check
sum Aj for 1 j J
no other error digit is checked by more than one
check sum.
L-STEP ORTHOGONOLIZATION:
A code is said to be L-step orthogonalizable (or Lstep
majority-logic decodable) if L-steps of
orthogonalization are required to make a decoding
decision on an error digit. The decoding process is
called L-step majority-logic decoding.
A code is said to be completely L-step
orthogonalizable if J is one less than the minimun
distance of the code ( i.e., J = dmin-1 ).