论文标题
单个平价检查产品代码的连续取消解码：分析和改进的解码
Successive Cancellation Decoding of Single Parity-Check Product Codes: Analysis and Improved Decoding
论文作者
论文摘要
具有单个奇偶校验检查组件代码的产品代码可以通过多内核极性代码的工具来描述，其中生成器矩阵的行是根据产品代码构建所施加的约束选择的。在观察之后，引入了此类代码的连续取消解码。特别是，在连续取消解码下，通过二进制无内存对称通道进行单个平价检查产品代码的误差概率是表征的。还为二元擦除通道建立了具有Elias引入的产品代码分析的桥梁。然后描述连续的取消列表解码单个奇偶校验 - 检查产品代码。在提供的示例中，对二进制输入添加剂白色高斯频道的模拟显示，连续的取消列表解码超过信念传播解码应用于代码图。最后，通过距离频谱分析研究了产品代码与高速外代码的串联的性能。提供了从随机编码联盟约束$ 0.7 $ dB以内的串联执行的示例。
A product code with single parity-check component codes can be described via the tools of a multi-kernel polar code, where the rows of the generator matrix are chosen according to the constraints imposed by the product code construction. Following this observation, successive cancellation decoding of such codes is introduced. In particular, the error probability of single parity-check product codes over binary memoryless symmetric channels under successive cancellation decoding is characterized. A bridge with the analysis of product codes introduced by Elias is also established for the binary erasure channel. Successive cancellation list decoding of single parity-check product codes is then described. For the provided example, simulations over the binary input additive white Gaussian channel show that successive cancellation list decoding outperforms belief propagation decoding applied to the code graph. Finally, the performance of the concatenation of a product code with a high-rate outer code is investigated via distance spectrum analysis. Examples of concatenations performing within $0.7$ dB from the random coding union bound are provided.
