Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1701.08906

On-off Analog Beamforming for Massive MIMO

Shengli Zhang·Chongtao Guo·Taotao Wang·Wei Zhang
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper investigates a new analog beamforming architecture for massive multiple-input multiple-output (MIMO) systems, where each of the multiple transmit antennas is switched to be on or off to form a beam according to the channel state information at transmitters. This on-off analog beamforming (OABF) scheme has the advantages in terms of both hardware complexities and algorithmic complexities. OABF can completely remove the high-cost, power-consuming and bulky analog phase-shifters that are extensively employed by traditional analog beamforming schemes; it only requires the deployment of low-cost analog switches that are easy to implement. Moreover, we show that the beams formed by such simple antenna on-off switch operations can achieve rather good performances with low-complexity beamforming algorithms. Specifically, we first propose two optimal signal-to-noise ratio maximization algorithms to determine the on-off state of each switch under the per-antenna power constraint and the total power constraint, respectively. After that, we theoretically prove that OABF can achieve the full diversity gain and the full array gain with complexities up to a polynomial order. Numerical results are consistent with our theoretical analysis. We believe that the simple structure of OABF makes massive MIMO much easier to implement in real systems.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shengli Zhang, Chongtao Guo, Taotao Wang, Wei Zhang. 2017-01-31. On-off Analog Beamforming for Massive MIMO. https://arxiv.org/abs/1701.08906

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗