论文标题
有序的可靠性位猜测随机添加噪声解码
Ordered Reliability Bits Guessing Random Additive Noise Decoding
论文作者
论文摘要
现代应用程序正在推动对超级可靠的低延迟通信的需求，重新激发了对短而高速错误纠正代码的表现的兴趣。为此，在这里，我们引入了一种猜测随机添加剂噪声解码（GAND）的软检测变体，称为有序可靠性位，可以解码任何短，高速块代码。对于$ n $ bits的代码，它的使用不超过$ \ lceil \ log_2（n）\ rceil $ bits $与代码书本无关的量化量化的软检测信息，以确定准确的解码，同时保留原始算法在硬件中高度平行的实现。证明Orbgrand可以为具有低复杂性的不同类别（BCH，CA-Polar和RLC）的代码提供类似的块误差性能，同时提供了比CA-SCL更好的块错误率性能，而CA-SCL是最先进的软检测CA-Polar解码器的状态。
Modern applications are driving demand for ultra-reliable low-latency communications, rekindling interest in the performance of short, high-rate error correcting codes. To that end, here we introduce a soft-detection variant of Guessing Random Additive Noise Decoding (GRAND) called Ordered Reliability Bits GRAND that can decode any short, high-rate block-code. For a code of $n$ bits, it avails of no more than $\lceil\log_2(n)\rceil$ bits of code-book-independent quantized soft detection information per received bit to determine an accurate decoding while retaining the original algorithm's suitability for a highly parallelized implementation in hardware. ORBGRAND is shown to provide similar block error performance for codes of distinct classes (BCH, CA-Polar and RLC) with low complexity, while providing better block error rate performance than CA-SCL, a state of the art soft detection CA-Polar decoder.
