Search arXivSearch

arXiv · 1605.04283

Modeling and Analyzing Millimeter Wave Cellular Systems

Abstract

We provide a comprehensive overview of mathematical models and analytical techniques for millimeter wave (mmWave) cellular systems. The two fundamental physical differences from conventional Sub-6GHz cellular systems are (i) vulnerability to blocking, and (ii) the need for significant directionality at the transmitter and/or receiver, which is achieved through the use of large antenna arrays of small individual elements. We overview and compare models for both of these factors, and present a baseline analytical approach based on stochastic geometry that allows the computation of the statistical distributions of the downlink signal-to-interference-plus-noise ratio (SINR) and also the per link data rate, which depends on the SINR as well as the average load. There are many implications of the models and analysis: (a) mmWave systems are significantly more noise-limited than at Sub-6GHz for most parameter configurations; (b) initial access is much more difficult in mmWave; (c) self-backhauling is more viable than in Sub-6GHz systems which makes ultra-dense deployments more viable, but this leads to increasingly interference-limited behavior; and (d) in sharp contrast to Sub-6GHz systems cellular operators can mutually benefit by sharing their spectrum licenses despite the uncontrolled interference that results from doing so. We conclude by outlining several important extensions of the baseline model, many of which are promising avenues for future research.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jeffrey G. Andrews, Tianyang Bai, Mandar Kulkarni, Ahmed Alkhateeb, Abhishek Gupta, Robert W. Heath Jr. 2016-05-13. Modeling and Analyzing Millimeter Wave Cellular Systems. https://doi.org/10.1109/tcomm.2016.2618794

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