Sparsely Pre-Transformed Polar Codes for Low-Latency SCL Decoding

Deep polar codes, which employ multi-layered polar kernel pre-transforms in series, are recently introduced variants of pre-transformed polar codes. These codes can reduce the number of minimum-weight codewords, thus closely achieving finite-block length capacity with successive cancellation list (SCL) decoders in certain scenarios. However, for low-latency applications requiring small SCL decoder list sizes, reducing minimum-weight codewords doesn’t necessarily improve decoding performance. To address this limitation, we propose an alternative pre-transform technique to enhance the suitability of polar codes for SCL decoders with practical list sizes. Leveraging the fact that the SCL decoding error event set can be decomposed into two exclusive error event sets, our approach applies two different types of pre-transformations, each targeting the reduction of one of the two error event sets. Extensive simulation results across various block lengths and code rates demonstrate that our codes consistently outperform existing state-of-the-art pre-transformed polar codes, including CRC-aided polar codes and polarization-adjusted convolutional codes, when decoded using SCL decoders with small list sizes.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Communications
Published
2025-03-28
DOI
https://doi.org/10.1109/tcomm.2025.3555900
Citations
3
Primary Topic
Algorithms and Data Compression
Type
article
Field-Weighted Citation Impact
7.44
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Sparsely Pre-Transformed Polar Codes for Low-Latency SCL Decoding

Namyoon Lee, Geon Choi
3 citations
IEEE Transactions on Communications
Algorithms and Data Compression
7.44
article

Sparsely Pre-Transformed Polar Codes for Low-Latency SCL Decoding

Namyoon Lee, Geon Choi
article en
3 citations

Abstract

Deep polar codes, which employ multi-layered polar kernel pre-transforms in series, are recently introduced variants of pre-transformed polar codes. These codes can reduce the number of minimum-weight codewords, thus closely achieving finite-block length capacity with successive cancellation list (SCL) decoders in certain scenarios. However, for low-latency applications requiring small SCL decoder list sizes, reducing minimum-weight codewords doesn’t necessarily improve decoding performance. To address this limitation, we propose an alternative pre-transform technique to enhance the suitability of polar codes for SCL decoders with practical list sizes. Leveraging the fact that the SCL decoding error event set can be decomposed into two exclusive error event sets, our approach applies two different types of pre-transformations, each targeting the reduction of one of the two error event sets. Extensive simulation results across various block lengths and code rates demonstrate that our codes consistently outperform existing state-of-the-art pre-transformed polar codes, including CRC-aided polar codes and polarization-adjusted convolutional codes, when decoded using SCL decoders with small list sizes.

IEEE Transactions on CommunicationsVol. 73(9)
Pohang University of Science and Technology (KR), Korea University (KR)
Openalex Percentile: Top 4%
Algorithms and Data Compression
7.44
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.