多项式乘积码中的停滞模式避免
Stall Pattern Avoidance in Polynomial Product Codes
AI总结:
针对多项式乘积码,提出一种低复杂度后处理技术以避免停滞模式,显著提升纠错性能,并给出紧的错误率下界。
摘要:
乘积码是一种级联纠错方案,常被考虑用于需要极低比特错误率的应用,这些应用要求尽可能降低错误平层。在这项工作中,我们考虑由多项式代数码构造的乘积码,并提出一种新颖的低复杂度后处理技术,该技术能够将纠错性能提升数个数量级。我们提供了后处理下可实现错误率的下界,并给出模拟结果表明这些界是紧的。
英文摘要:
Product codes are a concatenated error-correction scheme that has been often considered for applications requiring very low bit-error rates, which demand that the error floor be decreased as much as possible. In this work, we consider product codes constructed from polynomial algebraic codes, and propose a novel low-complexity post-processing technique that is able to improve the error-correction performance by orders of magnitude. We provide lower bounds for the error rate achievable under post processing, and present simulation results indicating that these bounds are tight.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。