Search arXivSearch

arXiv · 1505.02617

Cell-Free Massive MIMO: Uniformly Great Service For Everyone

Abstract

We consider the downlink of Cell-Free Massive MIMO systems, where a very large number of distributed access points (APs) simultaneously serve a much smaller number of users. Each AP uses local channel estimates obtained from received uplink pilots and applies conjugate beamforming to transmit data to the users. We derive a closed-form expression for the achievable rate. This expression enables us to design an optimal max-min power control scheme that gives equal quality of service to all users. We further compare the performance of the Cell-Free Massive MIMO system to that of a conventional small-cell network and show that the throughput of the Cell-Free system is much more concentrated around its median compared to that of the small-cell system. The Cell-Free Massive MIMO system can provide an almost $20-$fold increase in 95%-likely per-user throughput, compared with the small-cell system. Furthermore, Cell-Free systems are more robust to shadow fading correlation than small-cell systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hien Quoc Ngo, Alexei Ashikhmin, Hong Yang, Erik G. Larsson, Thomas L. Marzetta. 2015-05-11. Cell-Free Massive MIMO: Uniformly Great Service For Everyone. https://arxiv.org/abs/1505.02617

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