A fast searching method for the construction of QC-LDPC codes with large girth

Chung Ming Lau, Wai Man Tam

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

9 Citations (Scopus)

Abstract

In this paper, we propose an effective and efficient searching method for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes with a desired girth g. We begin with an arbitrary QC-LDPC code with girth-4 and we evaluate only the number of cycles with length 4. When all the cycles with length 4 are removed by adjusting the elements of the QC-LDPC code, we form a QC-LDPC code with girth-6. Subsequently, we consider only the numbers of cycles with length 4 and length 6. In general, knowing that the current QC-LDPC code has a girth of g', we only consider the numbers of cycles with length up to g' even though g' may be smaller than the desired girth g. By using an adaptive cost function, which is defined as the number of cycles of length g', in the optimization/searching process, we are able to reduce the computational effort tremendously compared with Wang's searching algorithm [1]. Consequently, our proposed method can generate QC-LDPC codes with the desired girth much more efficiently.
Original languageEnglish
Title of host publication2012 IEEE Symposium on Computers and Communications, ISCC 2012
Pages000125-000128
DOIs
Publication statusPublished - 28 Sep 2012
Event17th IEEE Symposium on Computers and Communication, ISCC 2012 - Cappadocia, Turkey
Duration: 1 Jul 20124 Jul 2012

Conference

Conference17th IEEE Symposium on Computers and Communication, ISCC 2012
CountryTurkey
CityCappadocia
Period1/07/124/07/12

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Software
  • Mathematics(all)
  • Signal Processing

Cite this