On the combinatorial substructures of LDPC codes causing error floors in the AWGN channel

Finite-length low-density parity-check (LDPC) codes usually suffer from error floors in high signal-to-noise ratio (SNR) region. The error floor in the additive white Gaussian noise (AWGN) channel is known to be caused by trapping sets or absorbing sets. In this paper, we investigate combinatorial p...

Full description

Saved in:
Bibliographic Details
Published in2012 International Conference on ICT Convergence (ICTC) pp. 420 - 425
Main Authors Hosung Park, Jong-Seon No, Beomkyu Shin, Habong Chung
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2012
Subjects
Charge carrier processes
Image color analysis
Image edge detection
Iterative decoding
Linear systems
Vectors
Online AccessGet full text

Cover

More Information
Summary:Finite-length low-density parity-check (LDPC) codes usually suffer from error floors in high signal-to-noise ratio (SNR) region. The error floor in the additive white Gaussian noise (AWGN) channel is known to be caused by trapping sets or absorbing sets. In this paper, we investigate combinatorial properties of trapping sets by using graph-theoretic approach. All non-isomorphic trapping sets are identified by a graph-theoretic tool and a method to distinguish the trapping sets which cannot appear in any protograph-based LDPC codes are proposed. Finally, a measure for estimating the harmfulness of trapping sets is proposed by using the linear system model of trapping sets.
ISBN:1467348295
9781467348294
ISSN:2162-1233
DOI:10.1109/ICTC.2012.6387166