.png){kind=icon}
Return
Neural Min-Sum Decoding for Generalized LDPC Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2022.3208834.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
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
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
View more organizations
Cited Papers
ShareSaveShareSaveGeneralized LDPC Codes for Ultra Reliable Low Latency Communication in 5G and Beyond.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAIShareSaveShareSave
ShareSave View more