Pith. sign in

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1701.08617 v1 pith:RWLNGFBG submitted 2017-01-30 cs.IT math.IT

Ultra Reliable Communication via Optimum Power Allocation for Type-I ARQ in Finite Block-Length

classification cs.IT math.IT
keywords powerallocationoutageprotocolanalyzeprobabilityschemeachieving
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We analyze the performance of the type-I automatic repeat request (ARQ) protocol with ultra-reliability constraints. First, we show that achieving a very low packet outage probability by using an open loop setup is a difficult task. Thus, we introduce the ARQ protocol as a solution for achieving the required low outage probabilities for ultra reliable communication. For this protocol, we present an optimal power allocation scheme that would allow us to reach any outage probability target in the finite block-length regime. We formulate the power allocation problem as minimization of the average transmitted power under a given outage probability and maximum transmit power constraint. By utilizing the Karush-Kuhn-Tucker (KKT) conditions, we solve the optimal power allocation problem and provide a closed form solution. Next, we analyze the effect of implementing the ARQ protocol on the throughput. We show that by using the proposed power allocation scheme we can minimize the loss of throughput that is caused from the retransmissions. Furthermore, we analyze the effect of the feedback delay length in our scheme.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.