Input-distribution-aware parallel decoding of block codes

05/13/2021
by   Carlo Condo, et al.
0

Many channel decoders rely on parallel decoding attempts to achieve good performance with acceptable latency. However, most of the time fewer attempts than the foreseen maximum are sufficient for successful decoding. Input-distribution-aware (IDA) decoding allows to determine the parallelism of polar code list decoders by observing the distribution of channel information. In this work, IDA decoding is proven to be effective with different codes and decoding algorithms as well. Two techniques, M-IDA and MD-IDA, are proposed: they exploit the sampling of the input distribution inherent to particular decoding algorithms to perform low-cost IDA decoding. Simulation results on the decoding of BCH codes via the Chase and ORBGRAND algorithms show that they perform at least as well as the original IDA decoding, allowing to reduce run-time complexity down to 17 degradation.

READ FULL TEXT

page 2

page 3

research
10/27/2020

Minimum-effort successive cancellation list decoding of polar codes

Polar codes are linear block codes that can achieve channel capacity at ...
research
01/21/2021

Successive-Cancellation Decoding of Binary Polar Codes Based on Symmetric Parametrization

This paper introduces algorithms for the successive-cancellation decodin...
research
12/24/2020

Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes

This paper characterizes the latency of the simplified successive-cancel...
research
01/26/2019

A Two-staged Adaptive Successive Cancellation List Decoding for Polar Codes

Polar codes achieve outstanding error correction performance when using ...
research
09/11/2019

Sublinear Latency for Simplified Successive Cancellation Decoding of Polar Codes

In this work we analyze the latency of the simplified successive cancell...
research
02/04/2019

Recursive projection-aggregation decoding of Reed-Muller codes

We propose a new class of efficient decoding algorithms for Reed-Muller ...
research
12/20/2022

Efficient Algorithms for the Bee-Identification Problem

The bee-identification problem, formally defined by Tandon, Tan and Vars...

Please sign up or login with your details

Forgot password? Click here to reset