Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 77 tok/s
Gemini 2.5 Pro 56 tok/s Pro
GPT-5 Medium 34 tok/s Pro
GPT-5 High 35 tok/s Pro
GPT-4o 103 tok/s Pro
Kimi K2 208 tok/s Pro
GPT OSS 120B 462 tok/s Pro
Claude Sonnet 4.5 32 tok/s Pro
2000 character limit reached

A Practical Max-Min Fair Resource Allocation Algorithm for Rate-Splitting Multiple Access (2306.10930v2)

Published 19 Jun 2023 in cs.IT and math.IT

Abstract: This letter introduces a novel resource allocation algorithm for achieving max-min fairness (MMF) in a rate-splitting multiple access (RSMA) empowered multi-antenna broadcast channel. Specifically, we derive the closed-form solution for the optimal allocation of the common rate among users and the power between the common and private streams for a given practical low-complexity beamforming direction design. Numerical results show that the proposed algorithm achieves 90% of the MMF rate on average obtained by the conventional iterative optimization algorithm while only takes an average of 0.1 millisecond computational time, which is three orders of magnitude lower than the conventional algorithm. It is therefore a practical resource allocation algorithm for RSMA.

Citations (2)

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube