DocumentCode
414899
Title
An algorithm for t+1 error correction in Reed-Solomon codes
Author
Egorov, S.I. ; Markarian, G.
Author_Institution
Dept. of Comput. Eng., Kursk State Tech. Univ., Russia
Volume
2
fYear
2004
fDate
20-24 June 2004
Firstpage
651
Abstract
A modification of Blahut algorithm is proposed for decoding of Reed-Solomon codes beyond half the minimum distance. An effective method is offered for the searching of unknown discrepancies needed for analytical continuation of the Berlekamp-Massey algorithm through two additional iterations. This reduces the search time compared to Blahut algorithm considerably. An architecture of a searcher for unknown discrepancies is given. The coding gain and implementation complexity of the proposed algorithm is shown for some practical codes.
Keywords
Reed-Solomon codes; computational complexity; error correction codes; iterative decoding; search problems; Berlekamp-Massey algorithm; Blahut algorithm; Reed-Solomon codes; coding gain; decoding; error correction; implementation complexity; search time; Algorithm design and analysis; Error correction; Error correction codes; Error probability; Fourier transforms; Galois fields; Iterative decoding; Polynomials; Reed-Solomon codes; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 2004 IEEE International Conference on
Print_ISBN
0-7803-8533-0
Type
conf
DOI
10.1109/ICC.2004.1312582
Filename
1312582
Link To Document