Search arXivSearch

arXiv · 1708.00083

Hybrid Beamforming with Selection for Multi-user Massive MIMO Systems

Abstract

This work studies a variant of hybrid beamforming, namely, hybrid beamforming with selection (HBwS), as an attractive solution to reduce the hardware cost of multi-user Massive Multiple-Input-Multiple-Output systems, while retaining good performance. Unlike conventional hybrid beamforming, in a transceiver with HBwS, the antenna array is fed by an analog beamforming matrix with $\bar{L}$ input ports, where $\bar{L}$ is larger than the number of up/down-conversion chains $\bar{K}$. A bank of switches connects the instantaneously best $\bar{K}$ out of the $\bar{L}$ input ports to the up/down-conversion chains. The analog beamformer is designed based on average channel statistics and therefore needs to be updated only infrequently, while the switches operate based on instantaneous channel knowledge. HBwS allows use of simpler hardware in the beamformer that only need to adjust to the statistics, while also enabling the effective analog beams to adapt to the instantaneous channel variations via switching. This provides better user separability, beamforming gain, and/or simpler hardware than some conventional hybrid schemes. In this work, a novel design for the analog beamformer is derived and approaches to reduce the hardware and computational cost of a multi-user HBwS system are explored. In addition, we study how $\bar{L}$, the switch bank architecture, the number of users and the channel estimation overhead impact system performance.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vishnu V. Ratnam, Andreas F. Molisch, Ozgun Y. Bursalioglu, Haralabos C. Papadopoulos. 2018-05-08. Hybrid Beamforming with Selection for Multi-user Massive MIMO Systems. https://doi.org/10.1109/tsp.2018.2838557

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