English
Related papers

Related papers: Soft Maximum Likelihood Decoding using GRAND

200 papers

In addition to a proposed codeword, error correction decoders that provide blockwise soft output (SO) return an estimate of the likelihood that the decoding is correct. Following Forney, such estimates are traditionally only possible for…

Information Theory · Computer Science 2025-03-24 Jiewei Feng , Ken R. Duffy , Muriel Médard

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

We combine two approaches to optimize the iterative decoding of product codes with precoded polar component codes. On one side, we generate bitwise soft messages based on the codebook probability, an approximation of an auxiliary quantity…

Information Theory · Computer Science 2025-08-29 Nicolás Alvarez Prado , Andreas Straßhofer

Guessing random additive noise decoding (GRAND) is a noise-centric decoding method, which is suitable for ultra-reliable low-latency communications, as it supports high-rate error correction codes that generate short-length codewords. GRAND…

Information Theory · Computer Science 2022-12-12 Ioannis Chatzigeorgiou , Francisco A. Monteiro

Supporting ultra-reliable and low-latency communication (URLLC) is a challenge in current wireless systems. Channel codes that generate large codewords improve reliability but necessitate the use of interleavers, which introduce undesirable…

Information Theory · Computer Science 2023-07-12 Sahar Allahkaram , Francisco A. Monteiro , Ioannis Chatzigeorgiou

Maximum-likelihood (ML) decoding can be used to obtain the optimal performance of error correction codes. However, the size of the search space and consequently the decoding complexity grows exponentially, making it impractical to be…

Information Theory · Computer Science 2022-05-25 Mohammad Rowshan , Jinhong Yuan

Polar codes are of great interest since they are the first provably capacity-achieving forward error correction codes. To improve throughput and to reduce decoding latency of polar decoders, maximum likelihood (ML) decoding units are used…

Information Theory · Computer Science 2015-10-27 Chenrong Xiong , Jun Lin , Zhiyuan Yan

Long polar codes can achieve the capacity of arbitrary binary-input discrete memoryless channels under a low complexity successive cancelation (SC) decoding algorithm. But for polar codes with short and moderate code length, the decoding…

Information Theory · Computer Science 2016-11-18 Jun Lin , Chenrong Xiong , Zhiyuan Yan

We investigate the use of modern code-agnostic decoders to convert CA-SCL from an incomplete decoder to a complete one. When CA-SCL fails to identify a codeword that passes the CRC check, we apply a code-agnostic decoder that identifies a…

Information Theory · Computer Science 2025-12-12 Jiewei Feng , Peihong Yuan , Ken R. Duffy , Muriel Médard

For spectral efficiency, higher order modulation symbols confer information on more than one bit. As soft detection forward error correction decoders assume the availability of information at binary granularity, however, soft demappers are…

Information Theory · Computer Science 2023-08-11 Wei An , Muriel Medard , Ken R. Duffy

We introduce an algorithm for approximating the codebook probability that is compatible with all successive cancellation (SC)-based decoding algorithms, including SC list (SCL) decoding. This approximation is based on an auxiliary…

Information Theory · Computer Science 2025-12-18 Peihong Yuan , Ken R. Duffy , Muriel Médard

We propose a massive parallel decoding GRAND framework. The framework introduces two novelties: 1. A likelihood function for $M$-QAM demodulated signals that effectively reduces the symbol error pattern space from $\mathcal{O}(5^{N/\log_2…

Information Theory · Computer Science 2024-05-06 Danilo Gligoroski , Sahana Sridhar , Katina Kralevska

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

To meet the Ultra Reliable Low Latency Communication (URLLC) needs of modern applications, there have been significant advances in the development of short error correction codes and corresponding soft detection decoders. A substantial…

Information Theory · Computer Science 2023-08-11 Ken R. Duffy , Moritz Grundei , Muriel Medard

We introduce and analyze a discrete soft-decision channel called the linear reliability channel (LRC) in which the soft information is the rank ordering of the received symbol reliabilities. We prove that the LRC is an appropriate…

Information Theory · Computer Science 2025-09-11 Alexander Mariona , Ken R. Duffy , Muriel Médard

Polar codes are the first class of capacity-achieving forward error correction (FEC) codes. They have been selected as one of the coding schemes for the 5G communication systems due to their excellent error correction performance when…

Signal Processing · Electrical Eng. & Systems 2019-05-23 ChenYang Xia , YouZhe Fan , Chi-ying Tsui

Although iterative decoding of polar codes has recently made huge progress based on the idea of permuted factor graphs, it still suffers from a non-negligible performance degradation when compared to state-of-the-art CRC-aided successive…

Information Theory · Computer Science 2020-01-20 Marvin Geiselhart , Ahmed Elkelesh , Moustafa Ebada , Sebastian Cammerer , Stephan ten Brink

In multiple-input multiple-output (MIMO) fading channels maximum likelihood (ML) detection is desirable to achieve high performance, but its complexity grows exponentially with the spectral efficiency. The current state of the art in MIMO…

Information Theory · Computer Science 2007-07-13 Massimiliano Siti , Michael P. Fitz

We present a novel method for error correction in the presence of fading channel estimation errors (CEE). When such errors are significant, considerable performance losses can be observed if the wireless transceiver is not adapted. Instead…

Information Theory · Computer Science 2025-06-18 Charles Wiame , Ken R. Duffy , Muriel Médard

Polar codes have gained significant amount of attention during the past few years and have been selected as a coding scheme for the next generation of mobile broadband standard. Among decoding schemes, successive-cancellation list (SCL)…

Information Theory · Computer Science 2017-08-31 Seyyed Ali Hashemi , Carlo Condo , Warren J. Gross