.png){kind=icon}
返回
Improving the Thresholds of Generalized LDPC Codes With Convolutional Code Constraints
.png){kind=icon}
OA
AI
DOI：10.1109/LCOMM.2023.3274088.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
CC-GLPDC codes are a class of generalized low-density parity-check (GLDPC) codes where the constraint nodes (CNs) represent convolutional codes. This allows for efficient decoding in the trellis with the forward-backward algorithm, and the strength of the component codes easily can be controlled by the encoder memory without changing the graph structure. In this letter, we extend the class of CC-GLDPC codes by introducing different types of irregularity at the CNs and investigating their effect on the BP and MAP decoding thresholds for the binary erasure channel (BEC). For the considered class of codes, an exhaustive grid search is performed to find the BP-optimized and MAP-optimized ensembles and compare their thresholds with the regular ensemble of the same design rate. The results show that irregularity can significantly improve the BP thresholds, whereas the thresholds of the MAP-optimized ensembles are only slightly different from the regular ensembles. Simulation results for the AWGN channel are presented as well and compared to the corresponding thresholds.
Keyword:
LDPC codes
GLDPC codes
convolutional codes
codes on graphs
iterative decoding thresholds
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
The effect of design education on creative design cognition of high school students设计教育对高中生创意设计认知的影响
PREAI
分享收藏分享收藏Generalized LDPC Codes for Ultra Reliable Low Latency Communication in 5G and Beyond.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAI分享收藏Finite-Length Scaling of Turbo-Like Code Ensembles on the Binary Erasure Channel二进制擦除信道上类Turbo码集合的有限长度缩放
PREAI
分享收藏Geochronology of Magmatism and Mineralization in the Dongbulage Mo-Polymetallic Deposit, Northeast China: Implications for the Timing of Mineralization and Ore GenesisMineralsOAAI
MineralsIF0
OAAI分享收藏
查看更多内容