MURAL - Maynooth University Research Archive Library

    Ordered Reliability Bits Guessing Random Additive Noise Decoding

    Duffy, Ken R. (2021) Ordered Reliability Bits Guessing Random Additive Noise Decoding. In: IEEE International Conference on Acoustics, Speech and Signal Processing ICASSP 2021, Toronto, Canada.

    Download (1MB) | Preview

    Share your research

    Twitter Facebook LinkedIn GooglePlus Email more...

    Add this article to your Mendeley library


    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 Re- liability Bits GRAND that can decode any moderate redundancy block-code. For a code of n bits, it avails of no more than dlog2(n)e 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.

    Item Type: Conference or Workshop Item (Paper)
    Keywords: URLLC;GRAND; Soft Decision; Quantization;
    Academic Unit: Faculty of Science and Engineering > Research Institutes > Hamilton Institute
    Item ID: 15235
    Identification Number:
    Depositing User: Dr Ken Duffy
    Date Deposited: 12 Jan 2022 12:25
    Refereed: Yes
    Use Licence: This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here

    Repository Staff Only(login required)

    View Item Item control page


    Downloads per month over past year

    Origin of downloads