Search arXivSearch

arXiv · 2410.22852

Centimeter-level Geometry Reconstruction and Material Identification in 300 GHz Monostatic Sensing

Abstract

Terahertz (THz) integrated sensing and communication (ISAC) technology is envisioned to achieve high communication performance alongside advanced sensing abilities. For various applications of ISAC, accurate environment reconstruction including geometry reconstruction and material identification is critical. This paper presents a highly precise geometry reconstruction algorithm and material identification scheme for a monostatic sensing case in a typical indoor scenario. Experiments are conducted in the frequency range from 290 GHz to 310 GHz using a vector network analyzer (VNA)-based channel sounder by co-locating the transmitter and receiver. A joint delay and angle space-alternating generalized expectation-maximization (SAGE)-based algorithm is implemented to estimate multipath component (MPC) parameters and the indoor geometry is reconstructed based on the extracted parameters. Furthermore, a geometry-based method is employed to model and remove the spurious path of the corner, reaching an accuracy of 1.75 cm. Additionally, a material database using THz time-domain spectroscopy (THz-TDS) is established, capturing reflection losses of over 200 common material samples. Applying this database to our monostatic sensing, the measured reflection losses of wall and window frame are accurately identified as cement and steel, respectively. Our results demonstrate the centimeter-level geometry reconstruction and accurate material identification for practical THz ISAC scenarios, which unleash unprecedented sensing potential compared to microwave and millimeter-wave bands.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zitong Fang, Ziming Yu, Chong Han. 2024-10-30. Centimeter-level Geometry Reconstruction and Material Identification in 300 GHz Monostatic Sensing. https://arxiv.org/abs/2410.22852

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