Pith. sign in

REVIEW

Max-Min Fairness of Rate-Splitting Multiple Access with Finite Blocklength Communications

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 2207.05614 v2 pith:E67GU2WU submitted 2022-07-12 cs.IT eess.SPmath.IT

classification cs.ITeess.SPmath.IT
keywords accessmultiplersmafairnessblocklengthcommunicationscooperativerate
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Rate-Splitting Multiple Access (RSMA) has emerged as a flexible and powerful framework for wireless networks. In this paper, we investigate the user fairness of downlink multi-antenna RSMA in short-packet communications with/without cooperative (user-relaying) transmission. We design optimal time allocation and linear precoders that maximize the Max-Min Fairness (MMF) rate with Finite Blocklength (FBL) constraints. The relation between the MMF rate and blocklength of RSMA, as well as the impact of cooperative transmission are investigated for a wide range of network loads. Numerical results demonstrate that RSMA can achieve the same MMF rate as Non-Orthogonal Multiple Access (NOMA) and Space Division Multiple Access (SDMA) with smaller blocklengths (and therefore lower latency), especially in cooperative transmission deployment. Hence, we conclude that RSMA is a promising multiple access for guaranteeing user fairness in low-latency communications.

Discussion (0). Continue with ORCID to comment.

Pith tools