.png){kind=icon}
返回
Tree-Structured Expectation Propagation for Decoding Finite-Length LDPC Codes
.png){kind=icon}
OA
AI
DOI：10.1109/LCOMM.2011.010311.102015.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose Tree-structured Expectation Propagation (TEP) algorithm to decode finite-length Low-Density Parity-Check (LDPC) codes. The TEP decoder is able to continue decoding once the standard Belief Propagation (BP) decoder fails, presenting the same computational complexity as the BP decoder. The BP algorithm is dominated by the presence of stopping sets (SSs) in the code graph. We show that the TEP decoder, without previous knowledge of the graph, naturally avoids some fairly common SSs. This results in a significant improvement in the system performance.
Keyword:
Tree-structured expectation propagation
LDPC decoding
finite-length analysis
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
Three-dimensional nanofabrication via ultrafast laser patterning and kinetically regulated material assembly通过超快激光图案化和动力学调节的材料组装进行三维纳米加工.png)
ScienceOAAI
ScienceIF0
OAAI分享收藏
没有更多内容
没有更多内容