Ordered Reliability Bits Guessing Random Additive Noise Decoding

Abstract

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.

References in corpus (1)

• Keep the bursts and ditch the interleavers

Cited by in corpus (12)

• Ordered Reliability Bits Guessing Random Additive Noise Decoding
• High-Throughput and Energy-Efficient VLSI Architecture for Ordered Reliability Bits GRAND
• CRC Codes as Error Correction Codes
• List-GRAND: A practical way to achieve Maximum Likelihood Decoding
• High-Throughput VLSI architecture for Soft-Decision decoding with ORBGRAND
• Keep the bursts and ditch the interleavers
• Quantum Error Correction via Noise Guessing Decoding
• GRAND for Fading Channels using Pseudo-soft Information
• Soft-input, soft-output joint detection and GRAND
• URLLC with Coded Massive MIMO via Random Linear Codes and GRAND
• Physical layer insecurity
• A Balanced Tree Transformation to Reduce GRAND Queries