Error-Erasure Decoding for Reed-Solomon Codes Based on Welch-Berlekamp Algorithm

• Main Authors: Po-Ting Lin, 林柏廷
• Other Authors: Yunghsiang Sam Han
• Format: Others
• Language: en_US
• Published: 2011
• Online Access: http://ndltd.ncl.edu.tw/handle/29041312717773038555

碩士 === 國立臺北大學 === 通訊工程研究所 === 99 === Reed-Solomon codes are well-known to have good error-correcting capabilities in communication system and data storage. The decoding procedure of Reed-Solomon codes has four steps: syndrome computation, solving key equation, finding roots of error locator polynomial, calculating error magnitudes. The Welch-Berklamp algorithm is different from traditional decoding methods where it avoids the syndrome computation and uses the more simple way to express the information about the errors. Instead of calculating syndromes it calculates a remainder from the generator polynomial. This calculation is the same as the encoding process of the Reed-Solomon code which will save hardware complexity when the encoder is decoder are both implemented in the same device. It has been known for many years that erasure can improve the capabilities of error-correcting. For storage applications, erasure decoding usually has good performance. Decoding algorithm with erasure effectively enhance the error correction capability. In this thesis we implemented two error/erasure decoders of Reed-Solomon codes based on Welch-Berklamp algorithm and testify they both can correct errors and erasures.