SOGRAND Assisted Guesswork Reduction
arXiv:2503.22885 · doi:10.1109/LCOMM.2025.3607769
Abstract
Proposals have been made to reduce the guesswork of Guessing Random Additive Noise Decoding (GRAND) for binary linear codes by leveraging codebook structure at the expense of degraded block error rate (BLER). We establish one can preserve guesswork reduction while eliminating BLER degradation through dynamic list decoding terminated based on Soft Output GRAND's error probability estimate. We illustrate the approach with a method inspired by published literature and compare performance with Guessing Codeword Decoding (GCD). We establish that it is possible to provide the same BLER performance as GCD while reducing guesswork by up to a factor of 32.
References in corpus (6)
- Capacity-achieving Guessing Random Additive Noise Decoding (GRAND)
- Ordered Reliability Bits Guessing Random Additive Noise Decoding
- High-Throughput and Energy-Efficient VLSI Architecture for Ordered Reliability Bits GRAND
- Soft-output (SO) GRAND and Iterative Decoding to Outperform LDPCs
- Symbol-Level GRAND for High-Order Modulation over Flat Fading Channels
- A Balanced Tree Transformation to Reduce GRAND Queries