Search arXivSearch

arXiv · 1701.06241

Dual Sub-6 GHz -- Millimeter Wave Beamforming and Communications to Achieve Low Latency and High Energy Efficiency in 5G Systems

Abstract

We propose a hybrid architecture that integrates RF (i.e., sub-6 GHz) and millimeter wave (mmWave) technologies for 5G cellular systems. In particular, communications in the mmWave band faces significant challenges due to variable channels, intermittent connectivity, and high energy usage. On the other hand, speeds for electronic processing of data is of the same order as typical rates for mmWave interfaces which makes the use of complex algorithms for tracking channel variations and adjusting resources accordingly impractical. Our proposed architecture integrates the RF and mmWave interfaces for beamforming and data transfer, and exploits the spatio-temporal correlations between the interfaces. Based on extensive experimentation in indoor and outdoor settings, we demonstrate that an integrated RF/mmWave signaling and channel estimation scheme can remedy the problem of high energy usage and delay associated with mmWave beamforming. In addition, cooperation between two interfaces at the higher layers effectively addresses the high delays caused by highly intermittent mmWave connectivity. We design a scheduler that fully exploits the mmWave bandwidth, while the RF link acts as a fallback mechanism to prevent high delay. To this end, we formulate an optimal scheduling problem over the RF and mmWave interfaces where the goal is to maximize the delay-constrained throughput of the mmWave interface. We prove using subadditivity analysis that the optimal scheduling policy is based on a single threshold that can be easily adopted despite high link variations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Morteza Hashemi, C. Emre Koksal, Ness B. Shroff. 2017-06-08. Dual Sub-6 GHz -- Millimeter Wave Beamforming and Communications to Achieve Low Latency and High Energy Efficiency in 5G Systems. https://arxiv.org/abs/1701.06241

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