New stopping criteria for iterative decoding of LDPC codes in H‐ARQ systems

SUMMARY Under severely unreliable channel, decoding of error-correcting codes frequently fails, which requires a lot of computational complexity, especially, in the iterative decoding algorithm. In hybrid automatic repeat request systems, most of computation power is wasted on failed decoding if a codeword is retransmitted many times. Therefore, early stopping of iterative decoding needs to be adopted. In this paper, we propose a new stopping algorithm of iterative belief propagation decoding for low-density parity-check codes, which is effective on both high and low signal-to-noise ratio ranges and scalable to variable code rate and length. The proposed stopping algorithm combines several good stopping criteria. Each criterion is extremely simple and will not be a burden to the overall system. With the proposed stopping algorithm, it is shown via numerical analysis that the decoding complexity of hybrid automatic repeat request system with adaptive modulation and coding scheme can be fairly reduced. Copyright © 2012 John Wiley & Sons, Ltd.

[1]  M. Darnell,et al.  Error Control Coding: Fundamentals and Applications , 1985 .

[2]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .

[3]  Jeongseok Ha,et al.  A Stopping Criterion for Low-Density Parity-Check Codes , 2007, 2007 IEEE 65th Vehicular Technology Conference - VTC2007-Spring.

[4]  Li Ping,et al.  Zigzag codes and concatenated zigzag codes , 2001, IEEE Trans. Inf. Theory.

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

[6]  Jin Li,et al.  Early stopping for LDPC decoding: convergence of mean magnitude (CMM) , 2006, IEEE Communications Letters.

[7]  Niyazi Odabasioglu,et al.  Performance of joint multilevel/AES‐LDPCC‐CPFSK schemes over wireless sensor networks , 2010, Int. J. Commun. Syst..

[8]  N. Wehn,et al.  Low complexity stopping criterion for LDPC code decoders , 2005, 2005 IEEE 61st Vehicular Technology Conference.

[9]  Shu Lin,et al.  Two simple stopping criteria for turbo decoding , 1999, IEEE Trans. Commun..

[10]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

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

[12]  Chia-Yu Lin,et al.  Operation reduced low‐density parity‐check decoding algorithms for low power communication systems , 2013, Int. J. Commun. Syst..

[13]  S.H. Lin,et al.  Diversity protections for digital radio-summary of ten-year experiments and studies , 1988, IEEE Communications Magazine.

[14]  Zhigang Cao,et al.  Non-binary type-II HARQ and its application to an adaptive system , 2005, Int. J. Commun. Syst..

[15]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[16]  H. Jin,et al.  Irregular repeat accumulate codes , 2000 .

[17]  Iti Saha Misra,et al.  Performance study of mobile WiMAX network with changing scenarios under different modulation and coding , 2011, Int. J. Commun. Syst..