Edge Coloring Technique to Remove Small Elementary Trapping Sets from Tanner Graph of QC-LDPC Codes with Column Weight 4

08/15/2018
by   Mohammad-Reza Sadeghi, et al.
0

One of the phenomena that causes high decoding failure rates is trapping sets. Characterization of (a,b) elementary trapping sets (ETSs), their graphical properties and the lower bounds on their size in variable regular LDPC codes with column weights 3, 4, 5 and 6, where a is the size of the ETS and b is the number of degree-one check nodes, have been an interesting subject among researchers. Although progressive-edge-growth method (PEG) to construct LDPC codes free of an specific ETS has been proposed in the literature, it is mostly applied to LDPC codes with column weight 3. In this paper, we focus on constructing QC-LDPC codes with column weight 4 whose Tanner graphs are free of small ETSs. Using coloring the edges of the variable node (VN) graph corresponding to an ETS, we provide the sufficient conditions to obtain QC-LDPC codes with column weight 4, girth 6 and free of (5,b) ETSs, where b≤4, and (6,b) ETs, where b≤2. Moreover, for (4,n)-regular QC-LDPC codes with girth 8, we present a method to remove (7,4) ETSs from Tanner graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/21/2018

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...
research
08/04/2020

Construction of protograph-based LDPC codes with chordless short cycles

Controlling small size trapping sets and short cycles can result in LDPC...
research
07/06/2023

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

Elementary trapping sets (ETSs) are the main culprits for the performanc...
research
01/06/2018

Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes with Applications to Stopping Sets

In this paper, we propose a characterization for non-elementary trapping...
research
01/18/2022

Three Weight Ternary Linear Codes from Non-Weakly Regular Bent Functions

In this paper, several classes of three-weight ternary linear codes from...
research
02/03/2020

Soft Random Graphs in Probabilistic Metric Spaces Inter-graph Distance

We present a new method for learning Soft Random Geometric Graphs (SRGGs...

Please sign up or login with your details

Forgot password? Click here to reset