A Regional Message Scaling Min-Sum Decoding Algorithm for MET-LDPC Codes

To offer multi-edge type low-density parity-check (MET-LDPC) codes with better performance, this paper proposes a regional message scaling min-sum (RMS) decoding algorithm which improves the performance of the traditional min-sum (MS) decoding algorithm and its modified versions. The contributions of this study are as follows. First, based on the edge-type topology of MET-LDPC codes, we fully exploit their inherent structural information to develop a cross-region decoding architecture by dynamically partitioning the edges of the Tanner graph into three functional regions. Second, we introduce cross-region message scaling (CMS) factors to establish an asymmetric information flow control mechanism, which adaptively regulates the intensity of information exchange across regions. Third, by integrating the multi-edge structure, the cross-region decoding architecture, and the asymmetric information flow control mechanism into a unified framework, we propose the RMS decoding algorithm tailored for MET-LDPC codes. For various code lengths, simulation results demonstrate that the proposed algorithm achieves a significantly lower error floor compared to the traditional MS decoding algorithm and its modified versions over the additive white Gaussian noise (AWGN) channel.