Construction of high-rate QC-LDPC codes

Xu Chen; Chung Ming Lau

doi:10.1109/ATC.2011.6027427

Construction of high-rate QC-LDPC codes

The Hong Kong Polytechnic University

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

6 Citations (Scopus)

Abstract

In this paper, we construct high-rate quasi-cyclic low-density parity-check (QC-LDPC) codes with girth-10 based on shortened array codes. First, we derive analytic results on the maximum number of columns for shortened array codes of different girths. A code construction method inspired by the analysis is proposed for column-weight-three codes and is compared with the conventional greedy construction algorithm. We show that the proposed method is more effective than the conventional greedy algorithm in the sense that the minimum length of the codes constructed using our proposed method to achieve different code rates is comparative or much shorter than those constructed using the greedy construction.

Original language	English
Title of host publication	Proceedings - 2011 International Conference on Advanced Technologies for Communications, ATC 2011
Pages	24-27
Number of pages	4
DOIs	https://doi.org/10.1109/ATC.2011.6027427
Publication status	Published - 12 Dec 2011
Event	4th Annual International Conference on Advanced Technologies for Communications, ATC2011 - Da Nang City, Viet Nam Duration: 2 Aug 2011 → 4 Aug 2011

Conference

Conference	4th Annual International Conference on Advanced Technologies for Communications, ATC2011
Country/Territory	Viet Nam
City	Da Nang City
Period	2/08/11 → 4/08/11

ASJC Scopus subject areas

Computer Networks and Communications
Hardware and Architecture
Software

More information

10.1109/ATC.2011.6027427

Cite this

@inproceedings{5ffd41db94fe485ebc705c660a8fa46f,

title = "Construction of high-rate QC-LDPC codes",

abstract = "In this paper, we construct high-rate quasi-cyclic low-density parity-check (QC-LDPC) codes with girth-10 based on shortened array codes. First, we derive analytic results on the maximum number of columns for shortened array codes of different girths. A code construction method inspired by the analysis is proposed for column-weight-three codes and is compared with the conventional greedy construction algorithm. We show that the proposed method is more effective than the conventional greedy algorithm in the sense that the minimum length of the codes constructed using our proposed method to achieve different code rates is comparative or much shorter than those constructed using the greedy construction.",

author = "Xu Chen and Lau, {Chung Ming}",

year = "2011",

month = dec,

day = "12",

doi = "10.1109/ATC.2011.6027427",

language = "English",

isbn = "9781457712043",

pages = "24--27",

booktitle = "Proceedings - 2011 International Conference on Advanced Technologies for Communications, ATC 2011",

note = "4th Annual International Conference on Advanced Technologies for Communications, ATC2011 ; Conference date: 02-08-2011 Through 04-08-2011",

}

TY - GEN

T1 - Construction of high-rate QC-LDPC codes

AU - Chen, Xu

AU - Lau, Chung Ming

PY - 2011/12/12

Y1 - 2011/12/12

N2 - In this paper, we construct high-rate quasi-cyclic low-density parity-check (QC-LDPC) codes with girth-10 based on shortened array codes. First, we derive analytic results on the maximum number of columns for shortened array codes of different girths. A code construction method inspired by the analysis is proposed for column-weight-three codes and is compared with the conventional greedy construction algorithm. We show that the proposed method is more effective than the conventional greedy algorithm in the sense that the minimum length of the codes constructed using our proposed method to achieve different code rates is comparative or much shorter than those constructed using the greedy construction.

AB - In this paper, we construct high-rate quasi-cyclic low-density parity-check (QC-LDPC) codes with girth-10 based on shortened array codes. First, we derive analytic results on the maximum number of columns for shortened array codes of different girths. A code construction method inspired by the analysis is proposed for column-weight-three codes and is compared with the conventional greedy construction algorithm. We show that the proposed method is more effective than the conventional greedy algorithm in the sense that the minimum length of the codes constructed using our proposed method to achieve different code rates is comparative or much shorter than those constructed using the greedy construction.

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

U2 - 10.1109/ATC.2011.6027427

DO - 10.1109/ATC.2011.6027427

M3 - Conference article published in proceeding or book

SN - 9781457712043

SP - 24

EP - 27

BT - Proceedings - 2011 International Conference on Advanced Technologies for Communications, ATC 2011

T2 - 4th Annual International Conference on Advanced Technologies for Communications, ATC2011

Y2 - 2 August 2011 through 4 August 2011

ER -

Construction of high-rate QC-LDPC codes

Abstract

Conference

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this