.png){kind=icon}
.png){kind=icon}
Return
On Systematic Polarization-Adjusted Convolutional (PAC) Codes
.png){kind=icon}
OA
AI
DOI：10.1109/LCOMM.2021.3069668.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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).
Keywords:
Convolutional codes
Picture archiving and communication systems
Systematics
Polar codes
Transforms
Measurement
Maximum likelihood decoding
PAC
polar codes
convolutional codes
systematic codes
finite blocklength regime
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.