Pith. sign in

REVIEW 4 major objections 5 minor 15 references

Incremental-redundancy HARQ systems cannot beat the first transmission's undetected-error rate, and the paper shows how to allocate retransmission bits to approach that floor and predict per-codeword needs from early reliability information

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 ↗

IR-HARQ can request exactly the needed retransmission size by predicting it from SNR or first-transmission reliability values, approaching the undetected-error floor with up to 60% smaller retransmissions.

T0 review reviewed 2026-08-02 challenge →

load-bearing objection Useful engineering idea backed by a flawed proof: the per-codeword redundancy predictor is worth a look, but Theorem 1 should not be trusted as written. the 4 major comments →

arxiv 2607.14247 v1 pith:CRHS2IWW submitted 2026-07-15 cs.IT math.IT

Enhanced Feedback Mechanisms for Resource-Efficient Incremental Redundancy

Mustafa Cemil Co\c{s}kun , Ahmed Elkelesh , Avijit Mandal , Homa Esfahanizadeh This is my paper
classification cs.IT math.IT MSC 94A1594A24
keywords incremental redundancyHARQundetected block error rateresource allocationearly feedbackLLR-based prediction5G NR LDPCpolar codes
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 tries to establish that in incremental-redundancy hybrid ARQ (IR-HARQ), the overall block error probability is lower-bounded by the probability of an undetected error after the first transmission, and that this lower bound is asymptotically achievable with enough redundancy under optimal decoding. A sympathetic reader cares because this reframes retransmission design as a resource-allocation problem: choose the smallest second-transmission redundancy that just reaches the undetected-error floor instead of conservatively over-provisioning. The paper develops two mechanisms to do this: an SNR-based look-up table for one- or two-shot resource allocation, and an early-feedback predictor using first-transmission log-likelihood ratios to decide, per codeword, whether decoding is already possible or how many extra redundancy versions are needed. Link-level results with polar codes show that approaching the floor saves up to 60% of retransmission bits at high SNR, and a CNN-based predictor for 5G NR LDPC codes reaches about 96% accuracy in predicting the minimum number of redundancy versions needed. The finite-blocklength usefulness of the asymptotic achievability claim depends on an unproved entropy step in the proof.

Core claim

The paper's central claim is Lemma 1: for any IR-HARQ scheme, the overall block error probability Pr[E] is at least Pr[E1^(u)], the undetected block error rate of the first transmission, because an undetected first-round error already terminates retransmissions and becomes an overall error. Theorem 1 claims that equality is achievable as the total retransmission redundancy grows without bound under a MAP decoder, using an entropy argument: the conditional probability of correct decoding is at least 2^{-H(M|Y)}, and if the conditional mutual information contributed by each new incremental bit is strictly positive while message uncertainty remains, then H(M|Y) tends to zero and the second-roun

What carries the argument

The key object is the undetected-error floor: the event E1^(u), an erroneous first-round decoding that passes the error-detection check, is a subset of the overall error event E, forcing Pr[E] ≥ Pr[E1^(u)]. The achievability argument hinges on the entropy chain linking MAP decoding success probability to conditional entropy: 1 − Pr[E] ≥ 2^{-H(M|Y)}, plus the unproved assertion that the conditional mutual information I(M;Y^{n+1}|Y^n) is strictly positive whenever message uncertainty remains, so the posterior entropy collapses as redundancy grows. The design machinery is a SNR-to-redundancy look-up table, built by simulation so that overall BLER stays near the uBLER floor, and an early-feedbac

Load-bearing premise

The load-bearing assumption is the unproved step in Theorem 1 that every additional incremental bit carries strictly positive conditional mutual information about the message whenever posterior uncertainty remains; if the retransmission stream can stall this information flow, the claimed approach to the uBLER floor with finite redundancy is not established.

What would settle it

Construct or simulate an IR-HARQ scheme whose incremental bits are deterministic repetitions of already-transmitted bits, so I(M;Y^{n+1}|Y^n)=0 while residual message uncertainty is positive; for such a scheme, Pr[E|E1^(d)] will not vanish and the overall BLER will sit above the uBLER floor, directly contradicting Theorem 1. Alternatively, run the paper's polar-coded setup at fixed SNR with the optimized Δn2 and check-by exact MAP enumeration or very long Monte Carlo simulation whether overall BLER actually reaches β·Pr[E1^(u)]; a systematic gap would show the asymptotic result does not carry

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

If this is right

  • Retransmission sizes in IR-HARQ should be sized against the first-round undetected-error rate, not against the target BLER alone, yielding large redundancy savings at high SNR without sacrificing reliability.
  • With strict two-transmission latency, choosing the second-transmission length to just reach the uBLER floor is enough; extra bits beyond that floor waste resources without reducing the error rate.
  • Early LLR-based feedback can decide the retransmission budget without running the full decoder, allowing successful decoding within at most two transmission occasions and reducing expected latency.
  • The dominant one-RV over-allocation error mode is resource-inefficient but not reliability-critical, so the predictor can be used as a conservative scheduler without risking additional decoding failures.

Where Pith is reading between the lines

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

  • The uBLER-floor argument should apply to any rateless or incremental scheme whose first chunk is protected by a finite error-detection code; comparing competing HARQ feedback designs should therefore be done against uBLER, not raw BLER.
  • Because the main error mode is one-RV over-allocation, a testable refinement would be to schedule the predicted number of RVs minus one and keep a conventional ACK/NACK fallback, trading a small residual failure probability for larger resource savings.
  • The asymptotic achievability, if the entropy step is rigorized, would give a non-asymptotic bound on the required second-transmission length as a function of the residual conditional entropy—a natural finite-blocklength extension that the paper leaves implicit.
  • The savings from the proposed allocation should grow as the CRC gets shorter, since the uBLER floor rises; this suggests the scheme is especially attractive for polar codes with short CRCs, as the paper notes in its motivation.
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.

Referee Report

4 major / 5 minor

Summary. The paper considers incremental redundancy (IR) HARQ systems and proposes two feedback mechanisms. The first is an SNR-driven redundancy-allocation policy: after deriving a lower bound (Lemma 1) stating that any IR-HARQ scheme's overall BLER cannot fall below the first-transmission undetected BLER, the authors claim asymptotic achievability of this bound (Theorem 1) and use the resulting design principle to construct an SNR-dependent second-transmission length Δn₂(SNR) for a polar-coded system. Numerical results in §V-A report retransmission savings up to 60% relative to equal-size retransmissions. The second contribution is a per-codeword early-feedback predictor that uses first-transmission LLRs (or SNR) to decide, without full decoding, whether the codeword is decodable, how many additional redundancy versions are needed, or whether retransmission is futile; link-level simulations for 5G NR LDPC codes report about 96% prediction accuracy.

Significance. If the claims held as stated, the paper would make a useful engineering contribution: the uBLER floor is a simple but easily overlooked constraint in HARQ resource allocation, and predicting per-codeword redundancy needs from first-round LLRs is a plausible way to save resources and latency. The machine-code demonstrations are not shipped, but the experimental setup for the LDPC study is described in enough detail to be reconstructed. The main weakness is that the central theoretical result, Theorem 1, rests on an unproved and false assertion about conditional mutual information, so the asymptotic achievability of the uBLER lower bound is not established. In addition, the headline 60% saving is obtained by simulation-based optimization of the very Δn₂(SNR) values being reported, rather than by a rule derived from the theory, which limits the generality of that claim. The LLR-predictor results, while encouraging, lack the dataset and statistical details needed to substantiate the 96% accuracy claim. These are load-bearing issues, but the underlying ideas are plausible and could be repaired in a major revision.

major comments (4)
  1. [§III-B, Theorem 1 proof (Eq. (10))] The proof's key step is the assertion that I(M;Y^{n+1}|Y^n)>0 whenever uncertainty about M remains. This is unproved and is not generally true. Example: k=2, first transmission sends the two information bits, second transmission sends their XOR; when the posterior is uniform over {00,01}, H(M|Y^n)=1 bit but the next transmitted symbol is identical for both hypotheses, so I(M;Y^{n+1}|Y^n)=0. Thus the argument does not rule out a strict sub-ceiling L<k. Even if every increment had strictly positive conditional mutual information, positivity alone does not imply that the sum diverges; one would need a uniform lower bound or a summability argument. This step is essential for the achievability claim that Pr[E|E1^d]→0 as Δn→∞.
  2. [§III-B, Eqs. (6)–(9)] The MAP error bound is written with the unconditional posterior P_{M|Y^{nTmax}} and unconditional entropy H(M|Y^{nTmax}), but the target is Pr[E|E1^d], i.e., the error probability conditioned on the detected-error event after the first transmission. The distribution of the received signal given E1^d differs from the unconditional distribution, and H(M|Y^n)→0 does not by itself imply H(M|Y^n,E1^d)→0. The proof must either condition throughout on E1^d or show that the event E1^d has vanishing influence on the posterior in the large-Δn limit. Without this, the conclusion Pr[E|E1^d]→0 is not justified.
  3. [§V-A, Fig. 2 and Δn₂(SNR) vector] The reported redundancy vector Δn₂(SNR)=[544,444,256,200,144,100] is obtained by 'optimizing Δn₂ as a function of SNR ... via simulations' (Section V-A). Consequently, the 60% saving is a fitted outcome on the same SNR grid used for optimization, not a prediction of Theorem 1 or of a principled resource-allocation rule. The claim that the uBLER bound 'can be closely approached' is demonstrated only at the fitting points; no held-out SNR values, interpolation rule, or uncertainty quantification is given. The abstract's 'savings up to 60%' should be presented as a simulation-optimized example, not as a general consequence of the theory.
  4. [§V-B, LLR-based predictor] The 96% accuracy figure is reported for a single 80/10/10 split, but the paper does not state the dataset size, the class counts after rejection sampling, the actual SNR distribution of test samples, or confidence intervals for the accuracy. The comparison with the SNR-based classifier is made only under 'precise channel-quality knowledge'; the claimed degradation under estimation error or mobility is not quantified. The 'dominant error mode' of over-allocation by one RV is described but not measured. To support the abstract claim that 'both predictors achieve high accuracy (about 96%)', the paper needs a more complete evaluation, including baselines and per-class statistics.
minor comments (5)
  1. [Abstract] The abstract says 'both predictors achieve high accuracy'; the SNR-based classifier reaches 96% only under precise channel-quality knowledge. Please state this qualification in the abstract as well as in §V-B1.
  2. [§IV, class definitions] The five classes are described in Section IV as 'already decodable, one/two/three additional RVs, undecodable', while the dataset labels in §V-B are 'rounds 1–4 mapped to classes 1–4'. Clarify the correspondence between 'additional RVs' and 'rounds', since RV 0 is the first round and subsequent RVs are added in the sequence 0→2→3→1.
  3. [§V-A, footnote 3] For low SNR, the total transmitted length exceeds 512 bits (e.g., 256+544=800); the statement that the shorter code is obtained from the longer one via puncturing deserves a clearer explanation, since the second transmission at low SNR is longer than the first.
  4. [References] Reference [14] is the authors' own patent application and is cited as the source of the LUT-construction method. It would strengthen the paper to describe the LUT construction in the manuscript itself, so that the method is self-contained and not dependent on an unpublished application.
  5. [Overall] No code or data availability statement is provided. Given the empirical nature of Section V, a release of the dataset-generation scripts and the trained-predictor evaluation details would improve reproducibility.

Circularity Check

0 steps flagged

No significant circularity; central claims rest on independent simulations/held-out labels; only a minor non-load-bearing self-citation.

full rationale

The paper's main claims are not constructed from their own outputs. Lemma 1 is a direct subset relation E1^(u) ⊆ E, so the lower bound is definitional only in the trivial sense of an error-event inclusion, not a circular prediction. Theorem 1 attempts an achievability proof; its key assertion that I(M;Y^{n+1}|Y^n)>0 whenever uncertainty remains is unproved and not generally true, and positivity would not by itself imply H(M|Y^{nTmax})→0. This is a correctness gap in the proof, but it is not a reduction of the conclusion to the assumptions; the assertion is not adopted as the definition of 'reasonable IR-HARQ'. The polar-code demonstration optimizes Δn2(SNR) by simulation and then shows the optimized scheme matches the uBLER floor; this is a constructive/optimization result rather than a fitted parameter being relabeled as a prediction, and the uBLER floor is measured independently from the first transmission. The LLR-based and SNR-based predictors are trained on labels obtained from actual decoding with an 80/10/10 split and evaluated on unseen test data, so the 96% accuracy is not circular. The only self-reference is [14], the authors' own patent application, invoked for constructing LUTs/expanded MCS tables; this is an implementation detail and does not carry Lemma 1, Theorem 1, or the numerical claims. Accordingly, no load-bearing circular step is present; the minor non-load-bearing self-citation justifies a score of 2 rather than 0.

Axiom & Free-Parameter Ledger

5 free parameters · 5 axioms · 0 invented entities

The paper introduces no new physical entities. The enriched feedback message F is an existing signaling concept extended to more than one bit. The main load-bearing inputs are the fitted redundancy table, the unproved mutual-information assertion in Theorem 1, and the trained ML models.

free parameters (5)
  • Δn2(SNR) redundancy table = [544, 444, 256, 200, 144, 100] bits for SNR = [-3,-2,-1,0,1,2] dB
    Obtained by simulation optimization to make overall BLER approach the first-transmission uBLER (Section V-A); the claimed 60% saving follows from this fitted table.
  • β target-reliability slack = close to 1 (not numerically stated)
    Introduced in Section III-B to define smallest Δn2 such that Pr[E] ≤ β Pr[E1^u]; chosen empirically.
  • CNN hyperparameters and preprocessing = not specified (kernel sizes, channels, epochs, LR schedule; dropout=0.3, z-score, clipping)
    The LLR predictor architecture is only sketched; these choices were tuned to validation accuracy.
  • SNR-classifier decision boundaries = not reported
    Logistic-regression classifier partitions SNR into decision regions; separate model per MCS; boundaries are fitted.
  • Class-balancing acceptance rates = not reported
    Rejection-sampling rates chosen to collect equal samples per class (Section V-B); this affects the reported accuracy value.
axioms (5)
  • domain assumption Channel is memoryless AWGN with QPSK and an available SNR estimate (e.g., from DMRS).
    System model in Section II; used for the LUT and the SNR-based classifier.
  • domain assumption CRC error detection cleanly separates detected and undetected error events, so uBLER can be computed as simulated.
    Section II defines E^(d) and E^(u); polar simulations use an 11-bit CRC; the model treats CRC behavior as reliable.
  • ad hoc to paper For a non-degenerate channel and a reasonable IR-HARQ scheme, I(M;Y^{n+1}|Y^n) > 0 whenever uncertainty remains, implying H(M|Y^n)→0.
    Unproved assertion in the proof of Theorem 1 (Section III-B); it is the key step for achievability and may fail without additional code/channel conditions.
  • standard math MAP decoding is the relevant optimum, and its error probability can be bounded via max_i p_i ≥ 2^{-H(p)} and Jensen's inequality.
    Standard information-theoretic inequalities used in the Theorem 1 proof.
  • ad hoc to paper The first-RV LLR vector contains enough information to predict the minimum number of additional RVs with 96% accuracy.
    Empirical claim validated only on the paper's class-balanced dataset; no guarantees under channel-estimation error or mobility.

reviewed 2026-08-02 · how reviews work

0 comments
Cite this review

Pith. "Pith review of Enhanced Feedback Mechanisms for Resource-Efficient Incremental Redundancy." pith.science (2026). https://pith.science/paper/CRHS2IWW

@misc{pith2026260714247,
  author       = {Pith},
  title        = {Pith review of: Enhanced Feedback Mechanisms for Resource-Efficient Incremental Redundancy},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/CRHS2IWW}},
  note         = {Machine review of arXiv:2607.14247}
}
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Incremental redundancy (IR) can reduce error rates by spreading coded bits across multiple transmission attempts. However, conventional stop-and-wait operation with coarse feedback often over-provisions retransmissions, triggers unnecessary decoding attempts, and increases end-to-end latency. This paper develops enhanced feedback and scheduling mechanisms that predict the additional redundancy needed for successful decoding and allocate only the required resources. We study two complementary strategies. First, using channel statistics, we learn a one- or two-shot mapping from channel quality to the minimum redundancy budget. As a byproduct, we derive an achievable reliability lower bound on the error probability of hybrid automatic repeat request (HARQ) systems. Numerical results with polar-coded IR-HARQ scheme show that the bound can be closely approached by appropriately selecting the second-transmission redundancy over a wide SNR range with savings up to 60\% in retransmission size. Second, we propose a realization-aware early-feedback mechanism that uses first-transmission reliability information to make per-codeword decisions before decoding: whether the codeword is already decodable, if not, how many additional redundancy versions are needed, or whether decoding is unlikely and rate adaptation is preferable. Link-level simulations with 5G NR LDPC codes show that both predictors achieve high accuracy (about 96\% in our study), increasing the probability of successful decoding within at most two transmission occasions.

Figures

Figures reproduced from arXiv: 2607.14247 by Ahmed Elkelesh, Avijit Mandal, Homa Esfahanizadeh, Mustafa Cemil Co\c{s}kun.

Figure 1
Figure 1. Figure 1: Simplified NR coding chain with HARQ feedback. [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: BLER/uBLER vs. SNR on the AWGN channel, where the proposed [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: SNR-based resource prediction model for a representative 5G LDPC [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Architecture of the one-dimensional CNN predictor that maps first [PITH_FULL_IMAGE:figures/full_fig_p005_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Performance of the LLR-based predictor: (a) Per-class accuracy, [PITH_FULL_IMAGE:figures/full_fig_p006_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Training and validation accuracy of the classifier. [PITH_FULL_IMAGE:figures/full_fig_p006_6.png] view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

15 extracted references · 2 linked inside Pith

  1. [2]

    Self-Decodability of HARQ Retransmissions for 5G NR LDPC Codes,

    G. Sarkis, J. B. Soriaga, and T. Richardson, “Self-Decodability of HARQ Retransmissions for 5G NR LDPC Codes,” in2021 11th International Symposium on Topics in Coding (ISTC), 2021, pp. 1–5

    2021

  2. [3]

    Beyond 1ÑN Decoding: Capacity-Aware Rateless Polar Codes for IR- HARQ,

    H. Zhang, X. Wang, J. Tong, J. Wang, and W. Tong, “Beyond 1ÑN Decoding: Capacity-Aware Rateless Polar Codes for IR- HARQ,”CoRR, vol. abs/2605.30885, May 2026. [Online]. Available: http://arxiv.org/abs/2605.30885

    Pith/arXiv arXiv 2026

  3. [4]

    Enabling Fast Polar SC Decoding With IR-HARQ,

    M. Jalaleddine, M. A. Jarkas, J. Li, and W. J. Gross, “Enabling Fast Polar SC Decoding With IR-HARQ,”IEEE Communications Letters, vol. 30, pp. 2088–2092, 2026

    2088

  4. [5]

    Transmission Lengths That Maximize Throughput of Variable-Length Coding & ACK/NACK Feedback,

    R. D. Wesel, N. Wong, A. Baldauf, A. Belhouchat, A. Heidarzadeh, and J.-F. Chamberland, “Transmission Lengths That Maximize Throughput of Variable-Length Coding & ACK/NACK Feedback,” in2018 IEEE Global Communications Conference (GLOBECOM), 2018

    2018

  5. [6]

    Capacity-achieving rateless polar codes,

    B. Li, D. Tse, K. Chen, and H. Shen, “Capacity-achieving rateless polar codes,” in2016 IEEE International Symposium on Information Theory (ISIT), 2016

    2016

  6. [7]

    An Incremental Redundancy HARQ Scheme for Polar Code,

    L. Ma, JieXiong, and Y . Wei, “An Incremental Redundancy HARQ Scheme for Polar Code,”CoRR, vol. abs/1708.09679, 2017. [Online]. Available: http://arxiv.org/abs/1708.09679

    Pith/arXiv arXiv 2017

  7. [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,” inICC 2025 - IEEE International Conference on Communications, 2025, pp. 2008–2013

    2025

  8. [9]

    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 Transactions on Information Theory, vol. 55, no. 7, pp. 3051–3073, 2009

    2009

  9. [10]

    Predicting decod- ability of received data,

    J. Hoydis, V . Aref, A. Elkelesh, and S. Cammerer, “Predicting decod- ability of received data,” Patent US 11 888 672 B2, Dec., 2021

    2021

  10. [11]

    Neural Network-based Forecasting of Decodability for Early ARQ,

    M. Hummert, D. W ¨ubben, and A. Dekorsy, “Neural Network-based Forecasting of Decodability for Early ARQ,” in2021 17th International Symposium on Wireless Communication Systems (ISWCS), 2021

    2021

  11. [12]

    Reducing Polar Decoding Latency by Neural Network-Based On-the-Fly Decoder Selection,

    A. Elkelesh, S. Cammerer, and S. ten Brink, “Reducing Polar Decoding Latency by Neural Network-Based On-the-Fly Decoder Selection,” in 2020 IEEE Workshop on Signal Processing Systems (SiPS), Oct. 2020

    2020

  12. [13]

    Learning-Based Rich Feedback HARQ for Energy- Efficient Uplink Short Packet Transmission,

    M. V . Vejling, F. Chiariotti, A. E. Kalør, D. G ¨und¨uz, G. Liva, and P. Popovski, “Learning-Based Rich Feedback HARQ for Energy- Efficient Uplink Short Packet Transmission,” in2025 IEEE International Conference on Machine Learning for Communication and Networking (ICMLCN), 2025, pp. 1–6

    2025

  13. [14]

    Transmitting just enough bits for polar-coded HARQ systems,

    M. C. Cos ¸kun, H. Esfahanizadeh, and A. Mandal, “Transmitting just enough bits for polar-coded HARQ systems,” US Patent Application, Dec., 2024

    2024

  14. [15]

    List decoding of polar codes,

    I. Tal and A. Vardy, “List decoding of polar codes,”IEEE Transactions on Information Theory, vol. 61, no. 5, pp. 2213–2226, 2015

    2015

  15. [16]

    Flexible IR-HARQ scheme for polar-coded modulation,

    P. Yuan, F. Steiner, T. Prinz, and G. B ¨ocherer, “Flexible IR-HARQ scheme for polar-coded modulation,” in2018 IEEE Wireless Communi- cations and Networking Conference Workshops (WCNCW), 2018

    2018

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