2015
DOI: 10.1109/twc.2014.2368117
|View full text |Cite
|
Sign up to set email alerts
|

On Power Allocation for Incremental Redundancy Hybrid ARQ

Abstract: We study the power allocation for incremental redundancy (IR) hybrid automatic repeat request (HARQ) in block fading channel where causal channel state information is known at both the transmitter and the receiver. In IR-HARQ, the traffic is assigned into consecutive transmission rounds, and at each round, the instantaneous mutual information that is required for successful decoding is upper bounded by the data rate that is to be delivered. We propose an HARQ power allocation method that maximizes the average … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(11 citation statements)
references
References 21 publications
(42 reference statements)
0
11
0
Order By: Relevance
“…To compute the power allocation algorithm, again we resort to problem (15). First, we write the Lagrangian function as…”
Section: Appendix Fmentioning
confidence: 99%
“…To compute the power allocation algorithm, again we resort to problem (15). First, we write the Lagrangian function as…”
Section: Appendix Fmentioning
confidence: 99%
“…Without fairness constraint, the joint optimization of the power and rate would aggressively allocate most of power to the user with better channel condition, which behaves like waterfilling algorithm regardless of user fairness [40] and violates the intention of NOMA protocol [11]- [14]. This interesting phenomenon can be observed in Table I for the proposed scheme, where the notation "−" denotes no feasible solution.…”
Section: Maximization Of Ltatmentioning
confidence: 96%
“…A function is convex if both the objective function and the constraint set are convex. Based on (11), (14), (38) and (43) it is straightforward to show that proving the convexity of our problem reduces to proving the convexity of…”
Section: Appendix a Proof Of Lemmamentioning
confidence: 99%
“…All these schemes boost reliability at the cost of increased latency and complexity of the receiver design. In addition, several retransmission protocols utilize parallel coding schemes, where they utilize Incremental redundancy (IR) [14]. Therein, the transmitter sends new information with each retransmission.…”
Section: Introductionmentioning
confidence: 99%