A Modified Q-Learning Algorithm for Rate-Profiling of Polarization Adjusted Convolutional (PAC) Codes

  title={A Modified Q-Learning Algorithm for Rate-Profiling of Polarization Adjusted Convolutional (PAC) Codes},
  author={Samir Kumar Mishra and Digvijay Katyal and Sarvesha Anegundi Ganapathi},
  journal={2022 IEEE Wireless Communications and Networking Conference (WCNC)},
In this paper, we propose a reinforcement learning based algorithm for rate-profile construction of Arikan’s Polarization Adjusted Convolutional (PAC) codes. This method can be used for any blocklength, rate, list size under successive cancellation list (SCL) decoding and convolutional precoding polynomial. To the best of our knowledge, we present, for the first time, a set of new reward and update strategies which help the reinforcement learning agent discover much better rate-profiles than… 

Figures and Tables from this paper

Application of Guessing to Sequential Decoding of Polarization-Adjusted Convolutional (PAC) Codes
It is proved that the computational cutoff rate in sequential decoding of pre-transformed polar codes polarizes and the error-correction performance of the PAC codes can achieve the theoretical bounds using the tamed Reed-Muller rate-profile construction.
Approximate Weight Distribution of Polarization-Adjusted Convolutional (PAC) Codes
This paper develops a method of computing the weight distribution of PAC codes in an approximate form by employing a probabilistic technique and demonstrates that the results well match the exact weight distributions for small codes that can be computed using a brute-force algorithm.


A Monte-Carlo Based Construction of Polarization-Adjusted Convolutional (PAC) Codes
The proposed rate-profile construction method can improve the error-correction performance of PAC codes while guaranteeing a low mean sequential decoding complexity for signal-to-noise ratio (SNR) values beyond a target SNR value.
List Decoding of Arıkan’s PAC Codes
The main goals in this paper are to answer the following question: is sequential decoding essential for the superior performance of PAC codes and to suggest that the goal of rate-profiling may be to optimize the weight distribution at low weights.
Construction of Polar Codes with Reinforcement Learning
This paper formulates the polar-code construction problem for the successive-cancellation list (SCL) decoder as a maze-traversing game, which can be solved by reinforcement learning techniques and provides a novel technique that no longer depends on sorting and selecting bit-channels by reliability.
List decoding of polar codes
  • I. TalA. Vardy
  • Computer Science
    2011 IEEE International Symposium on Information Theory Proceedings
  • 2011
It appears that the proposed list decoder bridges the gap between successive-cancellation and maximum-likelihood decoding of polar codes, and devise an efficient, numerically stable, implementation taking only O(L · n log n) time and O( L · n) space.
Selectively Precoded Polar Codes
Simulation results show that for a target frame erasure rate (FER) of $10^{-5}$, a (128, 64) SPP code is just 0.23 dB away from the information theoretic limit at this blocklength.
Efficient Error-Correcting Codes in the Short Blocklength Regime
From sequential decoding to channel polarization and back again
An account of the original ideas that motivated the development of polar coding is given and some new ideas for exploiting channel polarization more effectively in order to improve the performance of polar codes are discussed.
Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
  • E. Arıkan
  • Computer Science
    IEEE Transactions on Information Theory
  • 2009
The paper proves that, given any B-DMC W with I(W) > 0 and any target rate R< I( W) there exists a sequence of polar codes {Cfrn;nges1} such that Cfrn has block-length N=2n, rate ges R, and probability of block error under successive cancellation decoding bounded as Pe(N,R) les O(N-1/4) independently of the code rate.
NR; Multiplexing and channel coding
  • 3rd Generation Partnership Project (3GPP), Technical Specification (TS) 38.212, 01 2018, version 15.0.0. [Online]. Available: http://www.3gpp.org/\protect\discretionary{\char\hyphenchar\font}{}{}DynaReport/\protect\discretionary{\char\hyphenchar\font}{}{}38212.htm
  • 2018
Polarization-adjusted Convolutional (PAC) Codes: Fano Decoding vs List Decoding
An adaptive heuristic metric, tree search constraints for backtracking to avoid exploration of unlikely sub-paths, and tree search strategies consistent with the pattern of error occurrence in polar codes are proposed in order to reduce the complexity of sequential decoding of PAC/polar codes.