A good puncturing scheme for rate compatible low-density parity-check codes

Sunghoon Choi, Sungroh Yoon, Wonjin Sung, Hongkyu Kwon, Jun Heo

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

We consider the challenges of finding good puncturing patterns for rate-compatible low-density parity-check code (LDPC) codes over additive white Gaussian noise (AWGN) channels. Puncturing is a scheme to obtain a series of higher rate codes from a lower rate mother code. It is widely used in channel coding but it causes performance is lost compared to non-punctured LDPC codes at the same rate. Previous work, considered the role of survived check nodes in puncturing patterns. Limitations, such as single survived check node assumption and simulation-based verification, were examined. This paper analyzes the performance according to the role of multiple survived check nodes and multiple dead check nodes. Based on these analyses, we propose new algorithm to find a good puncturing pattern for LDPC codes over AWGN channels.

Original languageEnglish
Pages (from-to)455-463
Number of pages9
JournalJournal of Communications and Networks
Volume11
Issue number5
Publication statusPublished - 2009 Oct 1

Fingerprint

Piercing
Channel coding

Keywords

  • Block-type LDPC codes (B-LDPC)
  • Density evolution (DE)
  • Low-density parity-check code (LDPC) codes
  • Puncturing

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

A good puncturing scheme for rate compatible low-density parity-check codes. / Choi, Sunghoon; Yoon, Sungroh; Sung, Wonjin; Kwon, Hongkyu; Heo, Jun.

In: Journal of Communications and Networks, Vol. 11, No. 5, 01.10.2009, p. 455-463.

Research output: Contribution to journalArticle

Choi, Sunghoon ; Yoon, Sungroh ; Sung, Wonjin ; Kwon, Hongkyu ; Heo, Jun. / A good puncturing scheme for rate compatible low-density parity-check codes. In: Journal of Communications and Networks. 2009 ; Vol. 11, No. 5. pp. 455-463.
@article{51a88c113c424bbca415f775503c366d,
title = "A good puncturing scheme for rate compatible low-density parity-check codes",
abstract = "We consider the challenges of finding good puncturing patterns for rate-compatible low-density parity-check code (LDPC) codes over additive white Gaussian noise (AWGN) channels. Puncturing is a scheme to obtain a series of higher rate codes from a lower rate mother code. It is widely used in channel coding but it causes performance is lost compared to non-punctured LDPC codes at the same rate. Previous work, considered the role of survived check nodes in puncturing patterns. Limitations, such as single survived check node assumption and simulation-based verification, were examined. This paper analyzes the performance according to the role of multiple survived check nodes and multiple dead check nodes. Based on these analyses, we propose new algorithm to find a good puncturing pattern for LDPC codes over AWGN channels.",
keywords = "Block-type LDPC codes (B-LDPC), Density evolution (DE), Low-density parity-check code (LDPC) codes, Puncturing",
author = "Sunghoon Choi and Sungroh Yoon and Wonjin Sung and Hongkyu Kwon and Jun Heo",
year = "2009",
month = "10",
day = "1",
language = "English",
volume = "11",
pages = "455--463",
journal = "Journal of Communications and Networks",
issn = "1229-2370",
publisher = "Korean Institute of Communication Sciences",
number = "5",

}

TY - JOUR

T1 - A good puncturing scheme for rate compatible low-density parity-check codes

AU - Choi, Sunghoon

AU - Yoon, Sungroh

AU - Sung, Wonjin

AU - Kwon, Hongkyu

AU - Heo, Jun

PY - 2009/10/1

Y1 - 2009/10/1

N2 - We consider the challenges of finding good puncturing patterns for rate-compatible low-density parity-check code (LDPC) codes over additive white Gaussian noise (AWGN) channels. Puncturing is a scheme to obtain a series of higher rate codes from a lower rate mother code. It is widely used in channel coding but it causes performance is lost compared to non-punctured LDPC codes at the same rate. Previous work, considered the role of survived check nodes in puncturing patterns. Limitations, such as single survived check node assumption and simulation-based verification, were examined. This paper analyzes the performance according to the role of multiple survived check nodes and multiple dead check nodes. Based on these analyses, we propose new algorithm to find a good puncturing pattern for LDPC codes over AWGN channels.

AB - We consider the challenges of finding good puncturing patterns for rate-compatible low-density parity-check code (LDPC) codes over additive white Gaussian noise (AWGN) channels. Puncturing is a scheme to obtain a series of higher rate codes from a lower rate mother code. It is widely used in channel coding but it causes performance is lost compared to non-punctured LDPC codes at the same rate. Previous work, considered the role of survived check nodes in puncturing patterns. Limitations, such as single survived check node assumption and simulation-based verification, were examined. This paper analyzes the performance according to the role of multiple survived check nodes and multiple dead check nodes. Based on these analyses, we propose new algorithm to find a good puncturing pattern for LDPC codes over AWGN channels.

KW - Block-type LDPC codes (B-LDPC)

KW - Density evolution (DE)

KW - Low-density parity-check code (LDPC) codes

KW - Puncturing

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

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

M3 - Article

AN - SCOPUS:70449341506

VL - 11

SP - 455

EP - 463

JO - Journal of Communications and Networks

JF - Journal of Communications and Networks

SN - 1229-2370

IS - 5

ER -