.png){kind=icon}
返回
Variable LLR Scaling in Min-Sum Decoding for Irregular LDPC Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/TBC.2014.2364532.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Min-sum decoding is a low-complexity alternative to the so-called belief propagation and consists in simplification of the nonlinear operation on the log likelihood ratios (LLRs) in the check nodes. The resulting suboptimality may be tempered via appropriate scaling of the LLRs, e.g., the fixed optimal scaling in the normalized min-sum algorithm, and variable scaling algorithms gradually appearing in the literature. However, up to now, none of the papers studied variable scaling both as per iteration and as per different check node degree, due to the prohibitive complexity of multioptimization over space of too many parameters. In this paper, we propose a generalized mutual information (GMI) of LLRs as the criterion to search for the scaling factors for different check node degrees in every iteration in a 1-D thus low-complexity manner. This approach is first analyzed via density evolution, and in addition can be extended to practical LLRs based formulas via Monte Carlo tools to cope with the mismatch issue. Bit error rate simulation results on two low-density parity-check codes show that our proposed GMI metrics have a noticeable gain over the variable scaling schemes that appeared in the literature.
Keyword:
Low density parity check codes
approximate/generalized mutual information
decoding
variable LLRs scaling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.8
论文数:
2.1K
被引数:
3.0K
机构
引用论文
Three-dimensional nanofabrication via ultrafast laser patterning and kinetically regulated material assembly通过超快激光图案化和动力学调节的材料组装进行三维纳米加工.png)
Science
OAAI
ScienceIF0
OAAI分享收藏Reduced complexity iterative decoding of low-density parity check codes based on belief propagation基于置信传播的低密度奇偶校验码迭代译码复杂度降低
PREAI
分享收藏
查看更多内容