Deep Q-Learning Based Rate-Profile Design for Polarization Adjusted Convolutional (PAC) Codes

This paper introduces a novel rate-profile design for Polarization-Adjusted Convolutional (PAC) codes by simplifying the construction of an information set (inf set) for a PAC code of length <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$N$</tex> into the design of inf sets for <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$M$</tex> component codes of length <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\frac{N}{M}$</tex>. We define a Markov Decision Process (MDP) that formulates the task of identifying the inf set that minimizes the Block Error Rate (BLER). To achieve this, we employ a Deep QNetwork (DQN) with an experience replay buffer to determine the optimal inf set with the lowest BLER. Simulation results demonstrate that under Successive Cancellation List (SCL) decoding, our designed PAC codes improve BLER compared to state-of-the-art PAC codes. This method is not limited to the design of PAC code inf set; it is applicable to inf set design for the general family of precoded Polar codes and supports any decoder.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/icc52391.2025.11161677
Citations
1
Primary Topic
Advanced Data Compression Techniques
Type
article
Field-Weighted Citation Impact
1.28
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Deep Q-Learning Based Rate-Profile Design for Polarization Adjusted Convolutional (PAC) Codes

Hamid Saber, Jung Hyun Bae, Homayoon Hatami
1 citations
Advanced Data Compression Techniques
1.28
article

Deep Q-Learning Based Rate-Profile Design for Polarization Adjusted Convolutional (PAC) Codes

Hamid Saber, Jung Hyun Bae, Homayoon Hatami
article en
1 citations

Abstract

This paper introduces a novel rate-profile design for Polarization-Adjusted Convolutional (PAC) codes by simplifying the construction of an information set (inf set) for a PAC code of length <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$N$</tex> into the design of inf sets for <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$M$</tex> component codes of length <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\frac{N}{M}$</tex>. We define a Markov Decision Process (MDP) that formulates the task of identifying the inf set that minimizes the Block Error Rate (BLER). To achieve this, we employ a Deep QNetwork (DQN) with an experience replay buffer to determine the optimal inf set with the lowest BLER. Simulation results demonstrate that under Successive Cancellation List (SCL) decoding, our designed PAC codes improve BLER compared to state-of-the-art PAC codes. This method is not limited to the design of PAC code inf set; it is applicable to inf set design for the general family of precoded Polar codes and supports any decoder.

Samsung (South Korea) (KR)
Openalex Percentile: Top 15%
Advanced Data Compression Techniques
1.28
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.