--- title: Extended HARQ Processes url: https://www.emergentmind.com/topics/extended-harq-processes type: topic --- # Extended HARQ Processes Extended HARQ Processes Extended Hybrid Automatic Repeat reQuest (HARQ) processes denote advanced retransmission protocols in wireless systems that generalize and expand upon classical, stop-and-wait HARQ through parallelization, cross-packet coding, flexible scheduling, and joint coding paradigms. These protocols are fundamental to the architecture and performance of modern 5G and emerging 6G systems, where stringent delay, reliability, and throughput requirements coexist. Extended HARQ encompasses multi-process parallel HARQ, cross-packet and multi-packet HARQ, and advanced polar code-based HARQ mechanisms, each providing specific structural and performance advantages in the finite-blocklength, high-QoS wireless regime. ## 1. Motivation and Architecture of Parallel HARQ In 5G New Radio (NR) and related standards, HARQ is realized not as a singular stop-and-wait loop but through a bank of N parallel processes—typically with N = 8 or 16 per user. Each HARQ process maintains its own state machine, counter, and resource mapping. This parallelization ensures continuous transmission while awaiting decoding and feedback from previous rounds, amortizing the delays induced by non-negligible receiver processing and uplink/downlink ACK/NACK feedback [2502.08789]. A core insight is that if only a single HARQ process is active, the downlink or uplink link idles for the entire HARQ round-trip time (RTT), wasting valuable spectral opportunities. Extended HARQ thus aligns protocol behavior with hardware-limited feedback cycles, maximizing link utilization under real-world latency constraints. ## 2. Queueing-Theoretic and Finite-Blocklength Delay Models The performance of extended HARQ is rigorously modeled via multi-server queueing systems. The system is described as a discrete-time queue with arrival probability $f$ per slot, buffer size $Q_{max}$, and $N$ parallel HARQ servers. Each (re)transmission occupies one slot, with the overall state captured by the tuple $(q, m)$—queue length and the current retransmissions. Service completion depends on a finite-blocklength error process, where decoding and feedback latency are explicitly incorporated. For short packets (finite $n$), decoding error for ARQ is modeled as $p(S) = Q((\log_2(1+S) - \eta) \sqrt{L/V})$, and for HARQ-IR as $p_m(S) = Q((\log_2(1+S) - \eta/m) \sqrt{mL/V})$, with subsequent averaging over Rayleigh fading [2502.08789]. The packet service time is $D_{serv}(m) = m (1 + D_{dec}) + (m-1) \delta$, and the packet delay (including waiting for a free server) admits a tractable Markov chain analysis, yielding tight bounds on Delay Violation Probability (DVP) under strict delay targets. ## 3. Cross-Packet, Variable-Rate, and Multi-Packet HARQ Extensions Beyond classical IR-HARQ, several extended HARQ schemes dynamically incorporate new information bits and coordinate the transmission of multiple packets within a single HARQ process. - **Cross-Packet HARQ (XP-HARQ):** Here, each HARQ round injects new information bits in addition to redundancy, with joint coding/decoding across rounds. The decoding success at round $k$ depends on the aggregate mutual information exceeding the accumulated rate, $I_1 + \ldots + I_k \geq R_1 + \ldots + R_k$ [1606.05182]. Adaptation of the rate vector $\{R_k\}$ according to feedback or past channel realization yields substantial throughput improvements and reduced SNR gap to ergodic capacity. - **Multi-Packet HARQ:** Permits two (or more) packets to share a channel block, e.g., via time-sharing or superposition coding. Decisions on scheduling and resource splitting are optimized using Markov Decision Process (MDP) or Partial-State Information MDP when feedback is limited [1412.8555]. This closes much of the SNR gap to ergodic capacity that plagues conventional HARQ at high rates. - **Variable-Rate HARQ (VR-HARQ):** Each retransmission may vary code rate, with rates $\{R_k\}$ selected to maximize effective capacity under latency and reliability constraints [1812.06470]. XP-HARQ and VR-HARQ provide nearly identical effective capacity and both outperform fixed-rate schemes. The table summarizes key process classes and performance metrics: | HARQ Class | Rate Adaptation / New Bits | Performance Gain | |-------------------|----------------------------|-----------------------------------| | Multi-Process HARQ| No | Removes transmitter idling; strict DVP control [2502.08789] | | XP-HARQ | Yes (joint coding) | 1.5–2.5 dB SNR gain, $C_E \approx$ VR-HARQ [1606.05182,1812.06470] | | Multi-Packet HARQ | Yes (joint scheduling) | 3–8 dB SNR gain at high rate [1412.8555] | | VR-HARQ | Yes (per-round rate) | Nearly matches XP-HARQ; both optimal for effective capacity [1812.06470] | ## 4. Polar Codes and Incremental Redundancy Mechanisms Extended HARQ processes for polar codes address key challenges in low-complexity, high-throughput scenarios. Prominent mechanisms include: - **Rate-Compatible Polar (RCP) HARQ:** Constructs a family of nested codes via puncturing and repetitions built atop a polar base code, with a fixed information set [1307.2800]. Soft information is naturally accumulated by SC decoding, requiring no change to the decoder algorithm. - **Matrix-Extension IR-HARQ for Polar Codes:** Extends the length of the mother polar code in retransmissions, with each new block hosting new information bits and “parity-check frozen” (pc-frozen) bits mapped to previous ones [1708.09679,2512.04418]. Specialized modifications to SC decoders enable 70–72% reductions in decoding latency via special node skipping, while preserving FER [2512.04418]. - **ARUM/Bit Relocation Schemes:** Utilize inter-transmission polarization with XOR masking and dynamic relocation of weakly protected bits to highly reliable positions in later rounds. Each round may use distinct code lengths and rate-matching schemes, providing per-round design flexibility. The approach achieves within 0.2 dB of direct polar code design and strictly increases polarization depth per round [1805.06597]. Polar-based extended HARQ offers hardware-friendly $O(N \log N)$ complexity with deterministic latencies, which is significant for ultra-reliable, low-latency (URLLC) contexts. ## 5. Performance Metrics: Delay, Throughput, and Effective Capacity Analysis of extended HARQ focuses on metrics such as delay violation probability (DVP), effective capacity $C_E(\theta)$, and SNR gap to ergodic capacity: - **Delay Violation Probability (DVP):** The probability that the sum of waiting and service delay exceeds a target, $DVP(d) = P(D > d)$, is derived via closed-form bounds (for ARQ) and efficient algorithms (for HARQ-IR) in Markovian multi-server models [2502.08789]. Realistic decoding and feedback latencies (e.g., RTT = 4 slots) must be explicitly considered; simplified immediate-feedback assumptions yield several orders of magnitude DVP underestimation. - **Effective Capacity:** Describes maximum sustainable arrival rate under QoS exponent $\theta$, capturing cross-layer performance. For renewal-type HARQ, $C_E(\theta)$ is obtained by solving a root equation depending on the reward and renewal distributions, with explicit monotonicity and bounds in $\theta$ [1812.06470]. VR-HARQ and XP-HARQ attain the same optimal $C_E(\theta)$ and outperform fixed-rate schemes. - **Throughput and Fairness:** In coordinated multi-user or multi-packet scenarios, SNR gains of several dB are realized over classical HARQ. Fairness and diversity increase with user collaboration (coordinated frequency/resource allocation), with theoretical diversity order scaling as $d = (J+1)(M-1)+1$ under $J$ helpers [1412.6912]. ## 6. Practical System Design and Implementation Considerations Implementation of extended HARQ processes is guided by constraints on latency, feedback, complexity, and feedback granularity: - The number of parallel HARQ processes should at least match the HARQ RTT (in slots) to eliminate transmitter idle slots [2502.08789]. - Resource allocation per packet (measured in “symbols per bit”) is the primary figure of merit for DVP compliance. - Arrival rates must be matched to the link’s sustainable rate; surplus load increases queueing delay and DVP precipitously. - Special node-enabled SC decoding for polar IR-HARQ achieves low area overhead and deterministic, minimum-latency operation [2512.04418]. - Cross-packet and multi-packet HARQ necessitate joint coding/decoding machinery (e.g., parallel turbo encoding, or multi-stage polar decoding with bit relocation maps) and, in the most aggressive feedback scenarios, look-up tables for MDP policies indexed by mutual information accumulations [1606.05182,1412.8555]. A plausible implication is that deployment of extended HARQ in URLLC-type services or ultra-high-throughput 6G applications will require per-link and per-service parameterization, leveraging design flexibility (rate-matching, blocklength, code structure) to balance delay, reliability, and decoding complexity. ## 7. Comparative Analysis and Conclusions Across ARQ/HARQ variants, parallelization and joint coding extensions uniformly reduce latency, improve throughput, and approach information-theoretic limits. Numerical studies demonstrate: - HARQ with parallel processes brings DVP and throughput metrics into alignment with event-driven simulation, distancing itself from naive queueing models through precise finite-blocklength and latency analysis [2502.08789]. - Cross-packet/multi-packet extensions close much of the SNR gap to ergodic capacity, especially under moderate-to-high spectral efficiencies, with observed 4–8 dB gains [1606.05182,1412.8555]. - Polar-based extended HARQ achieves sub-dB gaps to direct designs and outperforms turbo-based references, with deterministic complexity and bounded delay [1307.2800,2512.04418,1805.06597]. Guidelines anchored in the referenced analyses are now central to system-level configuration in both standards-compliant and research platforms for latency-sensitive wireless services. --- **References:** [2502.08789] Delay Analysis of 5G HARQ in the Presence of Decoding and Feedback Latencies [1307.2800] A Hybrid ARQ Scheme Based on Polar Codes [1606.05182] Adaptive Cross-Packet HARQ [1812.06470] Effective Capacity for Renewal Service Processes with Applications to HARQ Systems [1412.6912] Coordinated Hybrid Automatic Repeat Request; Extended Version [2512.04418] Enabling Fast Polar SC Decoding with IR-HARQ [1708.09679] An Incremental Redundancy HARQ Scheme for Polar Code [1412.8555] Multi-packet Hybrid ARQ: Closing gap to the ergodic capacity [1805.06597] ARUM: Polar Coded HARQ Scheme based on Incremental Channel Polarization [1801.07096] Generalized HARQ Protocols with Delayed Channel State Information and Average Latency Constraints Source: https://www.emergentmind.com/topics/extended-harq-processes