论文标题
有序的可靠性位猜测随机添加噪声解码
Ordered Reliability Bits Guessing Random Additive Noise Decoding
论文作者
论文摘要
传统上，错误校正技术集中于与特定于代码的解码器同时设计的限制代码结构的共同设计，这些解码器在硬件中解码长代码时在计算上有效。但是，现代应用是推动对超级可靠的低延迟通信（URLLC）的需求，重新激发了对较短，更高率误差校正代码的性能的兴趣，并提高了重新访问通用，代码 - 敏锐性解码器的可能性。 为此，在这里，我们引入了一种猜测随机添加噪声解码（GRAND）的软检测变体，称为有序可靠性位，可以准确地解码任何中等冗余的块代码。它的设计考虑了有效的电路实现，并确定了准确的解码，同时保留了原始的硬检测大算法在硬件中高度平行的实现的适用性。 证明Orbgrand可以为具有适度复杂性的不同类别（BCH，CA-Polar和RLC）的代码提供出色的软决策错误性能，同时提供了比CA-SCL更好的块错误率性能（CA-SCL），CA-SCL是最先进的软检测CA-Polar Dexoder的状态。 Orbgrand提供了适用于在单个硬件实现中传递URLLC的准确，节能的软检测解码器的可能性。
Error correction techniques traditionally focus on the co-design of restricted code-structures in tandem with code-specific decoders that are computationally efficient when decoding long codes in hardware. Modern applications are, however, driving demand for ultra-reliable low-latency communications (URLLC), rekindling interest in the performance of shorter, higher-rate error correcting codes, and raising the possibility of revisiting universal, code-agnostic decoders. To that end, here we introduce a soft-detection variant of Guessing Random Additive Noise Decoding (GRAND) called Ordered Reliability Bits GRAND that can accurately decode any moderate redundancy block-code. It is designed with efficient circuit implementation in mind, and determines accurate decodings while retaining the original hard detection GRAND algorithm's suitability for a highly parallelized implementation in hardware. ORBGRAND is shown to provide excellent soft decision block error performance for codes of distinct classes (BCH, CA-Polar and RLC) with modest complexity, while providing better block error rate performance than CA-SCL, a state of the art soft detection CA-Polar decoder. ORBGRAND offers the possibility of an accurate, energy efficient soft detection decoder suitable for delivering URLLC in a single hardware realization.
