Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2111.01758

Universal Path Gain Laws for Common Wireless Communication Environments

Dmitry Chizhik·Jinfeng Du·Reinaldo A. Valenzuela
View original source ↗Read source document ↗Export metadata ↓

Abstract

Simple and accurate expressions for path gain are derived from electromagnetic fundamentals in a wide variety of common environments, including Line-of-Sight (LOS) and Non-Line-of-Sight (NLOS) indoor urban canyons, urban/rural macro, outdoor-indoor and suburban streets with vegetation. Penetration into a scattering region, sometimes aided by guiding, is the "universal" phenomenon shared by the diverse morphologies. Root Mean Square (RMS) errors against extensive measurements are under 5 dB, better than 3GPP models by 1-12 dB RMS, depending on environment. In urban canyons the models have 4.7 dB RMS error, as compared to 7.9 dB from linear fit to data and 13.9/17.2 dB from LOS/NLOS 3GPP models. The theoretical path gains depend on distance as a power law with exponents from a small set {1.5, 2, 2.5, 4}, specific to each morphology. This provides a theoretical justification for widely used power law empirical models. Only coarse environmental data is needed as parameters: street width, building height, vegetation depth, wall material and antenna heights.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dmitry Chizhik, Jinfeng Du, Reinaldo A. Valenzuela. 2022-01-25. Universal Path Gain Laws for Common Wireless Communication Environments. https://doi.org/10.1109/tap.2021.3121173

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↗