Characterization and efficient exhaustive search algorithm for elementary trapping sets of irregular LDPC codes

In this paper, we propose a characterization of elementary trapping sets (ETSs) for irregular low-density parity-check (LDPC) codes. These sets are known to be the main culprits in the error floor region of such codes. The proposed characterization is based on a hierarchical graphical representation of ETSs, starting from simple cycles of the graph, or from single variable nodes, and involves three simple expansion techniques: depth-one tree (dot), path and lollipop, thus, the terminology dpl characterization. The proposed dpl characterization corresponds to an efficient search algorithm, that, for a given irregular LDPC code, can find all the instances of (a, b) ETSs with size a and with the number of unsatisfied check nodes b, within any range of interest a ≤ a
_max
and b ≤ b
_max
, exhaustively. Simulation results are presented to show the versatility of the search algorithm, and to demonstrate that, compared to the literature, significant improvement in search speed can be obtained.