Power Allocation for Finite-Blocklength IR-HARQ

TL;DR

This paper introduces a novel approach for power allocation in IR-HARQ systems under finite-blocklength constraints, using a tight outage probability bound to enable efficient geometric programming solutions for energy-efficient communication.

Contribution

It proposes a new tight outage probability upper bound and reformulates the power allocation problem as a geometric program for the first time in this context.

Findings

The proposed bound is significantly tighter than existing bounds.

The reformulated problem can be efficiently solved using standard geometric programming methods.

Simulation results demonstrate improved energy efficiency under the proposed scheme.

Abstract

This letter concerns the power allocation across the multiple transmission rounds under the Incremental Redundancy Hybrid Automatic Repeat reQuest (IR-HARQ) policy, in pursuit of an energy-efficient way of fulfilling the outage probability target in the finite-blocklength regime. We start by showing that the optimization objective and the constraints of the above power allocation problem all depend upon the outage probability. The main challenge then lies in the fact that the outage probability cannot be written analytically in terms of the power variables. To sidestep this difficulty, we propose a novel upper bound on the outage probability in the finite-blocklength regime, which is much tighter than the existing ones from the literature. Most importantly, by using this upper bound to approximate the outage probability, we can recast the original intractable power allocation problem into a geometric programming (GP) form--which can be efficiently solved by the standard method.