Hybrid decoding for one class of low-density parity-check codes

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.