.png){kind=icon}
返回
Decoding LDPC Codes With Locally Maximum-Likelihood Binary Messages
.png){kind=icon}
OA
AI
DOI：10.1109/LCOMM.2014.2366095.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A new low-complexity message passing algorithm is described for decoding low-density parity-check (LDPC) codes by exchanging binary messages. The algorithm computes the local maximum-likelihood binary message (LMLBM) at each symbol node, given the combination of local channel information and partial syndrome components from adjacent parity check nodes. When channel information is quantized, the locally ML messages are pre-computed and stored in a dynamic global lookup table. The proposed algorithm uses memoryless extrinsic messages so that density evolution thresholds can be directly computed. Thresholds are obtained for regular ensembles, predicting good performance on quantized binary-input additive white Gaussian noise (biAWGN) channels.
Keyword:
Channel coding
low density parity check (LDPC) codes
iterative decoding
binary message-passing decoding
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
Three-dimensional nanofabrication via ultrafast laser patterning and kinetically regulated material assembly通过超快激光图案化和动力学调节的材料组装进行三维纳米加工.png)
Science
OAAI
ScienceIF0
OAAI分享收藏Substance dependence and chronic pain: Profile of 50 patients treated in an alcohol and drug dependence unitPain
PainIF0
PREAI
分享收藏
查看更多内容