Construction of quasi-cyclic LDPC codes from quadratic congruences

Chun Ming Huang; Jen Fa Huang; Chao Chin Yang

doi:10.1109/LCOMM.2008.080065

Construction of quasi-cyclic LDPC codes from quadratic congruences

Chun Ming Huang, Jen Fa Huang, Chao Chin Yang

Department of Electrical Engineering

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

49 Citations (Scopus)

Abstract

In this paper, we proposed a novel method for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes based on circulant permutation matrices via a simple quadratic congruential equation. The main advantage is that QC-LDPC codes with a variety of block lengths and rates can be easily constructed with no cycles of length four or less. Simulation results show that the proposed QC-LDPC codes perform slight better than the random regular LDPC codes for short to moderate block lengths and have almost the same performance as Sridara-Fuja-Tanner codes.

Original language	English
Pages (from-to)	313-315
Number of pages	3
Journal	IEEE Communications Letters
Volume	12
Issue number	4
DOIs	https://doi.org/10.1109/LCOMM.2008.080065
Publication status	Published - 2008

All Science Journal Classification (ASJC) codes

Modelling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/LCOMM.2008.080065

Fingerprint Dive into the research topics of 'Construction of quasi-cyclic LDPC codes from quadratic congruences'. Together they form a unique fingerprint.

Cite this

@article{9e8ecb76da264d579def3a326b511dd2,

title = "Construction of quasi-cyclic LDPC codes from quadratic congruences",

abstract = "In this paper, we proposed a novel method for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes based on circulant permutation matrices via a simple quadratic congruential equation. The main advantage is that QC-LDPC codes with a variety of block lengths and rates can be easily constructed with no cycles of length four or less. Simulation results show that the proposed QC-LDPC codes perform slight better than the random regular LDPC codes for short to moderate block lengths and have almost the same performance as Sridara-Fuja-Tanner codes.",

author = "Huang, {Chun Ming} and Huang, {Jen Fa} and Yang, {Chao Chin}",

note = "Funding Information: Manuscript received January 14, 2008. The associate editor coordinating the review of this letter and approving it for publication was M. Fossorier. This work was supported in part by the Advanced Optoelectronic Technology Center, National Cheng Kung University, under project grants from the Ministry of Education and the National Science Council of Taiwan, R.O.C., and in part by the National Science Council, Taiwan, R.O.C., under Grant NSC 96-2219-E-006-010.",

year = "2008",

doi = "10.1109/LCOMM.2008.080065",

language = "English",

volume = "12",

pages = "313--315",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "4",

}

TY - JOUR

T1 - Construction of quasi-cyclic LDPC codes from quadratic congruences

AU - Huang, Chun Ming

AU - Huang, Jen Fa

AU - Yang, Chao Chin

N1 - Funding Information: Manuscript received January 14, 2008. The associate editor coordinating the review of this letter and approving it for publication was M. Fossorier. This work was supported in part by the Advanced Optoelectronic Technology Center, National Cheng Kung University, under project grants from the Ministry of Education and the National Science Council of Taiwan, R.O.C., and in part by the National Science Council, Taiwan, R.O.C., under Grant NSC 96-2219-E-006-010.

PY - 2008

Y1 - 2008

N2 - In this paper, we proposed a novel method for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes based on circulant permutation matrices via a simple quadratic congruential equation. The main advantage is that QC-LDPC codes with a variety of block lengths and rates can be easily constructed with no cycles of length four or less. Simulation results show that the proposed QC-LDPC codes perform slight better than the random regular LDPC codes for short to moderate block lengths and have almost the same performance as Sridara-Fuja-Tanner codes.

AB - In this paper, we proposed a novel method for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes based on circulant permutation matrices via a simple quadratic congruential equation. The main advantage is that QC-LDPC codes with a variety of block lengths and rates can be easily constructed with no cycles of length four or less. Simulation results show that the proposed QC-LDPC codes perform slight better than the random regular LDPC codes for short to moderate block lengths and have almost the same performance as Sridara-Fuja-Tanner codes.

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

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

U2 - 10.1109/LCOMM.2008.080065

DO - 10.1109/LCOMM.2008.080065

M3 - Article

AN - SCOPUS:58149527910

VL - 12

SP - 313

EP - 315

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 4

ER -

Construction of quasi-cyclic LDPC codes from quadratic congruences

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this