REED-SOLOMON DECODER BASED ON UNIFIED SYNDROME COMPUTATION

Presented By

CH.RAMESH KUMAR

Reg. No.
Guided By

1581110050
Mrs.SUGANTHI.K

Proposed LCC RS decoder based on USC

Proposed USC

Syndrome calculation and Syndrome Updates Architectures:

The hard-decision codeword should be rHD(x) = r0_HD + r1_HD x + r (n1) _HD

CHIEN SEARCH AND FORNEY ALGORITHM WITH ERROR CORRECTION BLOCK:

CHIEN SEARCH

For example the error location polynomial is

(x)=1+ 1(x)+ 2(x)+ 3(x)

we evaluate (x) at each non-zero element in GF(2m) x=1,x=,x=2,x=(2m-2) (1)=1+ 1(1)+ 2(1)2+ 3(1)3

()=1+ 1()+ 2()2+ 3()3

((2m-2))=1+ 1((2m-2))+ 2((2m-2))2+ 3((2m-2))3 if in the above performed substitutions we obtain (i)=0,then the exponent of the inverse of the root i is equal to the error location index i.

FORNEY SEARCH

Forney algorithm is used to compute the error magnitude

ei=w(i)/(i)
where (x) represents the first derivative of the error locator polynomial (x). The output of the odd stages of the chien search error location is also used in the Forney algorithm. The sum of the odd stages represents the denominator of the Forney equation. The summed value is inverted using the inversion ROM in the Forney algorithm and then multiplied by the numerator value that is formed from evaluating the error evaluator polynomial. The output is ANDed with the Zero detect output since the error values are only valid for the actual error locations.

SYNDROME UPDATE UNIT:

CHIEN SEARCH BLOCK:

RS decoder based on USC

conclusion
The latency of the proposed RS decoder has been taking 275 clock cycles. Three pipelining stages.

THANK YOU

KES in RIBM

Control unit