Search arXivSearch

arXiv · 2412.07359

Characterization of Indoor RIS-Assisted Channels at 304 GHz: Experimental Measurements, Challenges, and Future Directions

Abstract

Reconfigurable Intelligent Surfaces (RISs) are expected to play a pivotal role in future indoor ultra high data rate wireless communications as well as highly accurate three-dimensional localization and sensing, mainly due to their capability to provide flexible, cost- and power-efficient coverage extension, even under blockage conditions. However, when considering beyond millimeter wave frequencies where there exists GHz-level available bandwidth, realistic models of indoor RIS-parameterized channels verified by field-trial measurements are unavailable. In this article, we first present and characterize three RIS prototypes with $100\times100$ unit cells of half-wavelength inter-cell spacing, which were optimized to offer a specific non-specular reflection with $1$-, $2$-, and $3$-bit phase quantization at $304$ GHz. The designed static RISs were considered in an indoor channel measurement campaign carried out with a $304$ GHz channel sounder. Channel measurements for two setups, one focusing on the transmitter-RIS-receiver path gain and the other on the angular spread of multipath components, are presented and compared with both state-of-the-art theoretical models as well as full-wave simulation results. The article is concluded with a list of challenges and research directions for RIS design and modeling of RIS-parameterized channels at THz frequencies.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

George C. Alexandropoulos, Bo Kum Jung, Panagiotis Gavriilidis, Sérgio Matos, Lorenz H. W. Loeser, Varvara Elesina, Antonio Clemente, Raffaele D'Errico, Luís M. Pessoa, Thomas Kürner. 2024-12-10. Characterization of Indoor RIS-Assisted Channels at 304 GHz: Experimental Measurements, Challenges, and Future Directions. https://arxiv.org/abs/2412.07359

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