Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/32253
Title: Constructing short-length irregular LDPC codes with low error floor
Authors: Zheng, X
Lau, FCM 
Tse, CK 
Keywords: Cycle indicator
distinguishable cycles
error floor
irregular LDPC codes
PEG-ACSE algorithm
trapping set
Issue Date: 2010
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on communications, 2010, v. 58, no. 10, 5567183, p. 2823-2834 How to cite?
Journal: IEEE transactions on communications 
Abstract: Trapping sets (TSs) are known to cause error floors in regular and irregular low-density parity-check (LDPC) codes. By avoiding major error-contributing TSs during the code construction process, codes with low error floors can effectively be built. In [14], it has been shown that TSs labeled as [w;u] are considered as being equivalent under the automorphism of the graph and are therefore contributing equally to the error floor. However, TSs with the same label [w;u] are not identical in general, particularly for the case of irregular LDPC codes. In this paper, we introduce a parameter e that can identify the number of "distinguishable" cycles in the connected subgraph induced by an elementary trapping set. Further, we propose a code construction algorithm, namely the Progressive-Edge-Growth Approximate-minimum- Cycle-Set-Extrinsic-message-degree (PEG-ACSE) method, that aims to avoid small elementary trapping sets (ETSs), particularly detrimental ETSs. We also develop theorems evaluating the minimum possible ETSs formed by PEG construction algorithms in general. We compare the characteristics of the codes built using the proposed method and those built using PEG-only or PEG-Approximate-minimum- Cycle-Extrinsic-message-degree (PEG-ACE) methods. Results from simulations show that the codes constructed using the proposed PEG-ACSE method produce lower error rates, particularly at the high signal-to-noise (SNR) region, compared with codes constructed using other PEG-based algorithms.
URI: http://hdl.handle.net/10397/32253
ISSN: 0090-6778
EISSN: 1558-0857
DOI: 10.1109/TCOMM.2010.083110.080638
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

30
Last Week
0
Last month
0
Citations as of Nov 8, 2017

WEB OF SCIENCETM
Citations

24
Last Week
0
Last month
0
Citations as of Nov 16, 2017

Page view(s)

33
Last Week
2
Last month
Checked on Nov 19, 2017

Google ScholarTM

Check

Altmetric



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