论文标题
基于错误和蠕虫解码的产品和楼梯代码的新型高通量解码算法
Novel High-Throughput Decoding Algorithms for Product and Staircase Codes based on Error-and-Erasure Decoding
论文作者
论文摘要
产品代码（PC）和楼梯代码（SCC）是根据组件代码的有界距离解码（BDD）和行之间的迭代进行解码的。迭代BDD（IBDD）的性能可以使用软辅助（混合）算法提高。其中，最近提出了具有合并可靠性（IBDD-CR）的IBDD，与IBDD相比，其复杂性略有提高，其性能增长幅度很大。在本文中，我们首先将IBDD-CR扩展到SCC。然后，我们为PC和SCC提出了两种新型的解码算法，这些算法在IBDD-CR上有所改进。新算法基于错误代码的错误和擦除解码，使用额外的解码尝试。所提出的算法仅需要在组件解码器之间交换硬消息，这使它们成为超高通量光纤系统的有吸引力的解决方案。仿真结果表明，我们的算法基于两次解码尝试，PC和SCC的算法可达到$ 0.88 $ dB的收益。这对应于IBDD上$ 33 \％$的光学覆盖范围增强，并使用$ 256 $正交振幅调制调制，并使用位插入的编码调制。
Product codes (PCs) and staircase codes (SCCs) are conventionally decoded based on bounded distance decoding (BDD) of the component codes and iterating between row and column decoders. The performance of iterative BDD (iBDD) can be improved using soft-aided (hybrid) algorithms. Among these, iBDD with combined reliability (iBDD-CR) has been recently proposed for PCs, yielding sizeable performance gains at the expense of a minor increase in complexity compared to iBDD. In this paper, we first extend iBDD-CR to SCCs. We then propose two novel decoding algorithms for PCs and SCCs which improve upon iBDD-CR. The new algorithms use an extra decoding attempt based on error and erasure decoding of the component codes. The proposed algorithms require only the exchange of hard messages between component decoders, making them an attractive solution for ultra high-throughput fiber-optic systems. Simulation results show that our algorithms based on two decoding attempts achieve gains of up to $0.88$ dB for both PCs and SCCs. This corresponds to a $33\%$ optical reach enhancement over iBDD with bit-interleaved coded modulation using $256$ quadrature amplitude modulation.
