Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2108.08104

Electromagnetic Modeling of Holographic Intelligent Reflecting Surfaces at Terahertz Bands

Konstantinos Dovelos·Stylianos D. Assimonis·Hien Quoc Ngo·Boris Bellalta·Michail Matthaiou
View original source ↗Read source document ↗Export metadata ↓

Abstract

Intelligent reflecting surface (IRS)-assisted wireless communication is widely deemed a key technology for 6G systems. The main challenge in deploying an IRS-aided terahertz (THz) link, though, is the severe propagation losses at high frequency bands. Hence, a THz IRS is expected to consist of a massive number of reflecting elements to compensate for those losses. However, as the IRS size grows, the conventional far-field assumption starts becoming invalid and the spherical wavefront of the radiated waves must be taken into account. In this work, we focus on the near-field and analytically determine the IRS response in the Fresnel zone by leveraging electromagnetic theory. Specifically, we derive a novel expression for the path loss and beampattern of a holographic IRS, which is then used to model its discrete counterpart. Our analysis sheds light on the modeling aspects and beamfocusing capabilities of THz IRSs.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Konstantinos Dovelos, Stylianos D. Assimonis, Hien Quoc Ngo, Boris Bellalta, Michail Matthaiou. 2021-08-18. Electromagnetic Modeling of Holographic Intelligent Reflecting Surfaces at Terahertz Bands. https://arxiv.org/abs/2108.08104

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↗