Check Reliability Based Bit-Flipping Decoding Algorithms for LDPC Codes

We introduce new reliability definitions for bit and check nodes. Maximizing global reliability, which is the sum reliability of all bit nodes, is shown to be equivalent to minimizing a decoding metric which is closely related to the maximum likelihood decoding metric. We then propose novel bit-flipping (BF) decoding algorithms that take into account the check node reliability. Both hard-decision (HD) and soft-decision (SD) versions are considered. The former performs better than the conventional BF algorithm and, in most cases, suffers less than 1 dB performance loss when compared with some well known SD BF decoders. For one particular code it even outperforms those SD BF decoders. The performance of the SD version is superior to that of SD BF decoders and is comparable to or even better than that of the sum-product algorithm (SPA). The latter is achieved with a complexity much less than that required by the SPA.

[1]  Jinghu Chen,et al.  Near optimum universal belief propagation based decoding of low-density parity check codes , 2002, IEEE Trans. Commun..

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

[3]  Hideki Imai,et al.  Reduced complexity iterative decoding of low-density parity check codes based on belief propagation , 1999, IEEE Trans. Commun..

[4]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[5]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[6]  D.J.C. MacKay,et al.  Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.

[7]  Xiaohu You,et al.  New insights into weighted bit-flipping decoding , 2009, IEEE Transactions on Communications.

[8]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[9]  Tong Zhang,et al.  Candidate bit based bit-flipping decoding algorithm for LDPC codes , 2009, 2009 IEEE International Symposium on Information Theory.

[10]  Ajay Dholakia,et al.  Reduced-complexity decoding of LDPC codes , 2005, IEEE Transactions on Communications.

[11]  Ming Jiang,et al.  An improvement on the modified weighted bit flipping decoding algorithm for LDPC codes , 2005, IEEE Communications Letters.

[12]  Ming Jiang,et al.  An improvement on the modified weighted bit flipping decoding algorithm for LDPC codes , 2005, IEEE Commun. Lett..

[13]  Jinghu Chen,et al.  Density evolution for two improved BP-Based decoding algorithms of LDPC codes , 2002, IEEE Communications Letters.

[14]  Marc P. C. Fossorier,et al.  A modified weighted bit-flipping decoding of low-density Parity-check codes , 2004, IEEE Communications Letters.

[15]  David J. C. MacKay,et al.  Encyclopedia of Sparse Graph Codes , 1999 .

[16]  Feng Guo,et al.  Reliability ratio based weighted bit-flipping decoding for LDPC codes , 2005, 2005 IEEE 61st Vehicular Technology Conference.