pith. sign in

arxiv: 1811.03324 · v1 · pith:PEOLOJ7Snew · submitted 2018-11-08 · 💻 cs.IT · eess.SP· math.IT

Fundamental Asymptotic Behavior of (Two-User) Distributed Massive MIMO

classification 💻 cs.IT eess.SPmath.IT
keywords asymptoticcapacitychannelglobalcombininginftyschemeunbounded
0
0 comments X
read the original abstract

This paper considers the uplink of a distributed Massive MIMO network where $N$ base stations (BSs), each equipped with $M$ antennas, receive data from $K=2$ users. We study the asymptotic spectral efficiency (as $M\to \infty$) with spatial correlated channels, pilot contamination, and different degrees of channel state information (CSI) and statistical knowledge at the BSs. By considering a two-user setup, we can simply derive fundamental asymptotic behaviors and provide novel insights into the structure of the optimal combining schemes. In line with [1], when global CSI is available at all BSs, the optimal minimum-mean squared error combining has an unbounded capacity as $M\to \infty$, if the global channel covariance matrices of the users are asymptotically linearly independent. This result is instrumental to derive a suboptimal combining scheme that provides unbounded capacity as $M\to \infty$ using only local CSI and global channel statistics. The latter scheme is shown to outperform a generalized matched filter scheme, which also achieves asymptotic unbounded capacity by using only local CSI and global channel statistics, but is derived following [2] on the basis of a more conservative capacity bound.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.