Documente Academic
Documente Profesional
Documente Cultură
On
Reed Solomon Encoding And Decoding
Submitted by:
Akhilesh Yadav
Table of Contents
1. Introduction
2. Elements Of RS Codes
3. GF Multiplication
4. GF division
5. RS Encoding
6. RS Decoding
1.Introduction
1) Communication System.
2) Storage System.
Fig.1. RS Encoder
2.Elements Of RS codes
• Primitive Polynomial.
• Generator Polynomial
• Parity bits
• Galois Field(GF[2^9])
2.Elements Of RS codes(cont.)
• Primitive
polynomial for RS(450,406) is.
0 0 0 0 0 0 0 1 0
0 0 0 0 0 0 1 0 0
…. … …. …
1 0 0 0 0 0 0 0 0
0 0 0 0 1 0 0 0 1
… … … … .. ..
1 0 0 0 0 1 0 0 0
MSB 9 8 7 6 5 4 3 2 1 LSB
10 0
P(x) 0 1 0 0 0 0 1 0 0 0 1
i
g(x) 1 1 1 1 1 1 0 0 1 1 1
j
• Error correction.
6. RS Decoder(cont.)
• rx).
• for
•
1. Syndrom Calculator(cont.)
• .
•
Key-equation solver(KES) Block(cont.)
•• Relation
between syndrome and coefficient of error locator polynomial which
is called as the Newton’s identities.
..
..
2.Berlekamp-massey Algorithm(cont.)
•
• BM is more efficient for calculating the polynomial.
••
Two “scratch” polynomials with initial values =1 and =-1.
• For each successive value of the algorithm determines and from and .
• These divisions are most efficiently handled by first computing , the inverse of
and then multiplying each coefficient of by inverse of .
• The resulting circuit implementation would have a smaller critical path delay and
higher clock speeds would be usable.
2.1 Inversionless Berlekamp-massey Algorithm
• DC block contains:
•
• This values passes together with and MC(r) to ELU block.
•: .,.
• Then
.
• If the condition is not true:
then = .
=,.
2.1.1 Architecture of iBM algorithm(cont.)
••
These three steps will be executed to 2t cycle and after 2t cycle one t
cycle will be executed for calculating the value of error evaluator
polynomial.
•
3. Chien -Search Algorithm
•
• This algorithm is used to evaluate the error position.
2) Forney algorithm.
•.
• Equation gives the valid results for the symbol position containing an error.
•
4. Forney Algorithm(cont.)
omega v-1
3) Brute-force search.
3. Brute-force search
•
• Suppose and are the polynomials in