Enabling Fast Polar SC Decoding with IR-HARQ

Jiajie Li; Marwan Jalaleddine; Mohamad Ali Jarkas; Warren J. Gross

REVIEW 2 major objections 6 minor 1 cited by

IR-HARQ polar codes can reuse fast SC special-node decoding without performance loss.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Modified special-node SC decoding for polar IR-HARQ achieves the same node-traversal count as non-HARQ decoding, cutting traversals by 72% with no FER penalty.

T0 review reviewed 2026-08-03 challenge →

load-bearing objection A clean, useful extension of fast SC special-node decoding to IR-HARQ with PC-frozen bits; the derivations check out, and the main gap is an unstated placement assumption that should be fixed in revision. the 2 major comments →

arxiv 2512.04418 v2 pith:XJVYATXW submitted 2025-12-04 eess.SP

Enabling Fast Polar SC Decoding with IR-HARQ

Marwan Jalaleddine , Mohamad Ali Jarkas , Jiajie Li , Warren J. Gross This is my paper

classification eess.SP

keywords polar codesSC decodingIR-HARQspecial nodesPC-frozen bitsmatrix extensionnode traversals6G

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper seeks to close the gap between two otherwise attractive features of polar codes: incremental-redundancy HARQ and fast successive-cancellation decoding. Incremental redundancy introduces PC-frozen bits whose values are not fixed to zero, which breaks the assumptions of the special-node shortcuts used to speed up SC decoding. The paper proposes small modifications to each special-node decoder—repetition, single-parity-check, and their variants—that account for the known encoded PC-frozen pattern. With these changes, an IR-HARQ SC decoder at length 2048 visits 72% fewer nodes and shows no frame-error-rate degradation against baselines. The implication is that high-throughput polar decoders can offer HARQ retransmission capability without sacrificing the complexity savings of special nodes.

Core claim

The central claim is that the encoded PC-frozen vector pc, whose components give the binary values of parity-check frozen bits after polar encoding, is known at decode time, so every special node can be decoded against a known nonzero frozen-bit pattern. Under the identity β = i ⊕ pc, the usual repetition and parity-check decisions are replaced by modified ones—for example, a repeated bit is decided by the sign of Σ l_j(1−2pc_j), and a single-parity-check node flips its least reliable bit when (XOR of hard decisions) ⊕ pc_0 ≠ 0. Applying these rules to the RPC and PCR nodes likewise reduces to initializing the parity accumulators with the pc pattern. The paper reports that, with a length-204

What carries the argument

The load-bearing object is the encoded PC-frozen vector pc: the binary vector produced by passing the parity-check frozen bits through the polar transform. Because the polar codeword splits as β = i ⊕ pc between the encoded information vector and the encoded PC-frozen vector, the pc pattern tells the decoder which 'frozen' positions carry known nonzero values. Each modified node decoder performs a change of variables on its parity or repetition accumulator so that the known pc contribution is absorbed before applying the standard fast-decode rule. That single adjustment is what lets the whole library of scalar, repetition, and parity-check special nodes operate under IR-HARQ.

Load-bearing premise

The decoder must already know the value of every PC-frozen bit inside a special node when that node is processed, which requires that the corresponding information bits appear earlier in the SC decoding order.

What would settle it

Construct a matrix-extension IR-HARQ polar code of length 2048 in which a PC-frozen bit's source information bit is scheduled later in SC order than the special node containing that PC-frozen bit; run the modified decoder and show it either needs pc before it is known or produces a different node decision than full SC. Alternatively, simulate FER for several rates/lengths beyond 2048 and observe a gap between the modified-node decoder and unmodified leaf-wise IR-HARQ decoding.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

If this is right

An IR-HARQ SC decoder can match the node-traversal count—and thus the latency—of a plain fast SC decoder at the same total block length.
Retransmission-based reliability can be offered to very high-throughput polar decoders (e.g., 6G data channels) without giving up special-node acceleration.
The 72% traversal reduction reported at length 2048 scales the per-transmission decoding effort down to roughly one third of the unmodified IR-HARQ scheme.
The modified node rules preserve FER, so the coding gain promised by matrix-extension IR-HARQ is not traded away for speed.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The change-of-variable trick is generic: any new special-node family added to the fast-decoder library can likely absorb pc in the same way, by XOR-ing the PC-frozen pattern into its parity constants.
The method's practical reach depends on the IR-HARQ bit ordering; if a future polar code design places a PC-frozen bit before its source information bit in SC order, the modified node cannot be used at that position and the decoder would need a fallback.
A similar pc-aware adjustment could be applied to other low-complexity polar decoders (e.g., simplified SC with early termination) to support IR-HARQ without full subtree traversal.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Desk Editor's Note

A clean, useful extension of fast SC special-node decoding to IR-HARQ with PC-frozen bits; the derivations check out, and the main gap is an unstated placement assumption that should be fixed in revision.

read the letter

Short version: this is a competent, incremental extension of fast SC decoding to polar IR-HARQ. The genuinely new piece is the REP path-metric derivation (Eqs. 4–11), which is correct and easy to verify; the SPC, SPC-2, RPC, and PCR modifications are the same change-of-variables trick in different clothing. The 72% traversal reduction is just a count from Table I and it matches the baseline comparison. The paper deserves a referee.

What is new: previous special-node work assumed zero-valued frozen bits. Here the authors adapt the full special-node family to the PC-frozen setting from [6] and correctly distinguish their SC approach from the SCL candidate-generation method in their own [8]. That distinction is not hand-waving; the complexity arguments are sensible.

The weak spots, in proportion. First, the PC-frozen timing assumption. Section II.D says the new info bit is "first estimated" and then the PC-frozen bit is fixed, which implies the source precedes the PC-frozen bit in SC order. But the paper never proves, or even states, that this placement holds for every special node—that a PC-frozen bit's mapped info bit never lies inside the same special node or to its right. Without that, the modified REP/SPC formulas use inputs that may not be available when the node is processed. I suspect the construction in [6] guarantees this by design, and it may be obvious to people who work on this family, but the authors should say so explicitly and cite or give a one-line proof. This is a missing paragraph, not a missing argument.

Second, there are no simulation parameters: no code construction tables, no trials, no details on the AWGN setup, no LLR quantization. For a conference paper this is common, but it makes the "no FER degradation" claim harder to verify. Third, the 72% figure is for one length-2048 configuration; it is a scheduling result, not a general bound.

Who this is for: hardware-oriented polar code researchers, especially anyone building SC decoders with IR-HARQ for 6G. General coding theorists will not be surprised, but it is a solid contribution to the fast-decoding subfield.

Bottom line: the math is sound, the claim is modest, and the gap is fixable in a short revision. Send it to peer review.

Referee Report

2 major / 6 minor

Summary. The paper proposes modifications to SC special-node decoding (Rate-0/1, REP, REP-2, SPC, SPC-2, RPC, PCR) so that polar IR-HARQ with matrix extension can be decoded with fast SC decoding, despite the presence of PC-frozen bits with arbitrary values. It derives modified path-metric and parity-check rules, reports a 72% reduction in node traversals for a length-2048 IR-HARQ code compared to the unmodified special-node decoder, and presents FER curves claiming no performance degradation.

Significance. If the central assumption holds, this is a useful and timely contribution: it extends the latency benefits of special-node SC decoding to polar IR-HARQ, which is relevant for 6G data-channel decoding. The derivations are transparent and the REP proof is a clean maximum-likelihood argument. The paper does not resort to fitting: the traversal reduction is a direct count from Table I, and the FER simulation is a direct comparison. The main risk is that the modified decoders assume the encoded PC-frozen vector is available at node-processing time, a property that is neither proven nor explicitly verified.

major comments (2)

[Section III, Eqs. (4), (16), (23), Section III.G] All modified special-node decoders require the encoded PC-frozen vector pc of the node to be known when the node is processed. Section II.D states only that 'the new information bit is first estimated, after which the corresponding PCFrozen bit is fixed.' That statement is insufficient for special-node decoding: SC treats a node as an atomic block, so if a PC-frozen bit and its mapped new information bit lie in the same special node, pc is not available at node level. For example, in the REP rule Eq. (4), a term with pc_j equal to the repeated bit being decoded would make the decision circular. The manuscript must prove from the matrix-extension construction of [6], or state and empirically verify, that every PC-frozen bit in every detected special node has its source information bit strictly left of that node. Without this, the 72% traversal claim and the FER-equivalence claim are condi
[Section IV, Fig. 1] The FER simulation is not reproducible: no simulation parameters are reported (reliability ordering/construction metric, CRC polynomial, number of simulated blocks, Eb/N0 grid, channel model, bit-reversal usage). The claim that the proposed modifications cause 'no degradation' is central, but without these details it cannot be assessed. Please report the parameters and check bit-level equivalence between the modified node decoders and full SC decoding for random PC-frozen assignments. Also clarify how Configuration B is decoded with unmodified nodes when PC-frozen bits are nonzero: those nodes assume frozen bits are zero, so the comparison may be unfair unless the PC-frozen bits are all zero in that configuration.

minor comments (6)

[Abstract] Typo: 'a72%' should be 'a 72%'.
[Section II.D] The term 'PCFrozen' is used without defining the acronym at first use; define it explicitly and consider using consistent spacing (PC-Frozen or PCFrozen).
[Section III.C] Use 'Hence' instead of 'Henceforth' in the REP-2 paragraph.
[Section III.G] The PCR modification is described in prose; presenting the changed line of Algorithm 2 in pseudocode would improve clarity.
[Table I] The 72% reduction is for one code length and one construction. The node-type distribution, and hence the reduction ratio, depends on rate and reliability ordering. State the scope of this result.
[Section II.C.7] In the RPC definition, the parity equations in (2a) are redundant; consider simplifying to the minimal set, as is later used in Section III.F.

Circularity Check

0 steps flagged

No circularity: special-node modifications are explicit algebraic derivations; traversal and FER results are computed/simulated, not fitted.

full rationale

The derivation chain is self-contained. The REP modification is proven from ML path metrics (Eqs. 4-11), the SPC rule from a parity redefinition (Eq. 16), the RPC rule by explicit change of variables (Eqs. 21-23), and the PCR rule by a sign-flip on pc. These derivations do not fit parameters to the paper's outputs. The 72% traversal reduction is the arithmetic difference between counted node types in Table I (330 vs 93), not a fitted quantity. The FER comparison in Fig. 1 is a simulation verification against baselines, not an estimate of fitted values. The self-citations to [8] concern the linear identity beta = i XOR pc and the bit-type generation method; that identity is a direct consequence of polar encoding linearity plus the IR-HARQ construction in Section II.D, so it is not load-bearing in a circular sense. The skeptic's unproven timing assumption (that every PC-frozen bit's mapped info bit is decoded earlier, so pc is available when a special node is processed) is a genuine correctness/robustness concern about the external mapping of [6], not a circular reduction: the paper's equations do not define their inputs in terms of their outputs. No circular step can be exhibited, so the appropriate score is 0.

Axiom & Free-Parameter Ledger

0 free parameters · 5 axioms · 0 invented entities

The paper introduces no new free parameters or entities. It depends on standard polar coding background, on the correctness of prior special-node algorithms, and on two assumptions inherited from [6,8]: the availability of PC-frozen values at the right time and the validity of the bit-type generation method for SC. The latter two are domain assumptions that are not proven here.

axioms (5)

standard math Polar codes and SC decoding follow the standard Arikan formulation, with reliability-based frozen and information bit selection.
Section II-B defines the polar decoding tree and SC procedure; this is well-established background.
standard math The special-node decoding algorithms for R0, R1, REP, SPC, SPC-2, REP-2, RPC, PCR from [9,10] are correct for zero-valued frozen bits.
Section II-C summarizes these algorithms and the paper uses them as the unmodified baseline.
domain assumption IR-HARQ by matrix extension [6] creates PC-frozen bits whose values equal corresponding newly added information bits, and these values are known in SC order when needed.
Section II-D introduces PC-frozen bits; Section III implicitly assumes pc is available at each node, but the ordering property is not proven.
domain assumption The binary vector-based bit-type generation method of [8] correctly identifies special nodes in the presence of PC-frozen bits and is applicable to SC decoding.
Sections I and III rely on [8] for the set-based bit operation framework, but the paper does not validate this for SC.
domain assumption The FER simulation under AWGN with QPSK and a 24-bit CRC is a faithful performance comparison; no error bars or confidence intervals are provided.
Section IV reports FER curves without statistical detail; this is standard in coding papers but is still an unstated assumption.

reviewed 2026-08-03 · how reviews work

0 comments

Cite this review

Pith. "Pith review of Enabling Fast Polar SC Decoding with IR-HARQ." pith.science (2026). https://pith.science/paper/XJVYATXW

@misc{pith2026251204418,
  author       = {Pith},
  title        = {Pith review of: Enabling Fast Polar SC Decoding with IR-HARQ},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/XJVYATXW}},
  note         = {Machine review of arXiv:2512.04418}
}

Share X Bluesky LinkedIn Reddit HN

read the original abstract

To extend the applications of polar codes within next-generation wireless communication systems, it is essential to incorporate support for Incremental Redundancy (IR) Hybrid Automatic Repeat Request (HARQ) schemes. For very high-throughput applications, Successive Cancellation (SC) decoding is particularly appealing for polar codes owing to its high area efficiency. In this paper, we propose modifications to SC decoders that employ special nodes to accelerate decoding. Our modifications enable the use of polar IR-HARQ with SC decoding for high throughput applications. Compared to the unmodified SC IR-HARQ scheme, our proposed approach allows us to achieve a 72% reduction in node traversals with a polar code of length 2048. Simulation results confirm that the proposed special node modifications do not cause any degradation in FER performance.

Figures

Figures reproduced from arXiv: 2512.04418 by Jiajie Li, Marwan Jalaleddine, Mohamad Ali Jarkas, Warren J. Gross.

discussion (0)

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

Beyond 1$\to$N Decoding: Capacity-Aware Rateless Polar Codes for IR-HARQ
cs.IT 2026-05 unverdicted novelty 6.0

Introduces capacity-aware rateless polar codes with generalized decoding order, nested parity-check construction, and reverse bit-mapping that match fixed-rate coding gain for continuous lengths in IR-HARQ.

Reference graph

Works this paper leans on

12 extracted references · cited by 1 Pith paper

[1]

Channel Polarization: A Method for Constructing Capacity- Achieving Codes for Symmetric Binary-Input Memoryless Channels,

E. Arikan, “Channel Polarization: A Method for Constructing Capacity- Achieving Codes for Symmetric Binary-Input Memoryless Channels,” IEEE Trans. Inf. Theory, vol. 55, pp. 3051–3073, July 2009

2009
[2]

NR Multiplexing and channel coding,

3GPP, “NR Multiplexing and channel coding,” Technical Specification (TS) 3GPP.38.212, 3rd Generation Partnership Project, Nov. 2021

2021
[3]

Channel coding for 6GR air interface,

Huawei and HiSilicon, “Channel coding for 6GR air interface,” Discus- sion and Decision R1-2505185, 3GPP, 08 2025

2025
[4]

Coding performance of hybrid ARQ schemes,

J.-F. Cheng, “Coding performance of hybrid ARQ schemes,”IEEE Trans. Commun., vol. 54, pp. 1017–1029, June 2006

2006
[5]

Polar coded HARQ scheme with Chase combining,

K. Chen, K. Niu, Z. He, and J. Lin, “Polar coded HARQ scheme with Chase combining,” inIEEE Wireless Commun. and Netw. Conf., pp. 474–479, Apr. 2014

2014
[6]

An Adaptive IR-HARQ Scheme for Polar Codes by Polarizing Matrix Extension,

M.-M. Zhao, G. Zhang, C. Xu, H. Zhang, R. Li, and J. Wang, “An Adaptive IR-HARQ Scheme for Polar Codes by Polarizing Matrix Extension,”IEEE Commun. Lett., vol. 22, pp. 1306–1309, July 2018

2018
[7]

Capacity-achieving rateless polar codes,

B. Li, D. Tse, K. Chen, and H. Shen, “Capacity-achieving rateless polar codes,” inIEEE International Symposium Inf. Theory, pp. 46–50, July 2016

2016
[8]

Hardware-friendly IR-HARQ for polar SCL decoders,

M. Jalaleddine, J. Li, and W. J. Gross, “Hardware-friendly IR-HARQ for polar SCL decoders,” inIEEE International Conf. on Commun., pp. 2008–2013, 2025. ISSN: 1938-1883

2008
[9]

Fast polar codes for terabits-per-second throughput communications,

J. Tong, X. Wang, Q. Zhang, H. Zhang, J. Wang, and W. Tong, “Fast polar codes for terabits-per-second throughput communications,” inIEEE International Symposium on Personal, Indoor and Mobile Radio Commun., pp. 1–6, 2023

2023
[10]

Fast polar decoders: Algorithm and implementation,

G. Sarkis, P. Giard, A. Vardy, C. Thibeault, and W. J. Gross, “Fast polar decoders: Algorithm and implementation,”IEEE Journal on Selected Areas in Commun.s, vol. 32, no. 5, pp. 946–957, 2014

2014
[11]

A simplified successive- cancellation decoder for polar codes,

A. Alamdar-Yazdi and F. R. Kschischang, “A simplified successive- cancellation decoder for polar codes,”IEEE Commun. Lett., vol. 15, no. 12, pp. 1378–1380, 2011

2011
[12]

Adjustable ordered statistic decoder for short block length code towards urllc,

F. Wang, J. Jiao, K. Zhang, S. Wu, and Q. Zhang, “Adjustable ordered statistic decoder for short block length code towards urllc,” inInter- national Conf. on Wireless Commun. and Signal Processing, pp. 1–5, 2021

2021

This paper was first reviewed by deepseek-v4-flash on August 3, 2026.

[1] [1]

Channel Polarization: A Method for Constructing Capacity- Achieving Codes for Symmetric Binary-Input Memoryless Channels,

E. Arikan, “Channel Polarization: A Method for Constructing Capacity- Achieving Codes for Symmetric Binary-Input Memoryless Channels,” IEEE Trans. Inf. Theory, vol. 55, pp. 3051–3073, July 2009

2009

[2] [2]

NR Multiplexing and channel coding,

3GPP, “NR Multiplexing and channel coding,” Technical Specification (TS) 3GPP.38.212, 3rd Generation Partnership Project, Nov. 2021

2021

[3] [3]

Channel coding for 6GR air interface,

Huawei and HiSilicon, “Channel coding for 6GR air interface,” Discus- sion and Decision R1-2505185, 3GPP, 08 2025

2025

[4] [4]

Coding performance of hybrid ARQ schemes,

J.-F. Cheng, “Coding performance of hybrid ARQ schemes,”IEEE Trans. Commun., vol. 54, pp. 1017–1029, June 2006

2006

[5] [5]

Polar coded HARQ scheme with Chase combining,

K. Chen, K. Niu, Z. He, and J. Lin, “Polar coded HARQ scheme with Chase combining,” inIEEE Wireless Commun. and Netw. Conf., pp. 474–479, Apr. 2014

2014

[6] [6]

An Adaptive IR-HARQ Scheme for Polar Codes by Polarizing Matrix Extension,

M.-M. Zhao, G. Zhang, C. Xu, H. Zhang, R. Li, and J. Wang, “An Adaptive IR-HARQ Scheme for Polar Codes by Polarizing Matrix Extension,”IEEE Commun. Lett., vol. 22, pp. 1306–1309, July 2018

2018

[7] [7]

Capacity-achieving rateless polar codes,

B. Li, D. Tse, K. Chen, and H. Shen, “Capacity-achieving rateless polar codes,” inIEEE International Symposium Inf. Theory, pp. 46–50, July 2016

2016

[8] [8]

Hardware-friendly IR-HARQ for polar SCL decoders,

M. Jalaleddine, J. Li, and W. J. Gross, “Hardware-friendly IR-HARQ for polar SCL decoders,” inIEEE International Conf. on Commun., pp. 2008–2013, 2025. ISSN: 1938-1883

2008

[9] [9]

Fast polar codes for terabits-per-second throughput communications,

J. Tong, X. Wang, Q. Zhang, H. Zhang, J. Wang, and W. Tong, “Fast polar codes for terabits-per-second throughput communications,” inIEEE International Symposium on Personal, Indoor and Mobile Radio Commun., pp. 1–6, 2023

2023

[10] [10]

Fast polar decoders: Algorithm and implementation,

G. Sarkis, P. Giard, A. Vardy, C. Thibeault, and W. J. Gross, “Fast polar decoders: Algorithm and implementation,”IEEE Journal on Selected Areas in Commun.s, vol. 32, no. 5, pp. 946–957, 2014

2014

[11] [11]

A simplified successive- cancellation decoder for polar codes,

A. Alamdar-Yazdi and F. R. Kschischang, “A simplified successive- cancellation decoder for polar codes,”IEEE Commun. Lett., vol. 15, no. 12, pp. 1378–1380, 2011

2011

[12] [12]

Adjustable ordered statistic decoder for short block length code towards urllc,

F. Wang, J. Jiao, K. Zhang, S. Wu, and Q. Zhang, “Adjustable ordered statistic decoder for short block length code towards urllc,” inInter- national Conf. on Wireless Commun. and Signal Processing, pp. 1–5, 2021

2021

Enabling Fast Polar SC Decoding with IR-HARQ

The reading

Core claim §

What carries the argument

Load-bearing premise §

What would settle it §

If this is right

Where Pith is reading between the lines

discussion (0)

Core claim

Load-bearing premise

What would settle it