Analysis of practical LDPC decoders in tanner graphs with absorbing sets | IEEE Conference Publication | IEEE Xplore

Analysis of practical LDPC decoders in tanner graphs with absorbing sets


Abstract:

Absorbing sets (ASs) cause the error floor phenomenon in many Low-Density Parity-Check (LDPC) codes. A recent, simplified system model for Min-Sum (MS) LDPC decoding [1] ...Show More

Abstract:

Absorbing sets (ASs) cause the error floor phenomenon in many Low-Density Parity-Check (LDPC) codes. A recent, simplified system model for Min-Sum (MS) LDPC decoding [1] predicts that ASs exhibit a threshold behavior: if all variable nodes in an AS have channel messages above the threshold, the AS cannot trap the decoder. The threshold is a real-valued parameter that depends on the topology of the AS, and can be evaluated by a nonlinear optimization. In this paper we describe a simple, fast algorithm for evaluating the AS threshold. Additionally, we show that the algorithm is valid also for scaled-MS decoding. We show with an example that the threshold values under scaled-MS decoding are smaller than under MS decoding. Accordingly, scaling decreases the error floor.
Date of Conference: 06-10 November 2017
Date Added to IEEE Xplore: 01 February 2018
ISBN Information:
Conference Location: Kaohsiung, Taiwan

References

References is not available for this document.