Search arXivSearch

arXiv · 2301.12833

Sum-Rate Maximization for Active RIS-Aided Downlink RSMA System

Abstract

In this paper, the problem of sum-rate maximization for an active reconfigurable intelligent surface (RIS) assisted downlink rate-splitting multiple access (RSMA) transmission system is studied. In the considered model, the active RIS is deployed to overcome severe power attenuation, which is caused by the cumulative product of RIS incidence path loss and the reflection path loss. Since the active RIS can adjust both the phase and the amplitude of the incident signal simultaneously, the RIS control scheme requires delicate design to improve RSMA communication performance. To address this issue, a sum-rate maximization problem is formulated to jointly optimize the beamforming vectors, rate allocation vector, and RIS precoding matrix. To solve this non-convex sum-rate maximization problem, an iterative algorithm based on fractional programming (FP) and quadratic constraint quadratic programming (QCQP) is proposed. In particular, the proposed algorithm firstly decomposes the original problem into two subproblems, namely, 1) beamforming and rate allocation optimization and 2) active RIS precoding optimization. The corresponding variables of the two subproblems are optimized through sequential convex approximation (SCA) and block coordinate descent (BCD), respectively. Numerical results show that the proposed active RIS-aided RSMA system could increase the sum-rate by up to 45% over the conventional passive RIS-aided RSMA system with the same energy consumption.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xinhao Li, Tao Wang, Haonan Tong, Zhaohui Yang, Yijie Mao, Changchuan Yin. 2023-01-30. Sum-Rate Maximization for Active RIS-Aided Downlink RSMA System. https://arxiv.org/abs/2301.12833

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