Mobility

Exhaustive Search for Small Fully Absorbing Sets and the Corresponding Low Error-Floor Decoder

Free registration required

Executive Summary

This paper provides an exhaustive search algorithm for Finding small Fully Absorbing Sets (FASs) of arbitrary Low-Density Parity-Check (LDPC) codes. In particular, given any LDPC code, the problem of finding all FASs of size less than t is formulated as an integer programming problem, for which a new branch-&-bound algorithm is devised. New node selection and the tree-trimming mechanisms are designed to further enhance the efficiency of the algorithm. The resulting exhaustive list of small FASs is then used to devise a new post-processing decoder. Numerical results show that by taking advantage of the exhaustive list of small FASs, the proposed decoder significantly lowers the error floor for codes of practical lengths and outperforms the state-of-the-art low-error-floor decoders.

  • Format: PDF
  • Size: 235.09 KB