返回
Analysis of Binary and Ternary Message Passing Decoding for Generalized LDPC Codes
DOI:10.1109/TCOMM.2023.3292474.png)
摘要
En 中文
The performance of generalized low-density parity-check (GLDPC) codes under binary and ternary message passing decoding (BMP/TMP) is analyzed from a density evolution (DE) perspective. At the check nodes, two types of local decoders are considered, namely optimum a-posteriori probability (APP) soft-input soft-output decoding, and bounded distance decoding (BDD). The purpose is to shed light on the performance loss incurred by BMP and TMP decoding of GLDPC codes with respect to unquantized belief propagation (BP) decoding. A DE analysis for irregular code ensembles is developed for all the algorithms, which allows obtaining the scaling coefficients needed for the variable node operation of BMP and TMP decoders. The stability analysis for the case of bounded distance decoding at the check nodes is derived. The asymptotic DE analysis is confirmed by the finite-length simulation results. For the codes analyzed in this paper, which rely on extended Hamming component codes, the study shows that under BMP decoding, BDD at the check nodes yields almost the same performance as optimum APP check node processing, while under TMP decoding the loss incurred by the sub-optimum BDD at check nodes is within 0.7 dB, when compared with APP decoding at the check nodes.
Keyword:
Binary and ternary message passing
GLDPC codes
density evolution
bounded distance decoding
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
Three-dimensional nanofabrication via ultrafast laser patterning and kinetically regulated material assembly通过超快激光图案化和动力学调节的材料组装进行三维纳米加工
Science
IF0
One and Two Bit Message Passing for SC-LDPC Codes With Higher-Order Modulation高阶调制的sc-ldpc码的一位和两位消息传递
Generalized LDPC Codes for Ultra Reliable Low Latency Communication in 5G and Beyond
IEEE ACCESS
IF3.6

