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 low-density 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 guaran...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on communications Vol. 67; no. 10; pp. 6643 - 6651
Main Authors Ferrari, Marco, Tomasoni, Alessandro, Marenzi, Ramon, Bellini, Sandro
Format Journal Article
LanguageEnglish
Published New York IEEE 01.10.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
absorbing set threshold
absorbing sets
Algorithms
Binary system
Bit error rate
Codes
Deactivation
Decoders
Decoding
Error correcting codes
error floor
Iterative decoding
Low-density parity-check codes
Message passing
scaled min-sum decoding
Scaling factors
Signal to noise ratio
State-space methods
tanner graph
Online AccessGet full text

Cover

More Information
Summary:In this paper, the definition of threshold of elementary absorbing sets is extended to scaled Min-Sum low-density 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.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2019.2926032