A Modified Belief Propagation Algorithm Based on Attenuation of the Extrinsic LLR

In this paper, we propose a modification to Belief Propagation (BP) decoding algorithm for LDPC codes. The modification is to attenuate the check to bit extrinsic logarithm likelihood ratio by a factor $\alpha$, when sudden sign change happens. This modification can be applied to both the standard BP algorithm and the joint row and column (JRC) BP algorithm. Simulation results show that the BER and WER performance of both traditional BP and JRC BP algorithms is improved by this method. The expense of the proposed modification is a slight increase in the average number of decoding iterations.

[1]  Thomas J. Richardson,et al.  Error Floors of LDPC Codes , 2003 .

[2]  D.E. Hocevar,et al.  A reduced complexity decoder architecture via layered decoding of LDPC codes , 2004, IEEE Workshop onSignal Processing Systems, 2004. SIPS 2004..

[3]  Paul Fortier,et al.  Lowering Error Floor of LDPC Codes Using a Joint Row-Column Decoding Algorithm , 2007, 2007 IEEE International Conference on Communications.

[4]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

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

[6]  Toshinobu Kaneko,et al.  Modified Belief Propagation Decoding Algorithm for Low-Density Parity Check Code Based on Oscillation , 2006, 2006 IEEE 63rd Vehicular Technology Conference.

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

[8]  Simon Litsyn,et al.  Efficient Serial Message-Passing Schedules for LDPC Decoding , 2007, IEEE Transactions on Information Theory.

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