Segmented GRAND: Combining Sub-patterns in Near-ML Order

05/24/2023
by   Mohammad Rowshan, et al.
0

The recently introduced maximum-likelihood (ML) decoding scheme called guessing random additive noise decoding (GRAND) has demonstrated a remarkably low time complexity in high signal-to-noise ratio (SNR) regimes. However, the complexity is not as low at low SNR regimes and low code rates. To mitigate this concern, we propose a scheme for a near-ML variant of GRAND called ordered reliability bits GRAND (or ORBGRAND), which divides codewords into segments based on the properties of the underlying code, generates sub-patterns for each segment consistent with the syndrome (thus reducing the number of inconsistent error patterns generated), and combines them in a near-ML order using two-level integer partitions of logistic weight. The numerical evaluation demonstrates that the proposed scheme, called segmented ORBGRAND, significantly reduces the average number of queries at any SNR regime. Moreover, the segmented ORBGRAND with abandonment also improves the error correction performance.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/24/2022

Constrained Error Pattern Generation for GRAND

Maximum-likelihood (ML) decoding can be used to obtain the optimal perfo...
research
05/15/2021

High-Throughput VLSI architecture for Soft-Decision decoding with ORBGRAND

Guessing Random Additive Noise Decoding (GRAND) is a recently proposed a...
research
07/26/2019

Neural Dynamic Successive Cancellation Flip Decoding of Polar Codes

Dynamic successive cancellation flip (DSCF) decoding of polar codes is a...
research
12/20/2021

Successive Cancellation Ordered Search Decoding of Modified _N-Coset Codes

A tree search algorithm called successive cancellation ordered search (S...
research
02/20/2018

Capacity-achieving decoding by guessing noise

We introduce a new algorithm for realizing Maximum Likelihood (ML) decod...
research
03/07/2019

A Scalable Max-Consensus Protocol For Noisy Ultra-Dense Networks

We introduce ScalableMax, a novel communication scheme for achieving max...
research
11/29/2019

Lossless Size Reduction for Integer Least Squares with Application to Sphere Decoding

Minimum achievable complexity (MAC) for a maximum likelihood (ML) perfor...

Please sign up or login with your details

Forgot password? Click here to reset