Approximate closed‐form power allocation scheme for multiple‐input–multiple‐output hybrid automatic repeat request protocols over Rayleigh block fading channels

Ge, Songhu; Yang, Xi; Huang, Shucai; Ma, Yue; Wei, Jibo

doi:10.1049/iet-com.2014.1263

Cited by 5 publications

(7 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…From a power optimization perspective, incremental redundancy is more difficult to tackle than Chase combining because the power variables in (7) are contained in separate log terms 2 . The rest of the paper concentrates on incremental redundancy, except in Remark 9, Section V where the results are adapted to Chase combining.…”

Section: A Chase Combining Vs Incremental Redundancymentioning

confidence: 99%

“…The full channel information of each h n is not available at the transmitter. Following [4]- [7], we assume that the transmitter only knows the distribution of h n , i.e., the value of β (hence S). Notice that all the power variables (p 1 , .…”

Section: B Problem Formulationmentioning

confidence: 99%

“…Second, its performance approaches the global optimum if the signal-to-noise ratio (SNR) is sufficiently high. We remark that the proposed power control method is fundamentally different from the existing GP methods in [4]- [7] that all rest upon the classic outage probability bound in [8], [9] by assuming unbounded transmit power. The new bound proposed in this paper is much tighter by taking the practical power constraint into account.…”

mentioning

confidence: 97%

“…The new bound proposed in this paper approximates the outage probability function more exactly. As a result, in comparison to the existing methods in [4]- [7] based on the classic bound [8], [9], the newly proposed GP method is less prone to overestimating outage probabilityespecially with low transmit power as widely seen in the IoT scenarios. The paper mainly consists of two parts: the first part focuses on constructing a tighter outage probability bound for the conventional link-level Rayleigh fading channel as considered in [4]- [7], while the second part concerns a generalization to the parametric fading (which encompasses Rayleigh fading and Rician fading as special cases), multiantenna transmissions, and broadcast transmissions.…”

mentioning

confidence: 98%

“…The paper is most closely related to a line of studies in [4]- [7] that leverage the classic outage probability bound in [8], [9] to approximate the complicated outage probability function thereby relaxing the intractable power control problem of HARQ as a GP problem. The new bound proposed in this paper approximates the outage probability function more exactly.…”

mentioning

confidence: 99%

See 4 more Smart Citations

Energy Efficient HARQ for Ultrareliability via Novel Outage Probability Bound and Geometric Programming

Shen,

Yu,

Chen

et al. 2022

Preprint

View full text Add to dashboard Cite

Hybrid automatic repeat request (HARQ) is a key enabler for ultrareliable communications. This paper optimizes transmit power for the initial transmission and the subsequent retransmissions of HARQ with either incremental redundancy or Chase combining, aiming to minimize the expected energy consumption given the target outage probability and the target latency. The main challenge is due to the fact that the outage probability is a complicated function of the power variables which are nested in successive convolutions. The existing works mostly use a classic upper bound to approximate the outage probability by assuming unbounded transmit power, then convert the original problem to a geometric programming (GP) problem. In contrast, we propose a novel and much tighter upper bound by taking the practical power limit into consideration. The new bound and the resulting new GP method are further extended to a broader group of channel models with various fading, multiple antennas, and multiple receivers. As shown in simulations, the GP method based on the new bound significantly outperforms the existing strategies that either fix transmit power or optimize power by the classic bounding technique.Index Terms-Hybrid automatic repeat request (HARQ), incremental redundancy, Chase combining, ultrareliable communications, power control, energy consumption, new upper bound on outage probability, geometric programming (GP). I. INTRODUCTIONU LTRARELIABLE communications refer to transmitting data with a target outage probability lower than 10 −5 , as compared to the traditional cellular systems typically with an outage probability around 10 −2 [2]. This stringent performance standard is driven by a multitude of evolving applications of the Internet of Things (IoT), e.g., ultra highdefinition (UHD) video [3]. This paper seeks an energyefficient implementation of the hybrid automatic repeat request Manuscript accepted in IEEE Transactions on Wireless Communications.

show abstract

Section: A Chase Combining Vs Incremental Redundancymentioning

confidence: 99%

Section: B Problem Formulationmentioning

confidence: 99%