.png){kind=icon}
返回
Layered BP decoding for rate-compatible punctured LDPC codes
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2007.061962.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Rate-compatible punctured LDPC codes have shown to perform well over a wide variety of code rates, both theoretically and practically. However it has been reported that the belief propagation (BP) decoding for these codes converges slower than for unpunctured codes. Layered BP algorithm is a modified BP algorithm that accelerates the decoding convergence by means of sequential scheduling of check node updates. In this letter, we propose an efficient scheduling of check node updates for rate-compatible punctured LDPC codes that performs well. We show that the convergence speed of the proposed scheduling outperforms conventional (random) scheduling and conventional, BP decoding. Performance improvements become more distinctive with the growing fraction of punctured bits.
Keyword:
rate-compatible punctured LDPC codes
fast decoding
layered BP decoding
check node scheduling/layering
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
没有更多内容
没有更多内容