Block turbo decoding with ORBGRAND

07/22/2022
by   Kevin Galligan, et al.
0

Guessing Random Additive Noise Decoding (GRAND) is a family of universal decoding algorithms suitable for decoding any moderate redundancy code of any length. We establish that, through the use of list decoding, soft-input variants of GRAND can replace the Chase algorithm as the component decoder in the turbo decoding of product codes. In addition to being able to decode arbitrary product codes, rather than just those with dedicated hard-input component code decoders, results show that ORBGRAND achieves a coding gain of up to 0.7dB over the Chase algorithm with same list size.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/09/2023

Upgrade error detection to prediction with GRAND

Guessing Random Additive Noise Decoding (GRAND) is a family of hard- and...
research
08/27/2019

Successive Cancellation List Decoding of Product Codes with Reed-Muller Component Codes

This letter proposes successive cancellation list (SCL) decoding of prod...
research
12/17/2018

Scalable Block-Wise Product BCH Codes

In this paper we comprehensively investigate block-wise product (BWP) BC...
research
12/10/2022

Confident decoding with GRAND

We establish that during the execution of any Guessing Random Additive N...
research
11/11/2020

List Decoding of Direct Sum Codes

We consider families of codes obtained by "lifting" a base code 𝒞 throug...
research
04/26/2022

Decoding noisy messages: a method that just shouldn't work

This paper is about receiving text messages through a noisy and costly l...
research
03/02/2022

Fast Decoding of AG Codes

We present an efficient list decoding algorithm in the style of Guruswam...

Please sign up or login with your details

Forgot password? Click here to reset