论文标题
用于二进制消息传递产品代码的二元消息的可靠性合并
Refined Reliability Combining for Binary Message Passing Decoding of Product Codes
论文作者
论文摘要
我们提出了一种针对产品代码（PC）的新型软辅助迭代解码算法。所提出的算法通过合并可靠性（IBDD-CR）命名为迭代有界距离解码，可通过利用一定级别的软信息来增强PC的常规迭代距离解码（IBDD）。特别是，IBDD-CR可以看作是IBDD的修改，在该修改中，根据BDD输出的可靠性估算，行和列解码器的艰难决策。可靠性估计是使用涵盖PC的广义低密度 - 积分检查（GLDPC）合奏的外部消息传递得出的。我们对IBDD-CR进行了密度演化分析，以在GLDPC合奏的添加白色高斯噪声通道上传播。我们考虑具有正交幅度调制的二进制传输和位插入的编码调制。与IBDD相比，IBDD-CR的性能获得了高达$ 0.51 $ db的性能，具有相同的内部解码器数据流。这使该算法成为非常高通量应用（例如光纤通信）的有吸引力的解决方案。
We propose a novel soft-aided iterative decoding algorithm for product codes (PCs). The proposed algorithm, named iterative bounded distance decoding with combined reliability (iBDD-CR), enhances the conventional iterative bounded distance decoding (iBDD) of PCs by exploiting some level of soft information. In particular, iBDD-CR can be seen as a modification of iBDD where the hard decisions of the row and column decoders are made based on a reliability estimate of the BDD outputs. The reliability estimates are derived using extrinsic message passing for generalized low-density-parity check (GLDPC) ensembles, which encompass PCs. We perform a density evolution analysis of iBDD-CR for transmission over the additive white Gaussian noise channel for the GLDPC ensemble. We consider both binary transmission and bit-interleaved coded modulation with quadrature amplitude modulation.We show that iBDD-CR achieves performance gains up to $0.51$ dB compared to iBDD with the same internal decoder data flow. This makes the algorithm an attractive solution for very high-throughput applications such as fiber-optic communications.
