Please use this identifier to cite or link to this item:
Title: A fast searching method for the construction of QC-LDPC codes with large girth
Authors: Lau, FCM 
Tam, WM
Keywords: Cyclic codes
Parity check codes
Search problems
Issue Date: 2012
Publisher: IEEE
Source: 2012 IEEE Symposium on Computers and Communications (ISCC), 1-4 July 2012, Cappadocia, p. 000125-000128 How to cite?
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.
ISBN: 978-1-4673-2712-1
978-1-4673-2711-4 (E-ISBN)
ISSN: 1530-1346
DOI: 10.1109/ISCC.2012.6249279
Appears in Collections:Conference Paper

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


Last Week
Last month
Citations as of Feb 13, 2019

Page view(s)

Last Week
Last month
Citations as of Feb 17, 2019

Google ScholarTM



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