Massive device connectivity with massive MIMO

This paper studies a single-cell uplink massive device communication scenario in which a large number of single-antenna devices are connected to the base station (BS), but user traffic is sporadic so that at a given coherence interval, only a subset of users are active. For such a system, active user detection and channel estimation are key issues. To accommodate many simultaneously active users, this paper studies an asymptotic regime where the BS is equipped with a large number of antennas. A grant-free two-phase access scheme is adopted where user activity detection and channel estimation are performed in the first phase, and data is transmitted in the second phase. Our main contributions are as follows. First, this paper shows that despite the non-orthogonality of pilot sequences (which is necessary for accommodating a large number of potential devices), in the asymptotic massive multiple-input multiple-output (MIMO) regime, both the missed detection and false alarm probabilities can be made to go to zero by utilizing compressed sensing techniques that exploit sparsity in user activities. Further, this paper shows that despite the guaranteed success in user activity detection, the non-orthogonality of pilot sequences nevertheless can cause significantly larger channel estimation error as compared to the conventional massive MIMO system, thus lowering the overall achievable transmission rate. This paper quantifies the cost due to device detection and channel estimation and illustrates its effect on the optimal pilot length for massive device connectivity.

[1]  Andrea Montanari,et al.  The dynamics of message passing on dense graphs, with applications to compressed sensing , 2010, 2010 IEEE International Symposium on Information Theory.

[2]  Xiao Xu,et al.  Active user detection and channel estimation in uplink CRAN systems , 2015, 2015 IEEE International Conference on Communications (ICC).

[3]  Wei Yu,et al.  On the fundamental limits of massive connectivity , 2017, 2017 Information Theory and Applications Workshop (ITA).

[4]  Erik G. Larsson,et al.  Energy and Spectral Efficiency of Very Large Multiuser MIMO Systems , 2011, IEEE Transactions on Communications.

[5]  Jong Chul Ye,et al.  Belief propagation for joint sparse recovery , 2011, ArXiv.

[6]  Wei Yu,et al.  Sparse Activity Detection for Massive Connectivity , 2018, IEEE Transactions on Signal Processing.

[7]  Carsten Bockelmann,et al.  Exploiting Sparsity in Channel and Data Estimation for Sporadic Multi-User Communication , 2013, ISWCS.

[8]  Andrea Montanari,et al.  Message passing algorithms for compressed sensing: II. analysis and validation , 2009, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[9]  Sundeep Rangan,et al.  Generalized approximate message passing for estimation with random linear mixing , 2010, 2011 IEEE International Symposium on Information Theory Proceedings.

[10]  Wei Yu,et al.  Massive device activity detection by approximate message passing , 2017, 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[11]  Xu Chen,et al.  Capacity of Gaussian Many-Access Channels , 2016, IEEE Transactions on Information Theory.

[12]  Andrea Montanari,et al.  The dynamics of message passing on dense graphs, with applications to compressed sensing , 2010, ISIT.

[13]  Babak Hassibi,et al.  How much training is needed in multiple-antenna wireless links? , 2003, IEEE Trans. Inf. Theory.

[14]  Andrea Montanari,et al.  The Noise-Sensitivity Phase Transition in Compressed Sensing , 2010, IEEE Transactions on Information Theory.