Search arXivSearch

arXiv · 1705.04946

Sequential Hybrid Beamforming Design for Multi-Link mmwave Communication

Abstract

In this paper, we propose a sequential hybrid beamforming design for multi-link transmission over mmwave frequency bands. As a starting point, a baseline data communication link is established via traditional analog beamforming at both the BS and UE. If an extra RF chain is available at the UE, it can continue to probe the propagation environment at the same frequencies. In case the environment is favorable and system resources allow, a secondary data communication link is established to enable multi-stream transmission. In principle, the secondary link could be served by the same BS and/or one or several other BS(s). To initialize the secondary data communication link, a parallel beam search scheme is proposed, which helps the UE/BS to find a suitable beam pair with given optimization criteria without interrupting the baseline data communication. By applying the proposed two-step approach, hybrid beamforming becomes an add-on feature that can be easily switched on over an analog beamforming enabled system without interrupting its operation whenever system requires. Meanwhile, the information obtained by deploying the proposed parallel beam search scheme can also be used for deciding a back-up beam pair if signal blockage occurs to the baseline data communication link.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yaning Zou, Mario Castañeda, Tommy Svensson, Gerhard Fettweis. 2017-05-14. Sequential Hybrid Beamforming Design for Multi-Link mmwave Communication. https://arxiv.org/abs/1705.04946

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