Search arXivSearch

arXiv · 2110.00833

Communication Models for Reconfigurable Intelligent Surfaces: From Surface Electromagnetics to Wireless Networks Optimization

Abstract

A reconfigurable intelligent surface (RIS) is a planar structure that is engineered to dynamically control the electromagnetic waves. In wireless communications, RISs have recently emerged as a promising technology for realizing programmable and reconfigurable wireless propagation environments through nearly passive signal transformations. With the aid of RISs, a wireless environment becomes part of the network design parameters that are subject to optimization. In this tutorial paper, we focus our attention on communication models for RISs. First, we review the communication models that are most often employed in wireless communications and networks for analyzing and optimizing RISs, and elaborate on their advantages and limitations. Then, we concentrate on models for RISs that are based on inhomogeneous sheets of surface impedance, and offer a step-by-step tutorial on formulating electromagnetically-consistent analytical models for optimizing the surface impedance. The differences between local and global designs are discussed and analytically formulated in terms of surface power efficiency and reradiated power flux through the Poynting vector. Finally, with the aid of numerical results, we discuss how approximate global designs can be realized by using locally passive RISs with zero electrical resistance (i.e., inhomogeneous reactance boundaries with no local power amplification), even for large angles of reflection and at high power efficiency.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marco Di Renzo, Fadil H. Danufane, Sergei Tretyakov. 2022-07-12. Communication Models for Reconfigurable Intelligent Surfaces: From Surface Electromagnetics to Wireless Networks Optimization. https://arxiv.org/abs/2110.00833

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