Neural Min-Sum Decoding for Generalized LDPC Codes

In this letter, we investigate the min-sum (MS) and neural MS (NMS) decoding algorithms for generalized low-density parity-check (GLDPC) codes. Although the MS decoder is much simpler than the a posteriori probability (APP) decoder commonly used for GLDPC codes, the MS decoder has not been considered mainly due to its inferior decoding performance. However, we show that the performance can be improved by i) employing the NMS decoding algorithm and ii) optimizing the component parity check matrix (PCM). For the four representative short GLDPC codes in the literature, experimental results show that the NMS decoding performance with the optimized component PCM significantly outperforms the MS decoding performance and even outperforms the APP decoding performance for some cases.