This paper introduces three key initiatives in the pursuit of a hybrid decoding framework characterized by superior decoding performance, high throughput, low complexity, and independence from channel noise variance. Firstly, adopting a graphical neural network perspective, we propose a design methodology for a family of neural min-sum variants. Our exploration delves into the frame error rates associated with different decoding variants and the consequential impact of decoding failures on subsequent ordered statistics decoding. Notably, these neural min-sum variants exhibit generally indistinguishable performance, hence the simplest member is chosen as the constituent of the hybrid decoding. Secondly, to address computational complexities arising from exhaustive searches for authentic error patterns in cases of decoding failure, two alternatives for ordered statistics decoding implementation are proposed. The first approach involves uniformly grouping test error patterns, while the second scheme dynamically generates qualified searching test error patterns with varied sizes for each group. In both methods, group priorities are determined empirically. Thirdly, iteration diversity is highlighted in the case of LDPC codes requiring high maximum iterations of decoding. This is achieved by segmenting the long iterative decoding trajectory of a decoding failure into shorter segments, which are then independently fed to small models to enhance the chances of acquiring the authentic error pattern. These ideas are substantiated through extensive simulation results covering the codes with block lengths ranging from one hundred to several hundreds.

翻译：本文提出了三项关键举措，旨在构建一种兼具卓越译码性能、高吞吐量、低复杂度且不依赖信道噪声方差的混合译码框架。首先，从图神经网络的角度出发，我们提出了一类神经最小和变体的设计方法论。研究深入探讨了不同译码变体对应的帧错误率，以及译码失败对后续有序统计译码的连锁影响。值得注意的是，这些神经最小和变体在性能上几乎难以区分，因此选择其中最简单的成员作为混合译码的组成模块。其次，为解决译码失败时因穷举搜索真实错误模式而引发的计算复杂性问题，提出了两种有序统计译码实现的替代方案。第一种方法对测试错误模式进行均匀分组，第二种方案则针对每组动态生成大小可变的合格搜索测试错误模式。两种方法均通过经验确定组优先级。第三，针对需要高最大迭代次数的LDPC码，强调了迭代多样性策略。具体通过将译码失败的长迭代轨迹分割为较短的片段，并独立输入小型模型以提升获取真实错误模式的可能性。这些理念通过覆盖块长从一百到数百比特码字的大量仿真结果得到了验证。