Beyond 1$\to$N Decoding: Capacity-Aware Rateless Polar Codes for IR-HARQ

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Zhang, Huazi, Wang, Xianbin, Tong, Jiajie, Wang, Jun, Tong, Wen
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866914615888183296
author Zhang, Huazi
Wang, Xianbin
Tong, Jiajie
Wang, Jun
Tong, Wen
author_facet Zhang, Huazi
Wang, Xianbin
Tong, Jiajie
Wang, Jun
Tong, Wen
contents This paper introduces a novel framework for polar codes, designed for flexible Incremental Redundancy Hybrid Automatic Repeat Request (IR-HARQ). By generalizing the decoding order beyond the standard 1$\to$N sequence, we enable a capacity-aware scheduling strategy that prioritizes the decoding of reliable subblocks. The framework integrates nested parity-check polar construction and reverse bit-mapping to support continuous and arbitrary transmission lengths $E \in [N_{\min}, N_{\max}]$. Simulation results show that the proposed rateless codes match the coding gain of independently optimized fixed-rate codes across the entire range of rates and lengths. With a validated hardware implementation, this work provides a practical solution for next-generation wireless data channels.
format Preprint
id arxiv_https___arxiv_org_abs_2605_30885
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Beyond 1$\to$N Decoding: Capacity-Aware Rateless Polar Codes for IR-HARQ
Zhang, Huazi
Wang, Xianbin
Tong, Jiajie
Wang, Jun
Tong, Wen
Information Theory
Networking and Internet Architecture
This paper introduces a novel framework for polar codes, designed for flexible Incremental Redundancy Hybrid Automatic Repeat Request (IR-HARQ). By generalizing the decoding order beyond the standard 1$\to$N sequence, we enable a capacity-aware scheduling strategy that prioritizes the decoding of reliable subblocks. The framework integrates nested parity-check polar construction and reverse bit-mapping to support continuous and arbitrary transmission lengths $E \in [N_{\min}, N_{\max}]$. Simulation results show that the proposed rateless codes match the coding gain of independently optimized fixed-rate codes across the entire range of rates and lengths. With a validated hardware implementation, this work provides a practical solution for next-generation wireless data channels.
title Beyond 1$\to$N Decoding: Capacity-Aware Rateless Polar Codes for IR-HARQ
topic Information Theory
Networking and Internet Architecture
url https://arxiv.org/abs/2605.30885