Search arXivSearch

arXiv · 1711.10269

Joint Transmit and Circuit Power Minimization in Massive MIMO with Downlink SINR Constraints: When to Turn on Massive MIMO?

Abstract

In this work, we consider the downlink of a multi-cell multiple-input multiple-output (MIMO) system and find the jointly optimal number of base station (BS) antennas and transmission powers that minimize the power consumption while satisfying each user's effective signal-to-interference-and-noise-ratio (SINR) constraint and the BSs' power constraints. Different from prior work, we consider a power consumption model that takes both transmitted and hardware-consumed power into account. We formulate the joint optimization problem for both single-cell and multi-cell systems. Closed-form expressions for the optimal number of BS antennas and transmission powers are derived for the single-cell case. The analysis for the multi-cell case reveals that increasing the number of BS antennas in any cell always improves the performance of the overall system in terms of both feasibility and total radiated power. A key contribution of this work is to show that the joint optimization problem can be relaxed as a geometric programming problem that can be solved efficiently. The solution can be utilized in practice to turn on and off antennas depending on the traffic load variations. Substantial power savings are demonstrated by simulation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kamil Senel, Emil Björnson, Erik G. Larsson. 2019-02-21. Joint Transmit and Circuit Power Minimization in Massive MIMO with Downlink SINR Constraints: When to Turn on Massive MIMO?. https://doi.org/10.1109/twc.2019.2897655

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