Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2512.10223

Improving the decoding performance of CA-polar codes

Jiewei Feng·Peihong Yuan·Ken R. Duffy·Muriel Médard
View original source ↗Read source document ↗Export metadata ↓

Abstract

We investigate the use of modern code-agnostic decoders to convert CA-SCL from an incomplete decoder to a complete one. When CA-SCL fails to identify a codeword that passes the CRC check, we apply a code-agnostic decoder that identifies a codeword that satisfies the CRC. We establish that this approach gives gains of up to 0.2 dB in block error rate for CA-polar codes from the 5G New Radio standard. If, instead, the message had been encoded in a systematic CA-polar code, the gain improves to more than 1.5 dB. Leveraging recent developments in blockwise soft output, we additionally establish that it is possible to control the undetected error rate even when using the CRC for error correction.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

BibTeXRIS

Jiewei Feng, Peihong Yuan, Ken R. Duffy, Muriel Médard. 2026-08-30. Improving the decoding performance of CA-polar codes. https://doi.org/10.1109/lcomm.2026.3727183

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.IT subjecteess.SP subjectmath.IT subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

A simple derivation of the Kalman filter

In this lecture note, we present a concise and self-contained derivation of the discrete-time Kalman filter equations that requires only a basic understanding of least squares estimation. The treatment is designed to minimize mathematical overhead while preserving both rigor and generality.

math.OC↗
arXiv2026

Constrained Parameter Update Law for Adaptive Control

In this paper, constrained parameter update laws for adaptive control are developed using barrier constraints. An interpretation of the parameter update law from a constrained optimization problem, in which a regularized Barrier saddle function is formulated to incorporate parameter constraints using inverse and logarithmic barrier functions from interior-point methods. The resulting constrained update law is integrated with an adaptive trajectory tracking controller, enabling online learning of the unknown system model parameters. Forward invariance of the parameter estimate is established and Lyapunov stability of the closed-loop system with the constrained parameter update law is derived. The effectiveness of the proposed constrained adaptive control law is demonstrated through simulations, which validate its ability to maintain parameter estimates within prescribed bounds while ensuring convergence to the true parameter values and achieving steady state tracking performance.

math.OC↗
arXiv2026

32-point DFT Approximations Based on Minimal Frobenius Error and DFT Symmetries

This work introduces low-complexity, multiplierless approximations for the 32-point discrete Fourier transform. The proposed methods are obtained by minimizing the Frobenius error compared against the DFT matrix over a set of trivial multipliers. A row-wise, symmetry-constrained parameterization is employed to reduce the search space size, rendering the task computationally tractable. The resulting approximations could outperform the reference method in the literature according to energy-based error measurements. A sparse matrix factorization is provided for efficient computation; the arithmetic costs are 152 real additions and 34 bit-shifts only.

eess.SP↗