arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.09780cs.ITmath.IT
收藏

有限块长IR-HARQ的功率分配

Power Allocation for Finite-Blocklength IR-HARQ

Wenyu Wang, Minhao Zhu, Kaiming Shen, Zhaorui Wang, Shuguang Cui

AI总结:

本文针对有限块长IR-HARQ的功率分配问题,提出更紧的中断概率上界,将难解问题转化为几何规划以高效求解,实现能效优化。

摘要:

本文关注增量冗余混合自动重传请求(IR-HARQ)策略下多次传输轮次间的功率分配,旨在有限块长体制下寻求一种能效方式以满足中断概率目标。我们首先证明上述功率分配问题的优化目标与约束均依赖于中断概率。主要挑战在于中断概率无法以功率变量的解析形式写出。为规避这一困难,我们提出了有限块长体制下中断概率的一个新颖上界,该上界比现有文献中的上界更为紧致。最重要的是,利用该上界近似中断概率,我们可将原始难以处理的功率分配问题转化为几何规划(GP)形式,从而可通过标准方法高效求解。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑