ERROR CONTROL CODING

One Step Majority Logic

Decoder

What is One Step Majority Logic Decoding?

General Type II one step majority

logic decoder

General Type II One Step Majority

Logic Decoder Steps

General Type I one step majority

logic decoder

General Type I one step majority

logic decoder steps

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.

Most majority-logic decodable codes

found so far are cyclic codes.

In error detection and correction, majority

logic decoding is a method to decode
repetition codes, based on the assumption
that the largest number of occurrences of a
symbol was the transmitted symbol.
MAJORITY-LOGIC decoding is a simple
procedure,
particularly suited for hardware
implementations using
most elementary circuits.

Why is Multiple step Majority logic

Decoding used..?????
The one-step majority-logic decoding
for a cyclic code is based on the
condition that a set of J parity-check
sums orthogonal on a single error digit
can be formed.
This decoding method is effective for
codes that are completely
orthogonalizable or for codes with large
J compared to their minimun distance
dmin.

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 ).

TYPES OF MAJORITY LOGIC

DECODER

There are two types of implementing

majority logic decoder:
TYPE-I
Determines, XOR combinations of the
syndrome, which bits need to be
corrected.
TYPE-II
Calculates directly out of the given
codeword bits the information of
correctness of the current bit under
decoding.

TYPE-II L-STEP MAJORITY LOGIC

DECODER

STEPS INVOLVED IN THE

DECODING PROCEDURE

TYPE-I L-STEP MAJORITY LOGIC

DECODER

STEPS INVOLVED IN DECODING

PROCEDURE

EXISTING OUTCOMES FROM

MAJORITY LOGIC DECODER
(EXISTING SYSTEM)
Majority logic decoder is based on a number of
parity check equations which are orthogonal to
each other, at each iteration, each code word
bit only participates in one Parity checks
equation, except the very first bit which
contributes to all equations.

When the memory is read, the codeword is

then fed through the majority logic decoder
before sent to the output for further processing.