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] 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 underMS decoding. Accordingly, scaling decreases the error floor.

I codici LDPC soffrono di error floor dovutoa dabsorbing set. In questo articolo si propone un algoritmo per il calcolo della threshold degli absorbing set applicabile anche a decodificatori scaled-Min-Sum.