arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2605.08081cs.ITmath.IT
收藏

类似Chase的解码:测试模式设计与性能分析

Chase-like Decoding: Test-Pattern Design and Performance Analysis

Institute of Telecommunications, University of Stuttgart, Germany(斯图加特大学电信研究所)

Tim Janz, Simon Obermüller, Andreas Zunker, Stephan ten Brink

AI总结:

本文通过三种方法评估不同测试模式集的性能,提出一种设计测试模式集的算法,使高率BCH码性能提升0.2dB。

摘要:

Chase-like解码算法是软输入解码代数码的流行选择。本文通过三种方法评估不同测试模式集的性能。对于具有特定结构的测试模式集,如Chase-II测试模式和最大逻辑重量下的模式,使用基于顺序统计的方法。通过计算覆盖空间概率和直接蒙特卡洛模拟评估任意测试模式集的性能。基于尽可能覆盖更多可能的误差模式的想法,我们提出了一种设计测试模式集的算法,使高率BCH码的性能比常用测试模式集提高0.2$\,$dB。

英文摘要:

Chase-like decoding algorithms are a popular choice for soft-input decoding of algebraic codes. We evaluate different test-pattern sets for Chase-like decoding. Structured sets, such as Chase-II patterns or patterns chosen by logistic weight, are analyzed using order statistics, while arbitrary sets are evaluated by calculating covered-space probabilities and by performing Monte Carlo simulation. We further propose an algorithm that designs test-pattern sets to cover likely error patterns, achieving comparable performance with half the number of test patterns compared with conventional sets for high-rate BCH codes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑