Search arXivSearch

arXiv · 1511.07057

Indoor Office Plan Environment and Layout-Based MmWave Path Loss Models for 28 GHz and 73 GHz

Abstract

This paper presents large-scale path loss models based on extensive ultra-wideband millimeter-wave propagation measurements performed at 28 GHz and 73 GHz in three typical indoor office layouts -- namely: corridor, open-plan, and closed-plan. A previous study combined all indoor layouts together, while this study separates them for site-specific indoor large-scale path loss model analysis. Measurements were conducted using a 400 megachips-per-second broadband sliding correlator channel sounder with 800 MHz first null-to-null RF bandwidth for 48 transmitter-receiver location combinations with distances ranging 3.9 m to 45.9 m for both co- and cross-polarized antenna configurations in line-of-sight and non-line-of-sight environments. Omnidirectional path loss values were synthesized from over 14,000 directional power delay profiles and were used to generate single-frequency and multi-frequency path loss models for combined, co-, and cross-polarized antennas. Large-scale path loss models that include a cross-polarization discrimination factor are provided for cross-polarized antenna measurements. The results show the value of using the close-in free space reference distance single and multi-frequency path loss models, as they offer simplicity (less parameters) in path loss calculation and prediction, without sacrificing accuracy. Moreover, the current 3GPP floating-intercept path loss model only requires a simple and subtle modification to convert to the close-in free space reference distance models.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

George R. MacCartney Jr., Sija Deng, Theodore S. Rappaport. 2016-02-22. Indoor Office Plan Environment and Layout-Based MmWave Path Loss Models for 28 GHz and 73 GHz. https://arxiv.org/abs/1511.07057

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