Search arXivSearch

arXiv · 2412.01165

Double-Directional V2V Channel Measurement using ReRoMA at 60 GHz

Abstract

The coordination of vehicles is a crucial element of autonomous driving, as it enhances the efficiency, convenience, and safety of road traffic. In order to fully exploit the capabilities of such coordination, communication with high data rate and low latency is required. It can be reasonably argued that millimeter-wave (mm-wave) vehicle-to-vehicle (V2V) systems are capable of fulfilling the aforementioned requirements. Nevertheless, in order to develop a system that can be deployed in real-world scenarios and to gain an understanding of the various effects of mm-wave propagation, it is necessary to perform radio propagation measurements and to derive radio channel models from them across a range of scenarios and environments. To this end, we have conducted measurement campaigns at 60\,GHz in a variety of situations, including driving in a convoy, driving in opposite direction on a six-lane road, and overtaking. These measurements employ a channel sounder based on ReRoMA, a recently introduced concept that enables the real-time measurement of dynamic double-directional radio channels. The evaluations presented herein encompass key channel parameters, including the path loss (path loss coefficient of approximately 1.9), the root mean square (RMS) delay spread (within a range of 5\,ns to 110\,ns), the angular spreads (in a range of 0.05 to 0.4), the power distribution among multipath components, and the channel stationarity time (multiple seconds).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hussein Hammoud, Yuning Zhang, Zihang Cheng, Seun Sangodoyin, Markus Hofer, Faruk Pasic, Thomas M. Pohl, Radek Závorka, Ales Prokes, Thomas Zemen, Christoph F. Mecklenbräuker, Andreas F. Molisch. 2024-12-03. Double-Directional V2V Channel Measurement using ReRoMA at 60 GHz. https://arxiv.org/abs/2412.01165

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