Search arXivSearch

arXiv · 2306.03761

Generalised Impedance Model of Wireless Links Assisted by Reconfigurable Intelligent Surfaces

Abstract

We devise an end-to-end communication channel model that describes the performance of RIS-assisted MIMO wireless links. The model borrows the impedance (interaction) matrix formalism from the Method of Moments and provides a physics-based communication model. In configurations where the transmit and receive antenna arrays are distant from the RIS beyond a wavelength, a reduced model provides accurate results for arbitrary RIS unit cell geometry. Importantly, the simplified model configures as a cascaded channel transfer matrix whose mathematical structure is compliant with widely accepted, but less accurate, system level RIS models. A numerical validation of the communication model is presented for the design of binary RIS structures with scatterers of canonical geometry. Attained results are consistent with path-loss models: For obstructed line-of-sight between transmitter and receiver, the channel capacity of the (optimised) RIS-assisted link scales as $R^{-2}$, with $R$ RIS-receiver distance at fixed transmitter position. Our results shows that the applicability of communication models based on mutual impedance matrices is not restricted to canonical minimum scattering RIS unit cells.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Keisuke Konno, Sergio Terranova, Qiang Chen, Gabriele Gradoni. 2023-06-06. Generalised Impedance Model of Wireless Links Assisted by Reconfigurable Intelligent Surfaces. https://arxiv.org/abs/2306.03761

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