Computer Science > Information Theory
arXiv:2204.00273 (cs)
[Submitted on 1 Apr 2022 (v1), last revised 12 Sep 2022 (this version, v2)]
Title:Globally Optimal Spectrum- and Energy-Efficient Beamforming for Rate Splitting Multiple Access
View a PDF of the paper titled Globally Optimal Spectrum- and Energy-Efficient Beamforming for Rate Splitting Multiple Access, by Bho Matthiesen and 4 other authors
View PDFAbstract:Rate splitting multiple access (RSMA) is a promising non-orthogonal transmission strategy for next-generation wireless networks. It has been shown to outperform existing multiple access schemes in terms of spectral and energy efficiency when suboptimal beamforming schemes are employed. In this work, we fill the gap between suboptimal and truly optimal beamforming schemes and conclusively establish the superior spectral and energy efficiency of RSMA. To this end, we propose a successive incumbent transcending (SIT) branch and bound (BB) algorithm to find globally optimal beamforming solutions that maximize the weighted sum rate or energy efficiency of RSMA in Gaussian multiple-input single-output (MISO) broadcast channels. Numerical results show that RSMA exhibits an explicit globally optimal spectral and energy efficiency gain over conventional multi-user linear precoding (MU-LP) and power-domain non-orthogonal multiple access (NOMA). Compared to existing globally optimal beamforming algorithms for MU-LP, the proposed SIT BB not only improves the numerical stability but also achieves faster convergence. Moreover, for the first time, we show that the spectral/energy efficiency of RSMA achieved by suboptimal beamforming schemes (including weighted minimum mean squared error (WMMSE) and successive convex approximation) almost coincides with the corresponding globally optimal performance, making it a valid choice for performance comparisons. The globally optimal results provided in this work are imperative to the ongoing research on RSMA as they serve as benchmarks for existing suboptimal beamforming strategies and those to be developed in multi-antenna broadcast channels.
| Subjects: | Information Theory (cs.IT); Signal Processing (eess.SP); Optimization and Control (math.OC) |
| Cite as: | arXiv:2204.00273 [cs.IT] |
| (orarXiv:2204.00273v2 [cs.IT] for this version) | |
| https://doi.org/10.48550/arXiv.2204.00273 arXiv-issued DOI via DataCite | |
| Journal reference: | IEEE Transactions on Signal Processing, vol. 70, pp. 5025-5040, Oct. 2022 |
| Related DOI: | https://doi.org/10.1109/TSP.2022.3214376 DOI(s) linking to related resources |
Submission history
From: Bho Matthiesen [view email][v1] Fri, 1 Apr 2022 08:13:19 UTC (186 KB)
[v2] Mon, 12 Sep 2022 18:50:38 UTC (192 KB)
Full-text links:
Access Paper:
- View PDF
- TeX Source
- Other Formats
View a PDF of the paper titled Globally Optimal Spectrum- and Energy-Efficient Beamforming for Rate Splitting Multiple Access, by Bho Matthiesen and 4 other authors
Current browse context:
cs.IT
References & Citations
Bookmark
Bibliographic and Citation Tools
Bibliographic Explorer(What is the Explorer?)
Connected Papers(What is Connected Papers?)
Litmaps(What is Litmaps?)
scite Smart Citations(What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv(What is alphaXiv?)
CatalyzeX Code Finder for Papers(What is CatalyzeX?)
DagsHub(What is DagsHub?)
Gotit.pub(What is GotitPub?)
Hugging Face(What is Huggingface?)
Papers with Code(What is Papers with Code?)
ScienceCast(What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower(What are Influence Flowers?)
CORE Recommender(What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community?Learn more about arXivLabs.