Thresholds of Absorbing Sets Under Scaled Min-Sum LDPC Decoding

In this paper, the definition of threshold of elementary absorbing sets is extended to scaled Min-Sum lowdensity parity-check (LDPC) decoding. Based on the analysis of the behavior of scaled Min-Sum LDPC decoders in the Tanner graph of the absorbing set, it is proven that correct decoding is guaranteed with received channel messages above threshold. A fast algorithm for the threshold computation is derived. Many examples of absorbing sets taken from LDPC codes of various variable node degrees are investigated, and it is shown that all of them can be deactivated with low enough scaling factors.