List Decoding of Generalized Reed-Solomon Codes by Using a Modified Extended Key Equation Algorithm

This work presents a modified extended key equation algorithm in list decoding of generalized Reed-Solomon (GRS) codes. A list decoding algorithm of generalized Reed-Solomon codes has two steps, interpolation and factorization. The extended key equation algorithm (EKE) is an interpolation-based approach with a lower complexity than Sudan's algorithm. To increase the decoding speed, this work proposes a modified EKE algorithm to perform codeword checking prior to such an interpolation process. Since the evaluation mapping is engaged in encoding, a codeword is not generated systematically. Thus, the transmission information is not directly obtained from a received codeword. Therefore, the proposed algorithm undertakes a matrix operation to obtain the transmission information once a received vector has been checked to be error-free. Simulation results demonstrate that the modified EKE algorithm in list decoding of a GRS code provides low complexity, particularly at high signal-to-noise ratios.

[1]  Madhu Sudan,et al.  Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[2]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[3]  Shyue-Win Wei,et al.  Step-by-step decoding algorithm for Reed-Solomon codes , 2000 .

[4]  Ramin Rezaiifar,et al.  cdma2000/sup /spl reg// high rate broadcast packet data air interface design , 2004, IEEE Communications Magazine.

[5]  L. Litwin,et al.  Error control coding , 2001 .

[6]  Alexander Vardy,et al.  Algebraic soft-decision decoding of Reed-Solomon codes , 2003, IEEE Trans. Inf. Theory.

[7]  Peter Seibt Error Control Codes , 2006 .

[8]  Gui Liang Feng,et al.  A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes , 1991, IEEE Trans. Inf. Theory.

[9]  Xin-Wen Wu,et al.  List decoding of q-ary Reed-Muller codes , 2004, IEEE Transactions on Information Theory.

[10]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.

[11]  S. Wicker Error Control Systems for Digital Communication and Storage , 1994 .

[12]  Sergei V. Fedorenko A simple algorithm for decoding Reed-Solomon codes and its relation to the Welch-Berlekamp algorithm , 2005, IEEE Transactions on Information Theory.

[13]  Shu Lin,et al.  Error Control Coding , 2004 .

[14]  James L. Massey,et al.  Step-by-step decoding of the Bose-Chaudhuri- Hocquenghem codes , 1965, IEEE Trans. Inf. Theory.

[15]  Robert J. McEliece,et al.  The Theory of Information and Coding , 1979 .

[16]  Neil J. A. Sloane,et al.  The theory of error-correcting codes (north-holland , 1977 .

[17]  Ron M. Roth,et al.  Efficient decoding of Reed-Solomon codes beyond half the minimum distance , 2000, IEEE Trans. Inf. Theory.

[18]  Shyue-Win Wei,et al.  High-speed decoder of Reed-Solomon codes , 1993, IEEE Trans. Commun..