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

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

doi:10.1587/elex.7.1429

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

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

Department of Electrical and Electronic Engineering

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

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 language	English
Pages (from-to)	1429-1434
Number of pages	6
Journal	ieice electronics express
Volume	7
Issue number	19
DOIs	https://doi.org/10.1587/elex.7.1429
Publication status	Published - 2010 Oct 10

All Science Journal Classification (ASJC) codes

Electronic, Optical and Magnetic Materials
Condensed Matter Physics
Electrical and Electronic Engineering

Access to Document

10.1587/elex.7.1429

Cite this

@article{5ab66ce03a1c482397dd1ba5ed9e43eb,

title = "A group shuffled BP decoding for punctured low-density parity-check codes",

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.",

author = "Sangjoon Park and Sunyoung Lee and Hwang, {Seung Hoon} and Sooyong Choi",

year = "2010",

month = oct,

day = "10",

doi = "10.1587/elex.7.1429",

language = "English",

volume = "7",

pages = "1429--1434",

journal = "IEICE Electronics Express",

issn = "1349-2543",

publisher = "The Institute of Electronics, Information and Communication Engineers (IEICE)",

number = "19",

}

TY - JOUR

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

AU - Park, Sangjoon

AU - Lee, Sunyoung

AU - Hwang, Seung Hoon

AU - Choi, Sooyong

PY - 2010/10/10

Y1 - 2010/10/10

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77958194595&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77958194595&partnerID=8YFLogxK

U2 - 10.1587/elex.7.1429

DO - 10.1587/elex.7.1429

M3 - Article

AN - SCOPUS:77958194595

SN - 1349-2543

VL - 7

SP - 1429

EP - 1434

JO - IEICE Electronics Express

JF - IEICE Electronics Express

IS - 19

ER -

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

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this