Many channel decoders rely on parallel decoding attempts to achieve good performance with acceptable latency. However, most of the time fewer attempts than the foreseen maximum are sufficient for successful decoding. Input-distribution-aware (IDA) decoding allows to determine the parallelism of polar code list decoders by observing the distribution of channel information. In this work, IDA decoding is proven to be effective with different codes and decoding algorithms as well. Two techniques, M-IDA and MD-IDA, are proposed: they exploit the sampling of the input distribution inherent to particular decoding algorithms to perform low-cost IDA decoding. Simulation results on the decoding of BCH codes via the Chase and ORBGRAND algorithms show that they perform at least as well as the original IDA decoding, allowing to reduce run-time complexity down to 17% and 67\% with minimal error correction degradation.
翻译:许多频道解码器依靠平行解码努力,以可接受的延迟度实现良好的运行。 但是,大多数比预期的最大值少的尝试都足以成功解码。 输入- 分配- 显示(IDA)解码器通过观察频道信息的发布,可以确定极代码列表解码器的平行性。 在这项工作中,开发协会的解码功能被证明与不同的代码和解码算法同样有效。 提出了两种技术,即M- IDA和MD- IDA:它们利用特定解码算法所固有的输入分布样本来进行低成本的 IDA解码。 通过大通和ORBGRAND算法模拟对 BCH代码解码的解码结果显示,它们的表现至少与最初的 IDA解码法一样,可以将运行复杂度降低到17% 和 67 ⁇ , 最小的错误校正退化 。