Chained Successive Cancellation Decoding of the Extended Golay code

01/19/2018
by   Peter Trifonov, et al.
0

The extended Golay code is shown to be representable as a chained polar subcode. This enables its decoding with the successive cancellation algorithm and its stack generalization. The decoder can be further simplified by employing fast Hadamard transform. The complexity of the obtained algorithm is comparable with that of the Vardy algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/10/2018

Towards Practical Software Stack Decoding of Polar Codes

The successive cancellation list decoding algorithm for polar codes yiel...
research
03/28/2019

Successive-Cancellation Decoding of Linear Source Code

This paper investigates the error probability of several decoding method...
research
12/15/2020

Performance and Complexity of the Sequential Successive Cancellation Decoding Algorithm

Simulation results illustrating the performance and complexity of the se...
research
04/02/2018

Algebraic matching techniques for fast decoding of polar codes with Reed-Solomon kernel

We propose to reduce the decoding complexity of polar codes with non-Ari...
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
07/03/2022

Scalable Polar Code Construction for Successive Cancellation List Decoding: A Graph Neural Network-Based Approach

While constructing polar codes for successive-cancellation decoding can ...
research
07/21/2020

Implementation of a High-Throughput Fast-SSC Polar Decoder with Sequence Repetition Node

Even though polar codes were adopted in the latest 5G cellular standard,...

Please sign up or login with your details

Forgot password? Click here to reset