Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2104.12108

On the Achievable Sum-rate of the RIS-aided MIMO Broadcast Channel

Nemanja Stefan Perović·Le-Nam Tran·Marco Di Renzo·Mark F. Flanagan
View original source ↗Read source document ↗Export metadata ↓

Abstract

Reconfigurable intelligent surfaces (RISs) represent a new technology that can shape the radio wave propagation and thus offers a great variety of possible performance and implementation gains. Motivated by this, we investigate the achievable sum-rate optimization in a broadcast channel (BC) that is equipped with an RIS. We exploit the well-known duality between the Gaussian multiple-input multiple-output (MIMO) BC and multiple-access channel (MAC) to derive an alternating optimization (AO) algorithm which optimizes the users' covariance matrices and the RIS phase shifts in the dual MAC. The optimal users' covariance matrices are obtained by a dual decomposition method in which each iteration is solved in closed-form. The optimal RIS phase shifts are also computed using a derived closed-form expression. Furthermore, we present a computational complexity analysis for the proposed AO algorithm. Simulation results show that the proposed AO algorithm can provide significant achievable sum-rate gains in a BC.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nemanja Stefan Perović, Le-Nam Tran, Marco Di Renzo, Mark F. Flanagan. 2021-09-03. On the Achievable Sum-rate of the RIS-aided MIMO Broadcast Channel. https://arxiv.org/abs/2104.12108

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗