This paper presents a generalized construction of RS-SPC product codes. A low-complexity joint-decoding scheme is proposed for these codes, in which a BP-based iterative decoding is performed based on the binary expansion of the whole parity-check matrix. Various powerful RS codes can be used as the component codes for RS-SPC product codes, which gives a good performance for local decoding (decode a single component codeword). The proposed BP-based iterative decoding is a global decoding, and it achieves an error-correcting capability comparable to codes of large blocklengths. This two-phase decoding scheme preserves the low decoding latency and complexity of the local decoding while achieves high reliability through the global decoding. The complexity of the proposed iterative decoding is discussed, and the simulation results show the proposed scheme offers a good trade-off between the complexity and the error performance.
翻译：本文件介绍了对RS-SPC产品编码的普遍构建。为这些编码提出了一种低复杂度联合编码办法,其中根据全对等检查矩阵的二进制扩展进行了基于BP的迭代解码。各种强大的RS代码可以用作RS-SPC产品编码的组成部分代码,这为当地解码工作提供了良好的表现(设计了一个单一的构件编码)。拟议的基于BP的迭代编码是一种全球解码,实现了与大块长串编码相类似的错误校正能力。这一两阶段解码办法保持了当地解码的低解码长度和复杂性,同时通过全球解码工作实现了高度可靠性。讨论了拟议的迭代编码的复杂性,模拟结果显示拟议的办法在复杂性和误差性之间提供了良好的权衡。
相关内容
微信扫码咨询专知VIP会员