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

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

doi:10.1109/TWC.2007.060386

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

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

Department of Electrical and Electronic Engineering

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

37 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 language	English
Pages (from-to)	3914-3919
Number of pages	6
Journal	IEEE Transactions on Wireless Communications
Volume	6
Issue number	11
DOIs	https://doi.org/10.1109/TWC.2007.060386
Publication status	Published - 2007 Nov

Bibliographical note

Funding Information:
V. ACKNOWLEDGEMENT This work was supported by the MIC (Ministry of Information and Communication), Korea, under the ITRC (Informa- tion Technology Research Center) support program supervised by the IITA (Institute of Information Technology Advancement) in part by (IITA-2007-(C1090-0701-0003)) and in part by (IITA-2006-(C1090-0603-0011)).

All Science Journal Classification (ASJC) codes

Computer Science Applications
Electrical and Electronic Engineering
Applied Mathematics

Access to Document

10.1109/TWC.2007.060386

Cite this

@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}",

note = "Funding Information: V. ACKNOWLEDGEMENT This work was supported by the MIC (Ministry of Information and Communication), Korea, under the ITRC (Informa- tion Technology Research Center) support program supervised by the IITA (Institute of Information Technology Advancement) in part by (IITA-2007-(C1090-0701-0003)) and in part by (IITA-2006-(C1090-0603-0011)).",

year = "2007",

month = nov,

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

}

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

N1 - Funding Information: V. ACKNOWLEDGEMENT This work was supported by the MIC (Ministry of Information and Communication), Korea, under the ITRC (Informa- tion Technology Research Center) support program supervised by the IITA (Institute of Information Technology Advancement) in part by (IITA-2007-(C1090-0701-0003)) and in part by (IITA-2006-(C1090-0603-0011)).

PY - 2007/11

Y1 - 2007/11

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

SN - 1536-1276

VL - 6

SP - 3914

EP - 3919

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

IS - 11

ER -

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

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this