Search arXivSearch

arXiv · 1709.02950

Spectral and Energy Efficiency of Cell-Free Massive MIMO Systems with Hardware Impairments

Abstract

Cell-free massive multiple-input multiple-output (MIMO), with a large number of distributed access points (APs) that jointly serve the user equipments (UEs), is a promising network architecture for future wireless communications. To reduce the cost and power consumption of such systems, it is important to utilize low-quality transceiver hardware at the APs. However, the impact of hardware impairments on cell-free massive MIMO has thus far not been studied. In this paper, we take a first look at this important topic by utilizing well-established models of hardware distortion and deriving new closed-form expressions for the spectral and energy efficiency. These expressions provide important insights into the practical impact of hardware impairments and also how to efficiently deploy cell-free systems. Furthermore, a novel hardware-quality scaling law is presented. It proves that the impact of hardware impairments at the APs vanish as the number of APs grows. Numerical results validate that cell-free massive MIMO systems are inherently resilient to hardware impairments.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiayi Zhang, Yinghua Wei, Emil Björnson, Yu Han, Xu Li. 2017-09-09. Spectral and Energy Efficiency of Cell-Free Massive MIMO Systems with Hardware Impairments. https://arxiv.org/abs/1709.02950

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