ChinaCom2008-Information and Coding Theory Symposium

Research Article

Hybrid Decoding for One Class of Low-density Parity-check Codes

  • @INPROCEEDINGS{10.1109/CHINACOM.2008.4685036,
        author={Guangwen Li and Xuelan  Zou and xin wang},
        title={Hybrid Decoding for One Class of Low-density Parity-check Codes},
        proceedings={ChinaCom2008-Information and Coding Theory Symposium},
        publisher={IEEE},
        proceedings_a={CHINACOM2008-ICT},
        year={2008},
        month={11},
        keywords={low-density parity-check codes belief propagation ordered statistic decoding bit flipping},
        doi={10.1109/CHINACOM.2008.4685036}
    }
    
  • Guangwen Li
    Xuelan Zou
    xin wang
    Year: 2008
    Hybrid Decoding for One Class of Low-density Parity-check Codes
    CHINACOM2008-ICT
    IEEE
    DOI: 10.1109/CHINACOM.2008.4685036
Guangwen Li1,*, Xuelan Zou1,*, xin wang1,*
  • 1: School of Telecommunications and Information Engineering Nanjing University of Posts and Telecommunications Nanjing, Jiangsu of China
*Contact email: lgw.frank@gmail.com, xlzou@njupt.edu.cn, wangxinforever@yahoo.com.cn

Abstract

For high rate LDPC codes with light column weight and few redundant checks in their parity check matrix, the belief propagation (BP) decodings yield good error performance at the cost of high complexity. Aiming at seeking a effective decoder with good performance versus complexity tradeoff for this kind of LDPC codes, we present a new decoding framework which cascades a bit flipping (BF) variant with the ordered statistic decoding (OSD). During the iterative decoding of BF variant, the flipping value for each codeword bit is summed. The summation for each bit will be utilized as the reliability input for the OSD postprocessing, if no valid codeword is found after the maximum number of iterations for the BF variant is reached. With respect to the BP, simulation results show that the proposed BF-OSD achieves comparable performance with much less complexity.