Guessing facets: polytope structure and improved LP decoder
IEEE Transactions on Information Theory
An efficient algorithm to find all small-size stopping sets of low-density parity-check matrices
IEEE Transactions on Information Theory
A differential binary message-passing LDPC decoder
IEEE Transactions on Communications
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
| Hi-index | 0.19 |
In this paper, reliability based decoding is combined with belief propagation (BP) decoding for low-density parity check (LDPC) codes. At each iteration, the soft output values delivered by the BP algorithm are used as reliability values to perform reduced complexity soft decision decoding of the code considered. This approach allows to bridge the error performance gap between belief propagation decoding which remains suboptimum, and maximum likelihood decoding which is too complex to be implemented for the codes considered. Trade-offs between decoding complexity and error performance are also investigated. In particular, a stopping criterion which reduces the average number of iterations at the expense of very little performance degradation is proposed for this combined decoding approach. Simulation results for several Gallager (1963, 1968) LDPC codes and different set cyclic codes of hundreds of information bits are given and elaborated