A group shuffled belief propagation (GSBP) decoding for punctured low-density parity-check (LDPC) codes is proposed in the paper. The proposed GSBP decoding schedules the updating order of each bit node according to its recovery order in the standard BP decoding. This enables the proposed decoding to recover all punctured nodes in the first iteration with the minimum required number of groups. Calculation of the number of effective updates, which indicates the number of nonzero check-to-bit messages, shows that the proposed decoding can achieve faster decoding convergence than the layered BP (LBP) decoding for rate-compatible punctured LDPC (RCP-LDPC) codes. In the simulation results, the maximum SNR gain of the proposed decoding over the LBP decoding is about 0.9 dB at the FER of 10-4.
|Number of pages||6|
|Journal||ieice electronics express|
|Publication status||Published - 2010 Oct 10|
All Science Journal Classification (ASJC) codes
- Electronic, Optical and Magnetic Materials
- Condensed Matter Physics
- Electrical and Electronic Engineering