Fast algorithm for computing the roots of error locator polynomials up to degree II in Reed-Solomon decoders

Authors
Truong, TK Jeng, JH Reed, IS
Citation
Tk. Truong et al., Fast algorithm for computing the roots of error locator polynomials up to degree II in Reed-Solomon decoders, IEEE COMMUN, 49(5), 2001, pp. 779-783
Citations number
9
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
IEEE TRANSACTIONS ON COMMUNICATIONS
ISSN journal
00906778 → ACNP
Volume
49
Issue
5
Year of publication
2001
Pages
779 - 783
Database
ISI
SICI code
0090-6778(200105)49:5<779:FAFCTR>2.0.ZU;2-9
Abstract
The central problem in the implementation of a Reed-Solomon code is finding the roots of the error locator polynomial. In 1967, Berlekamp et al, found an algorithm for finding the roots of an affine polynomial in GF(2(m)) tha t can be used to solve this problem, In this paper, it is shown that this B erlekamp-Rumsey-Solomon algorithm, together with the Chien-search method, m akes possible a fast decoding algorithm in the standard-basis representatio n that is naturally suitable in a software implementation. Finally, simulat ion results for this fast algorithm are given.