Fast Partial-Sum Update Method for Successive-Cancellation Decoding of Polar Codes and PAC Codes
IEEE Communications Letters · 2026 · 30 · 1691-1695
DOI: 10.1109/lcomm.2026.3683509 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Communications Letters, 2026. Verfasst von Xun Li und 1 weiteren Autor:innen. Die Arbeit nennt 15 Literaturangaben. Gefördert von: 2024 State Grid Corporation of China Science and Technology Program.
Abstract (Originalsprache)
The decoding complexity of polarization-adjusted convolutional (PAC) codes and Polar codes is significantly affected by the efficiency of partial-sum updates. In this letter, we propose a fast partial-sum update method for the successive-cancellation decoding (SCD) of PAC and Polar codes by exploiting the Pascal-triangle structure of the Polar generator matrix. Simulation results show that the proposed method reduces the number of partial-sum updates compared with conventional SCD, particularly for short code lengths and in the low-rate regime. Compared with representative fast decoding methods, the proposed method also shows a complexity advantage in the low-rate regime.
Förderung
- 2024 State Grid Corporation of China Science and Technology Program
Zitieren
APA
Li, X., & Wu, Y. (2026). Fast Partial-Sum Update Method for Successive-Cancellation Decoding of Polar Codes and PAC Codes. IEEE Communications Letters, 30, 1691-1695. https://doi.org/10.1109/lcomm.2026.3683509
Vancouver
Li X, Wu Y. Fast Partial-Sum Update Method for Successive-Cancellation Decoding of Polar Codes and PAC Codes. IEEE Communications Letters. 2026;30:1691-1695. doi:10.1109/lcomm.2026.3683509
BibTeX
@article{Li2026,
author = {Li, Xun and Wu, Yucheng},
title = {Fast Partial-Sum Update Method for Successive-Cancellation Decoding of Polar Codes and PAC Codes},
journal = {IEEE Communications Letters},
year = {2026},
volume = {30},
pages = {1691--1695},
doi = {10.1109/lcomm.2026.3683509}
}
EUVIMED