Decoding of Reed Solomon codes beyond the error-correction bound
Journal of Complexity
Information Theory, Inference & Learning Algorithms
Information Theory, Inference & Learning Algorithms
Low-complexity soft decoding algorithms for reed-solomon codes
Low-complexity soft decoding algorithms for reed-solomon codes
IEEE Transactions on Information Theory
Low-density parity-check codes based on finite geometries: a rediscovery and new results
IEEE Transactions on Information Theory
Algebraic soft-decision decoding of Reed-Solomon codes
IEEE Transactions on Information Theory
Iterative Soft-Input Soft-Output Decoding of Reed–Solomon Codes by Adapting the Parity-Check Matrix
IEEE Transactions on Information Theory
Iterative algebraic soft-decision list decoding of Reed-Solomon codes
IEEE Journal on Selected Areas in Communications
| Hi-index | 754.84 |
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.