Improved bit-flipping decoding of low-density parity-check codes

In this correspondence, a new method for improving hard-decision bit-flipping decoding of low-density parity-check (LDPC) codes is presented. Bits with a number of unsatisfied check sums larger than a predetermined threshold are flipped with a probability p /spl les/ 1 which is independent of the code considered. The probability p is incremented during decoding according to some rule. With a proper choice of the initial p, the proposed improved bit-flipping (BF) algorithm achieves gain not only in performance, but also in average decoding time for signal-to-noise ratio (SNR) values of interest with respect to p = 1.

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

[2]  M. Luby,et al.  Improved low-density parity-check codes using irregular graphs and belief propagation , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[3]  Zhenyu Liu,et al.  Low complexity decoding of finite geometry LDPC codes , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[4]  Axthonv G. Oettinger,et al.  IEEE Transactions on Information Theory , 1998 .

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

[6]  Suquan Ding.  Iterative Decoding of L-step Majority-Logic Decodable Codes Based on Belief Propagation , 2007, International Conference on Wireless Communications, Networking and Mobile Computing.

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

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

[9]  Daniel A. Spielman,et al.  Improved low-density parity-check codes using irregular graphs and belief propagation , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[10]  David J. C. MacKay,et al.  Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.

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

[12]  Evangelos Eleftheriou,et al.  Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.

[13]  Frank R. Kschischang,et al.  A simple taboo-based soft-decision decoding algorithm for expander codes , 1998, IEEE Communications Letters.

[14]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[15]  Amir H. Banihashemi,et al.  Decoding low-density parity-check codes with probabilistic scheduling , 2001, IEEE Communications Letters.

[16]  Shu Lin,et al.  Iterative decoding of one-step majority logic deductible codes based on belief propagation , 2000, IEEE Trans. Commun..

[17]  Jovan Dj. Golic,et al.  A method for convergence analysis of iterative probabilistic decoding , 2000, IEEE Trans. Inf. Theory.

[18]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[19]  Amir H. Banihashemi,et al.  Bootstrap decoding of low-density parity-check codes , 2002, IEEE Communications Letters.