Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

Iterative Reliability-Based Modified Majority-Logic Decoding for Structured Binary LDPC Codes

  • Chen, Haiqiang (School of Computer, Electronics and Information, Guangxi University) ;
  • Luo, Lingshan (School of Computer, Electronics and Information, Guangxi University) ;
  • Sun, Youming (School of Electronic and Information Engineering, South China University of Technology) ;
  • Li, Xiangcheng (School of Electronic and Information Engineering, South China University of Technology) ;
  • Wan, Haibin (School of Computer, Electronics and Information, Guangxi University) ;
  • Luo, Liping (School of Information Science and Engineering in Guangxi University for Nationalities) ;
  • Qin, Tuanfa (School of Computer, Electronics and Information, Guangxi University)
  • Received : 2014.09.25
  • Published : 2015.08.31
⟨ Previous Next ⟩

Abstract

In this paper, we present an iterative reliability-based modified majority-logic decoding algorithm for two classes of structured low-density parity-check codes. Different from the conventional modified one-step majority-logic decoding algorithms, we design a turbo-like iterative strategy to recover the performance degradation caused by the simply flipping operation. The main computational loads of the presented algorithm include only binary logic and integer operations, resulting in low decoding complexity. Furthermore, by introducing the iterative set, a very small proportion (less than 6%) of variable nodes are involved in the reliability updating process, which can further reduce the computational complexity. Simulation results show that, combined with the factor correction technique and a well-designed non-uniform quantization scheme, the presented algorithm can achieve a significant performance improvement and a fast decoding speed, even with very small quantization levels (3-4 bits resolution). The presented algorithm provides a candidate for trade-offs between performance and complexity.

Keywords

Acknowledgement

Supported by : NSF of China

References

  1. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999. https://doi.org/10.1109/18.748992
  2. X.-Y. Hu, E. Eleftheriou, and D. Arnold, "Regular and irregular progressive edge-growth tanner graphs," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 386-398, Apr. 2005. https://doi.org/10.1109/TIT.2004.839541
  3. Y. Kou, S. Lin, and M. P. C. Fossorier, "Low-density parity-check codes based on finite geometries: A discovery and new results," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2711-2736, Nov. 2001. https://doi.org/10.1109/18.959255
  4. L. Lan et al., "Construction of quasi-cyclic LDPC codes for AWGN and binary erasure channels: a finite field approach," IEEE Trans. Inf. Theory, vol. 53, no. 7, pp. 2429-2458, July 2007. https://doi.org/10.1109/TIT.2007.899516
  5. Z. W. Li et al., "Efficient encoding of quasi-cyclic low-density paritycheck codes," IEEE Trans. Commun., vol. 54, no. 1, pp. 71-78, Jan. 2006. https://doi.org/10.1109/TCOMM.2005.861667
  6. R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inf. Theory, vol. IT-8, pp. 21-28, Jan. 1962.
  7. N. Wiberg, H.-A. Loeliger, and R. Kotter, "Codes and iterative decoding on general graphs," European Trans. Telecommun., vol. 6, pp. 513-526, Sept. 1995. https://doi.org/10.1002/ett.4460060507
  8. J. Zhang and M. P. C. Fossorier, "A modified weighted bit-flipping decoding for low-density parity-check codes," IEEE Commun. Lett., vol. 8, no. 3, pp. 165-167, Mar. 2004. https://doi.org/10.1109/LCOMM.2004.825737
  9. N. Miladinovic and M. P. C. Fossorier, "Improved bit-flipping decoding of low-density parity-check codes," IEEE Trans. Commun., vol. 51, no. 4, pp. 1594-1606, Apr. 2005.
  10. Q. Huang et al., "Two reliability-based iterative majority-logic decoding algorithms for LDPC codes," IEEE Trans. Commun., vol. 57, no. 12, pp. 3597-3606, Apr. 2009. https://doi.org/10.1109/TCOMM.2009.12.080493
  11. C.-Y. Chen et al., "A binary message-passing decoding algorithm for LDPC codes," in Proc. 47th Annual Allerton Conf., Illinois, USA., Nov. 2009, pp. 424-430.
  12. H. Chen et al., "Comparisons between reliability-based iterative min-sum and majority-logic decoding algorithms for LDPC codes," IEEE Trans. Commun., vol. 59, no. 7, pp. 1766-1771, July 2011. https://doi.org/10.1109/TCOMM.2011.060911.100065
  13. K. Zhang, H. Chen, and X. Ma, "Adaptive decoding algorithms for LDPC codes with redundant check nodes," in Proc. ISTC, Gothenburg, Sweden, Aug. 2012, pp. 175-179.
  14. H. Chen et al., "The modified reliability-based iterative majority-logic decoding algorithm with non-uniform quantization," in Proc. CHINACOM, Guilin, China, Aug. 2013.
  15. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. 27, pp. 533-547, Sept. 1981. https://doi.org/10.1109/TIT.1981.1056404