Pith. sign in

REVIEW

RSMA for Overloaded MIMO Networks: Low-Complexity Design for Max-Min Fairness

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 2306.13693 v2 pith:HJYPBUJS submitted 2023-06-23 cs.IT math.IT

classification cs.ITmath.IT
keywords rsmadesignlow-complexityaccessmultiplenetworksnumberantennas
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) is a robust multiple access scheme for multi-antenna wireless networks. In this work, we study the performance of RSMA in downlink overloaded networks, where the number of transmit antennas is smaller than the number of users. We provide analysis and closed-form solutions for optimal power and rate allocations that maximize max-min fairness when low-complexity precoding schemes are employed. The derived closed-form solutions are used to propose a low-complexity RSMA system design for precoder selection and resource allocation for arbitrary number of users and antennas under perfect and imperfect Channel State Information at the Transmitter (CSIT). We compare the performance of the proposed design with benchmark designs based on Space Division Multiple Access (SDMA) with and without user scheduling. By numerical results, we show that the proposed low-complexity RSMA design achieves a significantly higher rate compared to the SDMA-based benchmark designs under perfect and imperfect CSIT.

Discussion (0). Continue with ORCID to comment.

Pith tools