The reviewed record of science sign in
Pith

arxiv: 2207.11149 · v2 · pith:5BS36MZ7 · submitted 2022-07-22 · cs.IT · math.IT

Block turbo decoding with ORBGRAND

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:5BS36MZ7record.jsonopen to challenge →

classification cs.IT math.IT
keywords decodingalgorithmchasecodecodescomponentgrandlist
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.