Performance analysis of linear codes under maximum-likelihood decoding: a tutorial
Communications and Information Theory
Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation
ICMCTA '08 Proceedings of the 2nd international Castle meeting on Coding Theory and Applications
Improved random redundant iterative HDPC decoding
IEEE Transactions on Communications
Iterative decoding on multiple Tanner graphs using random edge local complementation
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Turbo decoding of product codes using adaptive belief propagation
IEEE Transactions on Communications
IEEE Journal on Selected Areas in Communications
List decoding techniques for intersymbol interference channels using ordered statistics
IEEE Journal on Selected Areas in Communications
Blind frame synchronization of product codes based on the adaptation of the parity check matrix
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A low complexity iterative technique for soft decision decoding of reed-solomon codes
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Stochastic chase decoding of reed-Solomon codes
IEEE Communications Letters
Applications of adaptive belief propagation decoding for long Reed-Solomon codes
AST/UCMA/ISA/ACN'10 Proceedings of the 2010 international conference on Advances in computer science and information technology
IEEE Transactions on Information Theory
Multiple-bases belief-propagation decoding of high-density cyclic codes
IEEE Transactions on Communications
Boolean functions over nano-fabrics: improving resilience through coding
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
PN Code Acquisition Using Belief Propagation with Adaptive Parity Check Matrix
Wireless Personal Communications: An International Journal
Hi-index | 754.90 |
An iterative algorithm is presented for soft-input soft-output (SISO) decoding of Reed-Solomon (RS) codes. The proposed iterative algorithm uses the sum-product algorithm (SPA) in conjunction with a binary parity-check matrix of the RS code. The novelty is in reducing a submatrix of the binary parity-check matrix that corresponds to less reliable bits to a sparse nature before the SPA is applied at each iteration. The proposed algorithm can be geometrically interpreted as a two-stage gradient descent with an adaptive potential function. This adaptive procedure is crucial to the convergence behavior of the gradient descent algorithm and, therefore, significantly improves the performance. Simulation results show that the proposed decoding algorithm and its variations provide significant gain over hard-decision decoding (HDD) and compare favorably with other popular soft-decision decoding methods