Massive Connectivity with Massive MIMO-Part II: Achievable Rate Characterization
arXiv:1706.06433 · doi:10.1109/TSP.2018.2818070
Abstract
This two-part paper aims to quantify the cost of device activity detection in an uplink massive connectivity scenario with a large number of devices but device activities are sporadic. Part I of this paper shows that in an asymptotic massive multiple-input multiple-output (MIMO) regime, device activity detection can always be made perfect. Part II of this paper subsequently shows that despite the perfect device activity detection, there is nevertheless significant cost due to device detection in terms of overall achievable rate, because of the fact that non-orthogonal pilot sequences have to be used in order to accommodate the large number of potential devices, resulting in significantly larger channel estimation error as compared to conventional massive MIMO systems with orthogonal pilots. Specifically, this paper characterizes each active user's achievable rate using random matrix theory under either maximal-ratio combining (MRC) or minimum mean-squared error (MMSE) receive beamforming at the base-station (BS), assuming the statistics of their estimated channels as derived in Part I. The characterization of user rate also allows the optimization of pilot sequences length. Moreover, in contrast to the conventional massive MIMO system, the MMSE beamforming is shown to achieve much higher rate than the MRC beamforming for the massive connectivity scenario under consideration. Finally, this paper illustrates the necessity of user scheduling for rate maximization when the number of active users is larger than the number of antennas at the BS.
This paper is accepted and to be published in the IEEE Transactions on Signal Processing
References in corpus (2)
Cited by in corpus (27)
- Massive Connectivity with Massive MIMO-Part I: Device Activity Detection and Channel Estimation
- Sparse Signal Processing for Grant-Free Massive Connectivity: A Future Paradigm for Random Access Protocols in the Internet of Things
- Non-Bayesian Activity Detection, Large-Scale Fading Coefficient Estimation, and Unsourced Random Access with a Massive MIMO Receiver
- Sparsity Learning Based Multiuser Detection in Grant-Free Massive-Device Multiple Access
- DNN-Aided Block Sparse Bayesian Learning for User Activity Detection and Channel Estimation in Grant-Free Non-Orthogonal Random Access
- Covariance-Based Joint Device Activity and Delay Detection in Asynchronous mMTC
- Joint Device Activity Detection, Channel Estimation and Signal Detection for Massive Grant-free Access via BiGAMP
- Unifying Message Passing Algorithms Under the Framework of Constrained Bethe Free Energy Minimization
- Blind Goal-Oriented Massive Access for Future Wireless Networks
- Massive Access for 5G and Beyond
- Performance of Hierarchical Sparse Detectors for Massive MTC
- On Capacity Optimality of OAMP: Beyond IID Sensing Matrices and Gaussian Signaling
- Active User Detection and Channel Estimation for Spatial-based Random Access in Crowded Massive MIMO Systems via Blind Super-resolution
- Fixed-Symbol Aided Random Access Scheme for Machine-to-Machine Communications
- Massive Access in Multi-cell Wireless Networks Using Reed-Muller Codes
- Device Activity Detection and Channel Estimation for Millimeter-Wave Massive MIMO
- Cell-Free Massive MIMO with Nonorthogonal Pilots for Internet of Things
- User Activity Detection and Channel Estimation for Grant-Free Random Access in LEO Satellite-Enabled Internet-of-Things
- On the Fundamental Limits of MIMO Massive Access Communication
- Performance Analysis of Cell-Free Massive MIMO Systems with Massive Connectivity
- A Scalable and Energy Efficient IoT System Supported by Cell-Free Massive MIMO
- A D2D-based Protocol for Ultra-Reliable Wireless Communications for Industrial Automation
- Asynchronous Massive Access in Multi-cell Wireless Networks Using Reed-Muller Codes
- Simple Semi-Grant-Free Transmission Strategies Assisted by Non-Orthogonal Multiple Access
- One-Shot Messaging at Any Load Through Random Sub-Channeling in OFDM
- Large-Dimensional Random Matrix Theory and Its Applications in Deep Learning and Wireless Communications
- Random Access for Massive Machine-Type Communications