.png){kind=icon}
返回
Low-Complexity Concatenated LDPC-Staircase Codes
.png){kind=icon}
OA
AI
DOI：10.1109/JLT.2018.2812738.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A low-complexity soft-decision concatenated FEC scheme, consisting of an inner LDPC code and an outer staircase code, is proposed. The inner code is tasked with reducing the bit error probability below the outer-code threshold. The concatenated code is obtained by optimizing the degree distribution of the inner-code ensemble to minimize estimated data-flow, for various choices of outer staircase codes. A key feature that emerges from this optimization is that it pays to leave some inner codeword bits completely uncoded, thereby greatly reducing a significant portion of the decoding complexity. The tradeoff between required signalto-noise ratio and decoding complexity of the designed codes is characterized by a Pareto frontier. Computer simulations of the resulting codes reveals that the net coding-gains of existing designs can be achieved with up to 71% reduction in complexity. A hardware-friendly quasi-cyclic construction is given for the inner codes, which can realize an energy-efficient decoder implementation, and even further complexity reductions via a layered message-passing decoder schedule.
Keyword:
Concatenated codes
fiber-optic communications
forward error correction
low-density parity-check codes
optical transport network
pareto frontier
quasi-cyclic codes
staircase codes
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.8
论文数:
1.7W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容