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 journalArticle

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
Publication statusPublished - 2010 Oct 10

Fingerprint

decoding
Decoding
parity
propagation
messages
schedules
iteration
recovery
Recovery

All Science Journal Classification (ASJC) codes

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

Cite this

Park, Sangjoon ; Lee, Sunyoung ; Hwang, Seung Hoon ; Choi, Sooyong. / A group shuffled BP decoding for punctured low-density parity-check codes. In: IEICE Electronics Express. 2010 ; Vol. 7, No. 19. pp. 1429-1434.
@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 = "10",
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",

}

A group shuffled BP decoding for punctured low-density parity-check codes. / Park, Sangjoon; Lee, Sunyoung; Hwang, Seung Hoon; Choi, Sooyong.

In: IEICE Electronics Express, Vol. 7, No. 19, 10.10.2010, p. 1429-1434.

Research output: Contribution to journalArticle

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

VL - 7

SP - 1429

EP - 1434

JO - IEICE Electronics Express

JF - IEICE Electronics Express

SN - 1349-2543

IS - 19

ER -