English
Related papers

Related papers: A 95.5Gb/s 29.6ns worst-case latency ORBGRAND deco…

200 papers

This paper reviews the potential channel decoding techniques for ultra-reliable low-latency communications (URLLC). URLLC is renowned for its stringent requirements including ultra-reliability, low end-to-end transmission latency, and…

Information Theory · Computer Science 2022-12-26 Chentao Yue , Vera Miloslavskaya , Mahyar Shirvanimoghaddam , Branka Vucetic , Yonghui Li

Guessing Random Additive Noise Decoding (GRAND) is a recently proposed Maximum Likelihood (ML) decoding technique. Irrespective of the structure of the error correcting code, GRAND tries to guess the noise that corrupted the codeword in…

Information Theory · Computer Science 2021-08-31 Syed Mohsin Abbas , Marwan Jalaleddine , Warren J. Gross

Decoding via sequentially guessing the error pattern in a received noisy sequence has received attention recently, and ORBGRAND has been proposed as one such decoding algorithm that is capable of utilizing the soft information embedded in…

Information Theory · Computer Science 2022-12-20 Mengxiao Liu , Yuejun Wei , Zhenyuan Chen , Wenyi Zhang

CRC codes have long since been adopted in a vast range of applications. The established notion that they are suitable primarily for error detection can be set aside through use of the recently proposed Guessing Random Additive Noise…

Information Theory · Computer Science 2024-10-28 Wei An , Muriel Médard , Ken R. Duffy

Future beyond-5G and 6G systems demand ultra-reliable, low-latency communication with short blocklengths, motivating the development of universal decoding algorithms. Guessing decoding, which infers the noise or codeword candidate in order…

Information Theory · Computer Science 2025-11-24 Qianfan Wang , Jifan Liang , Peihong Yuan , Ken R. Duffy , Muriel Médard , Xiao Ma

In this paper, we study the problem of latency and reliability trade-off in ultra-reliable low-latency communication (URLLC) in the presence of decoding complexity constraints. We consider linear block encoded codewords transmitted over a…

Information Theory · Computer Science 2021-01-08 Hasan Basri Celebi , Antonios Pitarokoilis , Mikael Skoglund

Ultra-reliability and low-latency are pivotal requirements of the new 6th generation of communication systems (xURLLC). Over the past years, to increase throughput, adaptive active antennas were introduced in advanced wireless…

We establish that a large, flexible class of long, high redundancy error correcting codes can be efficiently and accurately decoded with guessing random additive noise decoding (GRAND). Performance evaluation demonstrates that it is…

Information Theory · Computer Science 2025-12-18 Peihong Yuan , Muriel Medard , Kevin Galligan , Ken R. Duffy

Ultra-reliable low latency communication (URLLC) is a key part of 5G wireless systems. Achieving low latency necessitates codes with short blocklengths for which polar codes with successive cancellation list (SCL) decoding typically…

Hardware Architecture · Computer Science 2025-12-22 Darja Nonaca , Jérémy Guichemerre , Reinhard Wiesmayr , Nihat Engin Tunali , Christoph Studer

In this work, we investigate guessing random additive noise decoding (GRAND) with quantized soft input. First, we analyze the achievable rate of ordered reliability bits GRAND (ORBGRAND), which uses the rank order of the reliability as…

Information Theory · Computer Science 2022-11-28 Peihong Yuan , Ken R. Duffy , Evan P. Gabhart , Muriel Médard

Within the family of guessing-based decoding algorithms, ordered reliability bits GRAND (ORBGRAND) has attracted considerable attention due to its efficient use of soft information and suitability for hardware implementation. It has also…

Information Theory · Computer Science 2026-05-05 Zhuang Li , Wenyi Zhang

This paper reviews the state of the art channel coding techniques for ultra-reliable low latency communication (URLLC). The stringent requirements of URLLC services, such as ultra-high reliability and low latency, have made it the most…

Guessing random additive noise decoding (GRAND) is a universal maximum-likelihood decoder that recovers code-words by guessing rank-ordered putative noise sequences and inverting their effect until one or more valid code-words are obtained.…

Information Theory · Computer Science 2023-04-18 Hadi Sarieddeen , Muriel Médard , Ken. R. Duffy

There have been significant advances in recent years in the development of forward error correction decoders that can decode codes of any structure, including practical realizations in synthesized circuits and taped out chips. While…

Signal Processing · Electrical Eng. & Systems 2025-11-11 Jiewei Feng , Ken R. Duffy , Muriel Médard

We introduce a novel approach to error correction decoding in the presence of additive alpha-stable noise, which serves as a model of interference-limited wireless systems. In the absence of modifications to decoding algorithms, treating…

Information Theory · Computer Science 2024-10-31 Charles Wiame , Ken R. Duffy , Muriel Médard

Ultra-reliable low latency communications (uRLLC) is adopted in the fifth generation (5G) mobile networks to better support mission-critical applications that demand high level of reliability and low latency. With the aid of…

Information Theory · Computer Science 2023-07-20 Xiaohu You , Bin Sheng , Yongming Huang , Wei Xu , Chuan Zhang , Dongming Wang , Pengcheng Zhu , Chen Ji

Future 5G cellular networks supporting ultra-reliable, low-latency communications (URLLC) could employ random access communication to reduce the overhead compared to scheduled access techniques used in 4G networks. We consider a wireless…

Information Theory · Computer Science 2018-06-06 Derya Malak , Howard Huang , Jeffrey G. Andrews

Parallelism has become a central concern in modern decoding frameworks aiming to meet stringent throughput and latency requirements. Guessing Random Additive Noise Decoding (GRAND) is a recently proposed decoding paradigm that tests…

Information Theory · Computer Science 2026-05-04 Li Wan , Huarui Yin , Wenyi Zhang

Guessing Random Additive Noise Decoding (GRAND) is a family of hard- and soft-detection error correction decoding algorithms that provide accurate decoding of any moderate redundancy code of any length. Here we establish a method through…

Information Theory · Computer Science 2023-08-11 Kevin Galligan , Peihong Yuan , Muriel Médard , Ken R. Duffy

To facilitate applications in IoT, 5G, and beyond, there is an engineering need to enable high-rate, low-latency communications. Errors in physical channels typically arrive in clumps, but most decoders are designed assuming that channels…

Information Theory · Computer Science 2023-04-18 Wei An , Muriel Médard , Ken R. Duffy