.png){kind=icon}
返回
Adaptive-Normalized/Offset Min-Sum Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2010.07.100508.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
Reduced complexity iterative decoding of low-density parity check codes based on belief propagation基于置信传播的低密度奇偶校验码迭代译码复杂度降低
.png){kind=icon}
PREAI
分享收藏