Efficient puncturing method for rate-compatible low-density parity-check codes

Yol Park Hyo, Won Kang Jae, Soon Kwang, Chan Whang Keum

Research output: Contribution to journalArticle

35 Citations (Scopus)

Abstract

In this paper, we propose an efficient puncturing method for LDPC codes. The proposed algorithm provides the order of variable nodes for puncturing based on the proposed cost function. The proposed cost function tries to maximize the minimum reliability among those provided from all check nodes. Also, it tries to allocate survived check nodes evenly to all punctured variable nodes. Furthermore, the proposed algorithm prevents the formation of a stopping set from the punctured variable nodes even when the amount of puncturing is quite large. Simulation results show that the proposed punctured LDPC codes perform better than existing punctured LDPC codes.

Original languageEnglish
Pages (from-to)3914-3919
Number of pages6
JournalIEEE Transactions on Wireless Communications
Volume6
Issue number11
DOIs
Publication statusPublished - 2007 Jan 1

Fingerprint

Piercing
Low-density Parity-check (LDPC) Codes
LDPC Codes
Cost functions
Vertex of a graph
Cost Function
Maximise
Simulation

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

Hyo, Yol Park ; Jae, Won Kang ; Kwang, Soon ; Keum, Chan Whang. / Efficient puncturing method for rate-compatible low-density parity-check codes. In: IEEE Transactions on Wireless Communications. 2007 ; Vol. 6, No. 11. pp. 3914-3919.
@article{429382d3096b43ff86cee25fe62401bf,
title = "Efficient puncturing method for rate-compatible low-density parity-check codes",
abstract = "In this paper, we propose an efficient puncturing method for LDPC codes. The proposed algorithm provides the order of variable nodes for puncturing based on the proposed cost function. The proposed cost function tries to maximize the minimum reliability among those provided from all check nodes. Also, it tries to allocate survived check nodes evenly to all punctured variable nodes. Furthermore, the proposed algorithm prevents the formation of a stopping set from the punctured variable nodes even when the amount of puncturing is quite large. Simulation results show that the proposed punctured LDPC codes perform better than existing punctured LDPC codes.",
author = "Hyo, {Yol Park} and Jae, {Won Kang} and Soon Kwang and Keum, {Chan Whang}",
year = "2007",
month = "1",
day = "1",
doi = "10.1109/TWC.2007.060386",
language = "English",
volume = "6",
pages = "3914--3919",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "11",

}

Efficient puncturing method for rate-compatible low-density parity-check codes. / Hyo, Yol Park; Jae, Won Kang; Kwang, Soon; Keum, Chan Whang.

In: IEEE Transactions on Wireless Communications, Vol. 6, No. 11, 01.01.2007, p. 3914-3919.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Efficient puncturing method for rate-compatible low-density parity-check codes

AU - Hyo, Yol Park

AU - Jae, Won Kang

AU - Kwang, Soon

AU - Keum, Chan Whang

PY - 2007/1/1

Y1 - 2007/1/1

N2 - In this paper, we propose an efficient puncturing method for LDPC codes. The proposed algorithm provides the order of variable nodes for puncturing based on the proposed cost function. The proposed cost function tries to maximize the minimum reliability among those provided from all check nodes. Also, it tries to allocate survived check nodes evenly to all punctured variable nodes. Furthermore, the proposed algorithm prevents the formation of a stopping set from the punctured variable nodes even when the amount of puncturing is quite large. Simulation results show that the proposed punctured LDPC codes perform better than existing punctured LDPC codes.

AB - In this paper, we propose an efficient puncturing method for LDPC codes. The proposed algorithm provides the order of variable nodes for puncturing based on the proposed cost function. The proposed cost function tries to maximize the minimum reliability among those provided from all check nodes. Also, it tries to allocate survived check nodes evenly to all punctured variable nodes. Furthermore, the proposed algorithm prevents the formation of a stopping set from the punctured variable nodes even when the amount of puncturing is quite large. Simulation results show that the proposed punctured LDPC codes perform better than existing punctured LDPC codes.

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

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

U2 - 10.1109/TWC.2007.060386

DO - 10.1109/TWC.2007.060386

M3 - Article

AN - SCOPUS:36248991916

VL - 6

SP - 3914

EP - 3919

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 11

ER -