DeepAI AI Chat
Log In Sign Up

On Systematic Polarization-Adjusted Convolutional (PAC) Codes

by   Thibaud Tonnellier, et al.

Polarization-adjusted convolutional (PAC) codes were recently proposed and arouse the interest of the channel coding community because they were shown to approach theoretical bounds for the (128,64) code size. In this letter, we propose systematic PAC codes. Thanks to the systematic property, improvement in the bit-error rate of up to 0.2 dB is observed, while preserving the frame-error rate performance. Moreover, a genetic-algorithm based construction method targeted to approach the theoretical bound is provided. It is then shown that using the proposed construction method systematic and non-systematic PAC codes can approach the theoretical bound even for higher code sizes such as (256,128).


page 1

page 2

page 3

page 4


Concatenated Reed-Solomon and Polarization-Adjusted Convolutional (PAC) Codes

Two concatenated coding schemes incorporating algebraic Reed-Solomon (RS...

Upper and Lower Bounds on Bit-Error Rate for Convolutional Codes

In this paper, we provide a new approach to the analytical estimation of...

A Monte-Carlo Based Construction of Polarization-Adjusted Convolutional (PAC) Codes

This paper proposes a rate-profile construction method for polarization-...

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

In this paper, we propose a reinforcement learning based algorithm for r...

Application of Guessing to Sequential Decoding of Polarization-Adjusted Convolutional (PAC) Codes

Despite the extreme error-correction performance, the amount of computat...

CRC-Aided Short Convolutional Codes and RCU Bounds for Orthogonal Signaling

We extend earlier work on the design of convolutional code-specific CRC ...

Error-rate in Viterbi decoding of a duobinary signal in presence of noise and distortions: theory and simulation

The Viterbi algorithm, presented in 1967, allows a maximum likelihood de...