Nothing Special   »   [go: up one dir, main page]
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:2207.05614 (cs)
[Submitted on 12 Jul 2022 (v1), last revised 14 Dec 2022 (this version, v2)]

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

Authors:Yunnuo Xu, Yijie Mao, Onur Dizdar, Bruno Clerckx
View PDF
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.
Comments: arXiv admin note: text overlap with arXiv:2105.06198
Subjects: Information Theory (cs.IT); Signal Processing (eess.SP)
Cite as: arXiv:2207.05614 [cs.IT]
  (or arXiv:2207.05614v2 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2207.05614

Submission history

From: Yunnuo Xu [view email]
[v1] Tue, 12 Jul 2022 15:31:33 UTC (826 KB)
[v2] Wed, 14 Dec 2022 13:58:06 UTC (540 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2022-07
Change to browse by:
cs
eess
eess.SP
math
math.IT

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

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

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

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.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)