Search arXivSearch

arXiv · 2412.07508

Distributed Uplink Rate Splitting Multiple Access (DU-RSMA): Principles and Performance Analysis

Abstract

One of the main goals of the upcoming sixth-generation (6G) wireless networks is the ability to support higher network density, while ensuring a high quality of service for each user. In this paper, we introduce distributed uplink rate-splitting multiple access (DU-RSMA), define its basic principles, and provide insights into its advantages. Specifically, a system with two remote radio heads (RRHs) and two users is investigated. To improve the performance of the system, we consider that the RRHs can communicate through a feedback link, and thus they are able to decode the received messages either independently or with the assistance of the other RRH, since the decoded information can be shared through the feedback link. It should be noted that this scheme increases the achievable capacity region compared to the known multiple access schemes, which is also evaluated by a novel metric termed ``fill factor''. Both the case of adaptive transmission rates and the case of fixed transmission rates are investigated. To this end, the ergodic rate is investigated to cover the former case, while the outage probability is studied for the latter. Closed-form expressions are derived for both metrics. Finally, the analytical expressions are validated by simulation results, which explicitly show the impact of each parameter on the performance of the system, and prove that the proposed scheme outperforms the corresponding benchmarks.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Apostolos A. Tegos, Yue Xiao, Sotiris A. Tegos, George K. Karagiannidis, Panagiotis D. Diamantoulakis. 2024-12-10. Distributed Uplink Rate Splitting Multiple Access (DU-RSMA): Principles and Performance Analysis. https://arxiv.org/abs/2412.07508

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT