Decoding Polar Codes with Reinforcement Learning
In this paper we address the problem of selecting factor-graph permutations of polar codes under belief propagation (BP) decoding to significantly improve the error-correction performance of the code. In particular, we formalize the factor-graph permutation selection as the multi-armed bandit problem in reinforcement learning and propose a decoder that acts like an online-learning agent that learns to select the good factor-graph permutations during the course of decoding. We use state-of-the-art algorithms for the multi-armed bandit problem and show that for a 5G polar codes of length 128 with 64 information bits, the proposed decoder has an error-correction performance gain of around 0.125 dB at the target frame error rate of 10^{-4}, when compared to the approach that randomly selects the factor-graph permutations.
Code (0)
등록된 구현이 없습니다.
Tasks
Decoderreinforcement-learningReinforcement LearningReinforcement Learning (RL)Similar Papers 제목 키워드 기반
Deep Polar Codes
In this paper, we introduce a novel class of pre-transformed polar codes, termed as deep polar codes. We first present a deep polar encoder that harnesses a series of multi-layered polar transformations with varying size…
Scalable Polar Code Construction for Successive Cancellation List Decoding: A Graph Neural Network-Based Approach
While constructing polar codes for successive-cancellation decoding can be implemented efficiently by sorting the bit-channels, finding optimal polar codes for cyclic-redundancy-check-aided successive-cancellation list (…
Graph Neural NetworkPolar Decoding on Sparse Graphs with Deep Learning
In this paper, we present a sparse neural network decoder (SNND) of polar codes based on belief propagation (BP) and deep learning. At first, the conventional factor graph of polar BP decoding is converted to the biparti…
DecoderDeep LearningSingle Particle AnalysisImproved Automorphism Ensemble Decoder for Polar Codes
In this work, we propose an improved automorphism ensemble (AE) decoder for polar codes. With successive cancellation (SC) variant automorphisms, multiple decoding paths in the AE decoder produce their estimates of the…
DecoderA Modified Q-Learning Algorithm for Rate-Profiling of Polarization Adjusted Convolutional (PAC) Codes
In this paper, we propose a reinforcement learning based algorithm for rate-profile construction of Arikan's Polarization Assisted Convolutional (PAC) codes. This method can be used for any blocklength, rate, list size u…
Q-Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)