当前位置: X-MOL 学术IEEE Trans. Commun. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Construction of Time Invariant Spatially Coupled LDPC Codes Free of Small Trapping Sets
IEEE Transactions on Communications ( IF 8.3 ) Pub Date : 2021-02-22 , DOI: 10.1109/tcomm.2021.3060797
Sima Naseri , Amir H. Banihashemi

In this paper, we propose a design technique for the construction of variable-regular time-invariant spatially-coupled low-density parity-check (SC-LDPC) codes with small constraint length and low error floor. The proposed technique reduces the error floor by imposing simple constraints on the short cycles in the code’s Tanner graph, which in turn, result in the elimination of the most dominant trapping sets of the code. In some cases, we also derive lower bounds on the syndrome former memory for satisfying such constraints. The designed codes are superior to the state-of-the-art in terms of error floor performance and/or decoding complexity and latency.

中文翻译:

无小陷阱集的时不变空间耦合LDPC码的构造

在本文中,我们提出了一种设计技术,用于构造具有小约束长度和低错误层的可变规则时不变空间耦合低密度奇偶校验 (SC-LDPC) 码。所提出的技术通过对代码的 Tanner 图中的短周期施加简单的约束来减少错误层,这反过来又会导致消除代码中最主要的陷阱集。在某些情况下,我们还推导出了满足这些约束的综合征前记忆的下限。设计的代码在错误底性能和/或解码复杂性和延迟方面优于现有技术。
更新日期:2021-02-22
down
wechat
bug