.png){kind=icon}
.png){kind=icon}
Return
Construction-Free Polar Coding For Practical Entropy Coding Tasks
.png){kind=icon}
OA
AI
DOI：10.1049/cmu2.70130.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper explores the practical application of source polar codes to entropy coding tasks in modern transform coding pipelines. Transform coding remains the predominant and rapidly evolving framework for compressing complex real-world data. Despite the strong theoretical guarantees of polar codes, conventional polarization-based compression techniques follow a construct-then-use paradigm, which proves inefficient and inaccurate when applied to transform coding scenarios characterized by highly dynamic entropy models. To overcome this limitation, we propose a construction-free, plug-and-play polar compression scheme. Rather than relying on precomputed polarized entropies, our method selects output symbols based on probability vectors generated by a conditional entropy model. These vectors can be computed with low complexity and exact numerical precision, enabling efficient adaptation across diverse entropy coding tasks. The proposed approach offers greater flexibility than classical methods and achieves superior performance in the finite-length regime.
Keywords:
data compression
entropy coding
polar codes
successive cancellation
transform coding
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.