DeepAI AI Chat
Log In Sign Up

Neural network concatenation for Polar Codes

by   Evgeny Stupachenko, et al.

When a neural network (NN) is used to decode a polar code, its training complexity scales exponentially as the code block size (or to be precise, as a number of message bits) increases. Therefore, existing solutions that use a neural network for polar decoders are stuck with short block sizes like 16 or 32. Despite the fact that the NN training is very complex for long polar codes, the NN decoding gives the better latency and its performance is potentially close to the maximum likelihood (ML). In this paper, we describe an efficient algorithm to create the NN decoding for a polar code of any size with the initial performance that is equal or better than that of successive cancelation (SC). Therefore, it creates an opportunity to design the NN based decoding with the performance that is as close to the ML, as the training time allows.


page 1

page 2

page 3

page 4


Complexity-Adaptive Maximum-Likelihood Decoding of Modified G_N-Coset Codes

A complexity-adaptive tree search algorithm is proposed for G_N-coset co...

5G NR CA-Polar Maximum Likelihood Decoding by GRAND

CA-Polar codes have been selected for all control channel communications...

Automorphism Ensemble Decoding of Reed-Muller Codes

Reed-Muller (RM) codes are known for their good maximum likelihood (ML) ...

For One-Shot Decoding: Self-supervised Deep Learning-Based Polar Decoder

We propose a self-supervised deep learning-based decoding scheme that en...

Approaching the Finite Blocklength Capacity within 0.025dB by Short Polar Codes and CRC-Aided Hybrid Decoding

In this letter, we explore the performance limits of short polar codes a...

Dynamic Frozen-Function Design for Reed-Muller Codes With Automorphism-Based Decoding

In this letter, we propose to add dynamic frozen bits to underlying pola...

Polar Coding with Chemical Reaction Networks

In this paper, we propose a new polar coding scheme with molecular progr...