Low-Complexity Soft-Decoding Algorithms for Reed–Solomon Codes—Part II: Soft-Input Soft-Output Iterative Decoding

In this paper, we present a practical approach to the iterative decoding of Reed-Solomon (RS) codes. The presented methodology utilizes an architecture in which the output produced by steps of belief-propagation (BP) is successively applied to a legacy decoding algorithm. Due to the suboptimal performance of BP conducted on the inherently dense RS parity-check matrix, a method is first provided for the construction of reduced-density, binary, parity-check equations. Iterative decoding is then conducted utilizing a subset of a redundant set of parity-check equations to minimize the number of connections into the least-reliable bits. Simulation results show that performance comparable to (and exceeding) the best known practical RS decoding techniques is achievable with the presented methodology. The complexity of the proposed algorithm is significantly lower than these existing procedures and permits a practical implementation in hardware.

[1]  Wenyi Jin,et al.  GEN03-3: Enhanced Box and Match Algorithm for Reliability-Based Soft-Decision Decoding of Linear Block Codes , 2006, IEEE Globecom 2006.

[2]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[3]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[4]  Krishna R. Narayanan,et al.  Iterative soft decoding of Reed-Solomon codes , 2004, IEEE Communications Letters.

[5]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[6]  Krishna R. Narayanan,et al.  Iterative Soft-Input Soft-Output Decoding of Reed–Solomon Codes by Adapting the Parity-Check Matrix , 2005, IEEE Transactions on Information Theory.

[7]  P. Vontobel,et al.  Constructions of LDPC Codes using Ramanujan Graphs and Ideas from Margulis , 2000 .

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

[9]  Krishna R. Narayanan,et al.  Iterative Soft-Input Soft-Output Decoding of Reed-Solomon Codes by Adapting the , 2005 .

[10]  Aleksandar Kavcic,et al.  Low-Complexity Soft-Decoding Algorithms for Reed–Solomon Codes—Part I: An Algebraic Soft-In Hard-Out Chase Decoder , 2010, IEEE Transactions on Information Theory.

[11]  Robert B. Ash,et al.  Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.

[12]  Krishna R. Narayanan,et al.  Algebraic Soft-Decision Decoding of Reed–Solomon Codes Using Bit-Level Soft Information , 2006, IEEE Transactions on Information Theory.

[13]  Krishna Narayanan,et al.  Pseudorandom construction of low-density parity-check codes using linear congruential sequences , 2002, IEEE Trans. Commun..

[14]  R. M. Tanner,et al.  A Class of Group-Structured LDPC Codes , 2001 .

[15]  Robert J. McEliece,et al.  Iterative algebraic soft-decision list decoding of Reed-Solomon codes , 2005, IEEE Journal on Selected Areas in Communications.

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

[17]  Shu Lin,et al.  Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.