DocumentCode :
1190192
Title :
A modified Blahut algorithm for decoding Reed-Solomon codes beyond half the minimum distance
Author :
Egorov, Sergey ; Markarian, Garik ; Pickavance, Keith
Author_Institution :
Dept. of Comput. Eng., Kursk State Tech. Univ., Russia
Volume :
52
Issue :
12
fYear :
2004
Firstpage :
2052
Lastpage :
2056
Abstract :
A modification of the 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 by 2(q-1)n/((n+t+1)(n-t)) times, compared with the Blahut algorithm. An architecture of a searcher for unknown discrepancies is given. The coding gain of the proposed algorithm is shown for some practical codes.
Keywords :
Reed-Solomon codes; computational complexity; iterative decoding; Berlekamp-Massey algorithm; Reed-Solomon code decoding; modified Blahut algorithm; Algorithm design and analysis; Communications Society; Conferences; Error correction; Error correction codes; Galois fields; Information systems; Iterative decoding; Mobile communication; Polynomials;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/TCOMM.2004.838673
Filename :
1369613
Link To Document :
بازگشت