Journal of Communications and Networks

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

DOI QR Code

Reliability-Based Iterative Proportionality-logic Decoding of LDPC Codes with Adaptive Decision

  • Sun, Youming (School of Electronic and Information Engineering, South China University of Technology, School of Physics Sciences and Technology, Guangxi University) ;
  • Chen, Haiqiang (School of Computer, Electronics and Information, Guangxi University) ;
  • Li, Xiangcheng (School of Computer, Electronics and Information, Guangxi University) ;
  • Luo, Lingshan (School of Computer, Electronics and Information, Guangxi University) ;
  • Qin, Tuanfa (School of Computer, Electronics and Information, Guangxi University)
  • Received : 2014.02.24
  • Accepted : 2014.11.13
  • Published : 2015.06.30
⟨ Previous Next ⟩

Abstract

In this paper, we present a reliability-based iterative proportionality-logic decoding algorithm for two classes of structured low-density parity-check (LDPC) codes. The main contributions of this paper include: 1) Syndrome messages instead of extrinsic messages are processed and exchanged between variable nodes and check nodes, which can reduce the decoding complexity; 2) a more flexible decision mechanism is developed in which the decision threshold can be self-adjusted during the iterative process. Such decision mechanism is particularly effective for decoding the majority-logic decodable codes; 3) only part of the variable nodes satisfying the pre-designed criterion are involved for the presented algorithm, which is in the proportionality-logic sense and can further reduce the computational complexity. Simulation results show that, when combined with factor correction techniques and appropriate proportionality parameter, the presented algorithm performs well and can achieve fast decoding convergence rate while maintaining relative low decoding complexity, especially for small quantized levels (3-4 bits). The presented algorithm provides a candidate for those application scenarios where the memory load and the energy consumption are extremely constrained.

Keywords

References

  1. 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
  2. Z. Liu and D. A. Pados, "A decoding algorithm for finite-geometry LDPC codes," IEEE Trans. Commun., vol. 53, no. 3, pp.415-421, Mar. 2005. https://doi.org/10.1109/TCOMM.2005.843413
  3. 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
  4. M. Jiang et al., "An improvement on the modified weighted bit flipping decoding algorithm for LDPC codes," IEEE Commun. Lett., vol. 9, no. 9, pp. 814-816, Sept. 2005. https://doi.org/10.1109/LCOMM.2005.1506712
  5. N. Miladinovic and M. P. C. Fossorier, "Improved bit-flipping decoding of low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 51, no. 4, pp. 1594-1606, Apr. 2005. https://doi.org/10.1109/TIT.2005.844095
  6. 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, Dec. 2009. https://doi.org/10.1109/TCOMM.2009.12.080493
  7. C-Y. Chen et al., "A binary message-passing decoding algorithm for LDPC Codes," in Proc. 47th Annu. Allerton Conf., Monticello, IL, Sept. 2009, pp. 424-430.
  8. T. M. N. Ngatched, A. S. Alfa, and J. Cai, "An Improvement on the Soft Reliability-Based Iterative Majority-Logic Decoding Algorithm for LDPC Codes," in Proc. IEEE GLOBECOM, Miami, FL, Dec. 2010, pp. 1-5.
  9. H. Chen et al., "Comparisons between reliability-based iterative minsum 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
  10. K. Zhang, H. Chen, and X. Ma, "Adaptive decoding algorithms for LDPC codes with redundant check nodes," in Proc. ISTC, Gothenburg, Aug. 2012, pp. 175-179.
  11. D. Zhao et al., "A low complexity decoding algorithm for majority-logic decodable nonbinary LDPC codes," IEEE Commun. Lett., vol. 14, no. 11, pp. 1062-1064, Nov. 2010. https://doi.org/10.1109/LCOMM.2010.100810.101403
  12. X. Ma et al., "Low complexity X-EMS algorithms for nonbinary LDPC codes," IEEE Trans. Commun., vol. 60, no. 1, pp. 9-13, Jan. 2012. https://doi.org/10.1109/TCOMM.2011.092011.110082
  13. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. 27, no. 5, pp. 533-547, Sept. 1981. https://doi.org/10.1109/TIT.1981.1056404
  14. H. Tang et al., "Codes on finite geometries," IEEE Trans. Inf. Theory, vol. 51, no. 2, pp. 572-596, Feb. 2005. https://doi.org/10.1109/TIT.2004.840867
  15. 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
  16. S. -Y. Chung et al., "On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit," IEEE Commun. Lett., vol. 5, no. 2, pp. 58-60, Feb. 2001. https://doi.org/10.1109/4234.905935