A novel algorithm for removing cycles in quasi-cyclic LDPC codes

Keke Liu*, Zesong Fei, Jingming Kuang, Xiangming Li

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Citations (Scopus)

Abstract

In this paper, an algorithm for removing cycles in quasi-cyclic(QC) LDPC codes is presented. This algorithm can ensure that the code after cycle removal process preserves the quasi-cyclic structure and significantly improves the flexibility in parameter selection (such as the length of the code) of algebraic constructions of QC-LDPC codes. Besides, it has far lower computational complexity than the existing cycle removal algorithm. Experimental results show that this algorithm is very effective in improving the performance of the QC-LDPC codes and can construct code which has better performance than the corresponding binary LDPC code based on IEEE 802.16e standard.

Original languageEnglish
Title of host publication2009 IEEE 20th Personal, Indoor and Mobile Radio Communications Symposium, PIMRC 2009
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1054-1058
Number of pages5
ISBN (Print)9781424451234
DOIs
Publication statusPublished - 2009
Event2009 IEEE 20th Personal, Indoor and Mobile Radio Communications Symposium, PIMRC 2009 - Tokyo, Japan
Duration: 13 Sept 200916 Sept 2009

Publication series

NameIEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC

Conference

Conference2009 IEEE 20th Personal, Indoor and Mobile Radio Communications Symposium, PIMRC 2009
Country/TerritoryJapan
CityTokyo
Period13/09/0916/09/09

Keywords

  • Combination
  • Cycles
  • Large girth
  • Quasi-cyclic LDPC codes

Fingerprint

Dive into the research topics of 'A novel algorithm for removing cycles in quasi-cyclic LDPC codes'. Together they form a unique fingerprint.

Cite this