Performance Comparison of LDPC Block and Spatially Coupled Codes Over GF $(q)$
Performance Comparison of LDPC Block and Spatially Coupled Codes Over GF $(q)$
复制标题
DOI：
10.1109/tcomm.2015.2397433
复制
发表时间：
2014-08
影响因子：
8.3
通讯作者：
Kechao Huang;David G. M. Mitchell;Lai Wei;Xiao Ma;D. Costello
中科院分区：
文献类型：
--
作者：
Kechao Huang;David G. M. Mitchell;Lai Wei;Xiao Ma;D. Costello
在本文中，我们比较了基于原型图的空间耦合低密度奇偶校验（SC-LDPC）码和LDPC块码（LDPC-BC）在有限长GF（q）上的性能。为了减少计算复杂度和延迟，滑动窗口解码器的停止规则的基础上软信念传播（BP）估计用于q元SC-LDPC码。考虑了两种制度：一种是当q元SC-LDPC码的约束长度等于q元LDPC-BC的块长度时，另一种是当两个解码长度相等时。仿真结果证实，在这两种情况下，（3，6）-、（3，9）-和（3，12）-正则非二进制SC-LDPC码的性能明显优于二进制和非二进制LDPC-BC以及二进制SC-LDPC码。最后，我们提出了一个计算复杂度的比较，q元SC-LDPC码和q元LDPC-BC在相同的解码延迟和相同的解码性能的假设。
In this paper, we compare the finite-length performance of protograph-based spatially coupled low-density paritycheck (SC-LDPC) codes and LDPC block codes (LDPC-BCs) over GF(q). To reduce computational complexity and latency, a sliding window decoder with a stopping rule based on a soft belief propagation (BP) estimate is used for the q-ary SC-LDPC codes. Two regimes are considered: one when the constraint length of q-ary SC-LDPC codes is equal to the block length of q-ary LDPC-BCs and the other when the two decoding latencies are equal. Simulation results confirm that, in both regimes, (3,6)-, (3,9)-, and (3,12)-regular non-binary SC-LDPC codes can significantly outperform both binary and non-binary LDPC-BCs and binary SC-LDPC codes. Finally, we present a computational complexity comparison of q-ary SC-LDPC codes and q-ary LDPC-BCs under equal decoding latency and equal decoding performance assumptions.