Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/79369
Title: An approach to evaluating the number of potential cycles in an all-one base matrix
Authors: Jiang, S 
Lau, FCM 
Keywords: Base matrix
LDPC codes
Potential cycles
Issue Date: 2018
Publisher: Institute of Electrical and Electronics Engineers Inc.
Source: International Conference on Advanced Communication Technology, ICACT, 2018, v. 2018-February, p. 104-108 How to cite?
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'.
Description: 20th IEEE International Conference on Advanced Communication Technology, ICACT 2018, Chuncheon, South Korea, 11-14 February 2018
URI: http://hdl.handle.net/10397/79369
ISBN: 9791188428007
DOI: 10.23919/ICACT.2018.8323662
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

17
Citations as of May 21, 2019

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.