Pith. sign in

REVIEW

Resource Allocation for Multi-User Downlink URLLC-OFDMA Systems

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 1901.05825 v1 pith:E5MA4EYN submitted 2019-01-17 cs.IT math.IT

Resource Allocation for Multi-User Downlink URLLC-OFDMA Systems

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

In this paper, we study resource allocation for downlink orthogonal frequency division multiple access (OFDMA) systems with the objective to enable ultra-reliable low latency communication (URLLC). To meet the stringent delay requirements of URLLC, the impact of short packet communication is taken into account for resource allocation algorithm design. In particular, the resource allocation design is formulated as a weighted system sum throughput maximization problem with quality-of-service (QoS) constraints for the URLLC users. The formulated problem is non-convex, and hence, finding the global optimum solution entails a high computational complexity. Thus, an algorithm based on successive convex optimization is proposed to find a sub-optimal solution with polynomial time complexity. Simulation results confirm that the proposed algorithm facilities URLLC and significantly improves the system sum throughput compared to two benchmark schemes.

discussion (0)

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