论文标题
通过破坏图对称性的准循环LDPC代码的自动形态合奏解码
Automorphism Ensemble Decoding of Quasi-Cyclic LDPC Codes by Breaking Graph Symmetries
论文作者
论文摘要
我们考虑了准循环（QC）低密度平价检查（LDPC）代码的自动形态集合解码（AED）。在常规因子图上解码的信念传播（BP）与准环状自动形态相等，因此可以阻止AED的收益。但是，通过对接收器侧的奇偶校验检查矩阵应用小修改，我们可以破坏对称性，而无需更改发射机处的代码。这样，我们可以使用相同的BP解码器集合来利用错误校正性能的增益，而不会增加最差的解码延迟。使用CCSD，802.11N和5G标准的LDPC代码证明了该方法，并在常规BP解码上产生0.2至0.3 dB的增益。与表现类似的饱和BP（SBP）相比，所提出的算法将平均解码潜伏期降低了八次以上。
We consider automorphism ensemble decoding (AED) of quasi-cyclic (QC) low-density parity-check (LDPC) codes. Belief propagation (BP) decoding on the conventional factor graph is equivariant to the quasi-cyclic automorphisms and therefore prevents gains by AED. However, by applying small modifications to the parity-check matrix at the receiver side, we can break the symmetry without changing the code at the transmitter. This way, we can leverage a gain in error-correcting performance using an ensemble of identical BP decoders, without increasing the worst-case decoding latency. The proposed method is demonstrated using LDPC codes from the CCSDS, 802.11n and 5G standards and produces gains of 0.2 to 0.3 dB over conventional BP decoding. Compared to the similarly performing saturated BP (SBP), the proposed algorithm reduces the average decoding latency by more than eight times.
