Construction of one-coincidence sequence quasi-cyclic LDPC codes of large girth

Jen Fa Huang, Chun Ming Huang, Chao Chin Yang

Research output: Contribution to journalArticlepeer-review

18 Citations (Scopus)

Abstract

One approach for designing the one-coincidence sequence (OCS) low-density parity-check (LDPC) codes of large girth is investigated. These OCS-LDPC codes are quasi-cyclic, and their parity-check matrices are composed of circulant permutation matrices. Generally, the cycle structures in these codes are determined by the shift values of circulant permutation matrices, and the existence of cycles in the corresponding Tanner graph is governed by certain cycle-governing equations (CGEs). Therefore, finding the proper shift values is the key point to increase the girth of these codes. In this paper, we provide an effective method to systematically find out the CGEs for these codes of girth 6, 8, and 10, respectively. Then, one less computation-intensive algorithm is used to generate the proper shift values for constructing the OCS-LDPC codes of large girth. Simulation results show that significant gains in signal-to-noise ratio over an additive white-Gaussian noise channel can be achieved by increasing the girth of the OCS-LDPC codes.

Original languageEnglish
Article number6157090
Pages (from-to)1825-1836
Number of pages12
JournalIEEE Transactions on Information Theory
Volume58
Issue number3
DOIs
Publication statusPublished - 2012 Mar

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint

Dive into the research topics of 'Construction of one-coincidence sequence quasi-cyclic LDPC codes of large girth'. Together they form a unique fingerprint.

Cite this