A generalized algebraic approach to optimizing SC-LDPC codes
A generalized algebraic approach to optimizing SC-LDPC codes
复制标题
DOI：
10.1109/allerton.2017.8262802
复制
发表时间：
2017-07
期刊：
影响因子：
--
通讯作者：
Allison Beemer;Salman Habib;C. Kelley;J. Kliewer
中科院分区：
文献类型：
--
作者：
Allison Beemer;Salman Habib;C. Kelley;J. Kliewer
空间耦合低密度奇偶校验(SC-LDPC)码是稀疏图形码，由于其在无记忆二进制输入信道上接近容量的性能，最近引起了人们的兴趣。本文在基于图的代数提升的SC-LDPC码的一种新的广义描述下，统一了现有的所有SC-LDPC码的构造方法。针对基于阵列的SC-LDPC码的(3，3)-吸收集的特殊情况，提出了一种改进的低复杂度计数方法，并将其用于优化SC-LDPC码构造中的置换分配。我们证明了用这种方法构造的码在主导吸收集的数目方面以及在标准译码和加窗译码方面都能够优于以前发表的构造。
Spatially coupled low-density parity-check (SC-LDPC) codes are sparse graph codes that have recently become of interest due to their capacity-approaching performance on memoryless binary input channels. In this paper, we unify all existing SC-LDPC code construction methods under a new generalized description of SC-LDPC codes based on algebraic lifts of graphs. We present an improved low-complexity counting method for the special case of (3,3)-absorbing sets for array-based SC-LDPC codes, which we then use to optimize permutation assignments in SC-LDPC code construction. We show that codes constructed in this way are able to outperform previously published constructions, in terms of the number of dominant absorbing sets and with respect to both standard and windowed decoding.