Search arXivSearch

arXiv · 2202.02169

Wideband Multi-User MIMO Communications with Frequency Selective RISs: Element Response Modeling and Sum-Rate Maximization

Abstract

Reconfigurable Intelligent Surfaces (RISs) are an emerging technology for future wireless communication systems, enabling improved coverage in an energy efficient manner. RISs are usually metasurfaces, constituting of two-dimensional arrangements of metamaterial elements, whose individual response is commonly modeled in the literature as an adjustable phase shifter. However, this model holds only for narrowband communications, and when wideband transmissions are utilized, one has to account for the frequency selectivity of metamaterials, whose response usually follows a Lorentzian-like profile. In this paper, we consider the uplink of a wideband RIS-empowered multi-user Multiple-Input Multiple-Output (MIMO) wireless system with Orthogonal Frequency Division Multiplexing (OFDM) signaling, while accounting for the frequency selectivity of RISs. In particular, we focus on designing the controllable parameters dictating the Lorentzian response of each RIS metamaterial element, in order to maximize the achievable sum rate. We devise a scheme combining block coordinate descent with penalty dual decomposition to tackle the resulting challenging optimization framework. Our simulation results reveal the achievable rates one can achieve using realistically frequency selective RISs in wideband settings, and quantify the performance loss that occurs when using state-of-the-art methods which assume that the RIS elements behave as frequency-flat phase shifters.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Konstantinos D. Katsanos, Nir Shlezinger, Mohammadreza F. Imani, George C. Alexandropoulos. 2022-03-25. Wideband Multi-User MIMO Communications with Frequency Selective RISs: Element Response Modeling and Sum-Rate Maximization. https://arxiv.org/abs/2202.02169

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