arrow
Return

Neural Min-Sum Decoding for Generalized LDPC Codes

delete2022-12-01
delete2
PRE
AI
H
Hee-Youl Kwak
J
Jae-Won Kim *
Y
Yongjune Kim
S
Sang‐Hyo Kim
J
Jong‐Seon No
DOI:10.1109/LCOMM.2022.3208834delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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.
Keywords:
Generalized low-density parity-check (GLDPC) code
min-sum (MS) decoding
neural min-sum (NMS) decoding

Journal

IEEE Communications Letters cover
IEEE Communications Letters
IF:
4.4
Papers:
1.3W
Citations:
2.2W

Organization

S
sungkyunkwan university (skku)
Scholars:
3.7W
Papers: 3.6W
Citations: 49
U
University of Ulsan
Scholars:
1.8W
Papers: 1.7W
Citations: 1.4W
G
Gyeongsang National University
Scholars:
10.0K
Papers: 8.8K
Citations: 13
S
seoul national university (snu)
Scholars:
7.2W
Papers: 6.6W
Citations: 86
researcher View more organizations