DocumentCode
3433275
Title
A modified algorithm for correction of errors and erasures in Reed Solomon decoders
Author
Guidotti, G. ; Santoli, T.
Author_Institution
Alcatel Telettra Chieti, Italy
fYear
1992
fDate
16-20 Nov 1992
Firstpage
882
Abstract
Decoders for t-error correcting RS codes sometimes incorporate also the ability to recover erasures. The option of controlling erasures can be viewed as a way of sending more information to the decoder about the actual received signal. An elegant method of correcting any patterns of ε errors and e erasures has been suggested by Berlekamp. Using Berlekamp´s algorithm, some authors have shown how to derive the combined error and erasure locator polynomial. The present authors describe how it is possible to find the error-locator polynomial and the erasure-locator polynomial in an independent way, so that the computational complexity can be reduced. While the erasure-locator polynomial can easily be computed from the knowledge of erasure locations, the error-locator polynomial is obtained using the Berlekamp´s algorithm with a particular change in the initial conditions
Keywords
Reed-Solomon codes; computational complexity; decoding; error correction codes; polynomials; telecommunication channels; Reed Solomon decoders; computational complexity; e erasures; epsilon errors; erasure locator polynomial; error-locator polynomial; modified Berlekamp algorithm; t-error correcting RS codes; telecom channels; Change detection algorithms; Decoding; Error correction; Gaussian noise; Interference; Parity check codes; Polynomials; Protection; Reed-Solomon codes; Tires;
fLanguage
English
Publisher
ieee
Conference_Titel
Singapore ICCS/ISITA '92. 'Communications on the Move'
Print_ISBN
0-7803-0803-4
Type
conf
DOI
10.1109/ICCS.1992.255136
Filename
255136
Link To Document