Classification of Automorphisms for the Decoding of Polar Codes

10/27/2021
by   Charles Pillet, et al.
0

This paper proposes new polar code design principles for the low-latency automorphism ensemble (AE) decoding. Our proposal permits to design a polar code with the desired automorphism group (if possible) while assuring the decreasing monomial property. Moreover, we prove that some automorphisms are redundant under AE decoding, and we propose a new automorphisms classification based on equivalence classes. Finally, we propose an automorphism selection heuristic based on drawing only one element of each class; we show that this method enhances the block error rate (BLER) performance of short polar codes even with a limited number of automorphisms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/16/2021

Polar Codes for Automorphism Ensemble Decoding

In this paper we deal with polar code automorphisms that are beneficial ...
research
08/02/2019

Interleaved Polar (I-Polar) Codes

By inserting interleavers between intermediate stages of the polar encod...
research
04/24/2023

Fast Methods for Ranking Synthetic BECs

We gather existing methods that are used to compare and rank the BECs sy...
research
06/07/2022

Group Properties of Polar Codes for Automorphism Ensemble Decoding

In this paper, we propose an analysis of the automorphism group of polar...
research
11/29/2016

An Efficient Partial Sums Generator for Constituent Code based Successive Cancellation Decoding of Polar Codes

This paper proposes the architecture of partial sum generator for consti...
research
01/24/2021

On the Automorphism Group of Polar Codes

The automorphism group of a code is the set of permutations of the codew...
research
07/02/2018

On the Tradeoff Between Accuracy and Complexity in Blind Detection of Polar Codes

Polar codes are a recent family of error-correcting codes with a number ...

Please sign up or login with your details

Forgot password? Click here to reset