Search arXivSearch

arXiv · 1805.10621

Spectral Efficiency Analysis of Cell-Free Massive MIMO Systems with Zero-Forcing Detector

Abstract

In this paper, we firstly derive two approximations of the achievable uplink rate with the perfect/imperfect channel state information (CSI) in cell-free massive multi-input multi-output (MIMO) systems, and all these approximations are not only in the simple, but also converge into the classical bounds achieved in conventional massive MIMO systems where the base-station (BS) antennas are co-located. It is worth noting that the obtained two approximations with perfect CSI could be regarded as the special cases of the obtained two approximations with imperfect CSI when the pilot sequence power becomes infinite, respectively. Moreover, the theory analysis shows that all obtained approximations with perfect/imperfect CSI have an asymptotic lower bound $\fracα{2}\log_2 L$ thanks to the extra {\emph {distance diversity}} offered by massively distributed antennas, where $L$ is the number of BS antennas and the path-loss factor $α>2$, except for the free space environment. Obviously, these results indicate that the cell-free massive MIMO system has huge potential of spectral efficiency than the conventional massive MIMO system with the asymptotically tight bound $\log_2 L$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pei Liu, Kai Luo, Da Chen, Tao Jiang. 2019-11-05. Spectral Efficiency Analysis of Cell-Free Massive MIMO Systems with Zero-Forcing Detector. https://doi.org/10.1109/twc.2019.2948841

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