A Fixed Latency ORBGRAND Decoder Architecture With LUT-Aided Error-Pattern Scheduling
Author:
Top Cited Papers
- 17 February 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 69 (5) , 2203-2211
Abstract
Guessing Random Additive Noise Decoding (GRAND) is a universal decoding algorithm that has been recently proposed as a practical way to perform maximum likelihood decoding. It generates a sequence of possible error patterns and applies them to the received vector, checking if the result is a valid codeword. Ordered reliability bits GRAND (ORBGRAND) improves on GRAND by considering soft information received from the channel. Both GRAND and ORBGRAND have been implemented in hardware, focusing on average performance, sacrificing worst case throughput and latency. In this work, an improved pattern schedule for ORBGRAND is proposed. It provides $> 0.5$ dB gain over the standard schedule at a block error rate $\le 10^{-5}$ , and outperforms more complex GRAND flavors with a fraction of the complexity. The proposed schedule is used within a novel code-agnositic decoder architecture: the decoder guarantees fixed high throughput and low latency, making it attractive for latency-constrained applications. It outperforms the worst-case performance of decoders by orders of magnitude, and outperforms many best-case figures. Decoding a code of length 128, it achieves a throughput of 79.21 Gb/s with 58.49 ns latency, yielding better energy efficiency and comparable area efficiency with respect to the state of the art.Keywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Guessing random additive noise decoding with soft detection symbol reliability information - SGRAND2019
- Capacity-Achieving Guessing Random Additive Noise DecodingIEEE Transactions on Information Theory, 2019
- Ultrareliable and Low-Latency Wireless Communication: Tail, Risk, and ScaleProceedings of the IEEE, 2018
- Scaling equations for the accurate prediction of CMOS device performance from 180 nm to 7 nmIntegration, 2017
- Low-Complexity Non-Iterative Soft-Decision BCH Decoder Architecture for WBAN ApplicationsJOURNAL OF SEMICONDUCTOR TECHNOLOGY AND SCIENCE, 2016
- List decoding of polar codes2011
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless ChannelsIEEE Transactions on Information Theory, 2009
- Class of algorithms for decoding block codes with channel measurement informationIEEE Transactions on Information Theory, 1972
- Sorting networks and their applications1968
- On decoding BCH codesIEEE Transactions on Information Theory, 1965