A group shuffled BP decoding for punctured low-density parity-check codes

Sangjoon Park, Sunyoung Lee, Seung Hoon Hwang, Sooyong Choi

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)1429-1434
Number of pages6
JournalIEICE Electronics Express
Volume7
Issue number19
DOIs
StatePublished - 10 Oct 2010

Keywords

  • Effective update
  • Gsbp decoding
  • Ldpc codes
  • Puncturing

Fingerprint

Dive into the research topics of 'A group shuffled BP decoding for punctured low-density parity-check codes'. Together they form a unique fingerprint.

Cite this