Theoretical Bounds for the Size of Elementary Trapping Sets by Graphic Methods

by   Haoran Xiong, et al.
Shandong University
HUAWEI Technologies Co., Ltd.

Elementary trapping sets (ETSs) are the main culprits for the performance of LDPC codes in the error floor region. Due to the large quantity, complex structures, and computational difficulties of ETSs, how to eliminate dominant ETSs in designing LDPC codes becomes a pivotal issue to improve the error floor behavior. In practice, researchers commonly address this problem by avoiding some special graph structures to free specific ETSs in Tanner graph. In this paper, we deduce the accurate Turán number of θ(1,2,2) and prove that all (a,b)-ETSs in Tanner graph with variable-regular degree d_L(v)=γ must satisfy the bound b≥ aγ-1/2a^2, which improves the lower bound obtained by Amirzade when the girth is 6. For the case of girth 8, by limiting the relation between any two 8-cycles in the Tanner graph, we prove a similar inequality b≥ aγ-a(√(8a-7)-1)/2. The simulation results show that the designed codes have good performance with lower error floor over additive white Gaussian noise channels.


page 1

page 2

page 3

page 4


Efficient Search of QC-LDPC Codes with Girths 6 and 8 and Free of Elementary Trapping Sets with Small Size

One of the phenomena that influences significantly the performance of lo...

Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes

Leafless elementary trapping sets (LETSs) are known to be the problemati...

Constructions and bounds for codes with restricted overlaps

Non-overlapping codes have been studied for almost 60 years. In such a c...

Error Probability Bounds for Gaussian Channels under Maximal and Average Power Constraints

This paper studies the performance of block coding on an additive white ...

Access Balancing in Storage Systems by Labeling Partial Steiner Systems

Storage architectures ranging from minimum bandwidth regenerating encode...

Resolvability on Continuous Alphabets

We characterize the resolvability region for a large class of point-to-p...

Please sign up or login with your details

Forgot password? Click here to reset