An approach to evaluating the number of potential cycles in an all-one base matrix

Sheng Jiang, Chung Ming Lau

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

Abstract

The 'Tree Method' is usually used to identify potential cycles in low-density parity-check codes. However, with the increasing demand of high girth codes, the method becomes hard to implement because of the exponential increase of both space complexity and time complexity. In this paper, a new method is introduced to evaluate potential cycles for all-one base matrix. The method applies to large cycle length and arbitrary size base matrix. The principle of potential cycle and potential cycle duplication are studied to support the new approach. Instead of doing low efficient exhaustive search, the approach gives the number of potential cycles without duplication directly. The results of cycle numbers are given, which are verified by the 'Tree Method'.
Original languageEnglish
Title of host publicationIEEE 20th International Conference on Advanced Communication Technology
Subtitle of host publicationOpening New Era of Intelligent Things, ICACT 2018
PublisherIEEE
Pages104-108
Number of pages5
Volume2018-February
ISBN (Electronic)9791188428007
DOIs
Publication statusPublished - 23 Mar 2018
Event20th IEEE International Conference on Advanced Communication Technology, ICACT 2018 - Elysian Gangchon, Chuncheon, Korea, Republic of
Duration: 11 Feb 201814 Feb 2018

Publication series

NameInternational Conference on Advanced Communication Technology, ICACT
Volume2018-February
ISSN (Print)1738-9445

Conference

Conference20th IEEE International Conference on Advanced Communication Technology, ICACT 2018
CountryKorea, Republic of
CityChuncheon
Period11/02/1814/02/18

Keywords

  • base matrix
  • LDPC codes
  • potential cycles

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this