Adaptive reliability-based iteration min-sum decoding algorithm for majority-logic decodable LDPC codes

In this paper, an adaptive decoding algorithm for majority-logic decodable LDPC codes is present based on a recent work by Chen et al. Different from the RBI-MSD algorithm, the presented adaptive reliability-based iteration min-sum decoding algorithm does not need to predesignate the scaling factor, which is optimized by discretized density evolution. In the adaptive RBIMSD algorithm, an adaptive scaling factor is induced for each check node to modify the extrinsic message. The adaptive scaling factor is computed by the ratio of the second minimum and the maximum value among the message, which is received by the check nodes. Simulation results show that, the performance of the adaptive RBI-MSD algorithm is almost as well as that of the original RBI-MSD algorithm but with a little (or negligible) computation increase.