arrow
返回

Adaptive-Normalized/Offset Min-Sum Algorithm

delete2010-07-01
delete64
PRE
AI
X
Xiaofu Wu *
M
Ming Jiang
C
Chunming Zhao
DOI:10.1109/LCOMM.2010.07.100508delete
delete原文链接
delete分享
delete收藏
摘要

摘要

En 中文
An adaptive-normalized/offset min-sum (AN-/AO-MS) algorithm for decoding low-density parity-check (LDPC) codes is proposed. Unlike the normalized/offset min-sum (NMS/OMS) algorithm, the normalization/offset factor is adaptively adjusted according to the state of check nodes in each iteration. Simulation results show that the proposed AN-/AO-MS algorithm can perform better than the NMS/OMS algorithm while still preserving the low complexity of the min-sum algorithm.
Keyword:
Decoding
min-sum algorithm
low-density parity-check (LDPC) codes
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Communications Letters 封面图
IEEE Communications Letters
IF:
4.4
论文数:
1.3W
被引数:
2.8W

机构

S
southeast university - china
学者数:
0
论文数: 831
被引数: 4.1W
A
Army Engineering University of PLA
学者数:
379
论文数: 108
被引数: 2.2K
引用论文

引用论文

Improving belief propagation on graphs with cycles
err2004-01-01
err77
PREAI
errYazdani, MR; Hemati, S; Banihashemi, AH
err分享
err收藏