.png){kind=icon}
返回
LDPC code construction with low error floor based on the IPEG algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2007.061650.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose a modification on the improved progressive-edge-growth(IPEG) algorithm. Proposed modification increases the connectivity of variable nodes using extrinsic message degree of variable nodes, which results in reducing the small stopping sets. Through computer simulation, we confirm that the codes constructed by the proposed algorithm have lower error floor than those constructed by the original IPEG algorithm.
Keyword:
progressive-edge-growth (PEG) algorithm
stopping set
extrinsic message degree(EMD)
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
Improved progressive-edge-growth (PEG) construction of irregular LDPC codes不规则LDPC码的改进渐进边增长 (PEG) 构造
PREAI
分享收藏
没有更多内容
没有更多内容