On the Performance of Joint Channel Estimation and MUD for CS-Based Random Access in Multi-Cell Environment

Synchronization, channel estimation, and multi- user detection (MUD) can be performed in a single shot for a comprehensive grant-free access [1]. The scheme employs compressive sensing by exploiting two sparse phenomena: sparsity in users' activity and sparsity in channel delay spread. The performance of compressive sensing based schemes should be thoroughly studied in a multi-cell environment as the other-cell interference (OCI) may affect the underlying sparsity. In this paper, we provide a performance analysis of the comprehensive grant-free access scheme in a multi-cell environment and showed that OCI would not affect the sparsity of the received signal, and rather can be considered as a dispersed noise, if signature allocation among cells is properly handled. Furthermore, we show the performance & complexity of the receiver in contrast with other multiple measurement vector- based receivers modified for joint & blind channel estimation and (MUD).

[1]  Chung Gu Kang,et al.  Iterative Order Recursive Least Square Estimation for Exploiting Frame-Wise Sparsity in Compressive Sensing-Based MTC , 2016, IEEE Communications Letters.

[2]  Chung Gu Kang,et al.  Comprehensive grant-free random access for massive & low latency communication , 2017, 2017 IEEE International Conference on Communications (ICC).

[3]  Carsten Bockelmann,et al.  Compressive sensing based multi‐user detection for machine‐to‐machine communication , 2013, Trans. Emerg. Telecommun. Technol..

[4]  Chen Wang,et al.  Compressive random access for post-LTE systems , 2014, 2014 IEEE International Conference on Communications Workshops (ICC).

[5]  Carsten Bockelmann,et al.  Characterization of coded random access with compressive sensing based multi-user detection , 2014, 2014 IEEE Global Communications Conference.

[6]  Gerhard Wunder,et al.  Compressive Random Access Using a Common Overloaded Control Channel , 2015, 2015 IEEE Globecom Workshops (GC Wkshps).

[7]  Kaushik Mahata,et al.  Zadoff-Chu sequence design for random access initial uplink synchronization , 2016, 1604.01476.

[8]  Joel A. Tropp,et al.  Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit , 2006, Signal Process..

[9]  A. Majumdar,et al.  Fast group sparse classification , 2009, Canadian Journal of Electrical and Computer Engineering.

[10]  Alireza Bayesteh,et al.  Blind detection of SCMA for uplink grant-free multiple-access , 2014, 2014 11th International Symposium on Wireless Communications Systems (ISWCS).

[11]  S. Mallat,et al.  Adaptive greedy approximations , 1997 .

[12]  Zhifeng Yuan,et al.  Non-orthogonal transmission technology in LTE evolution , 2016, IEEE Communications Magazine.

[13]  Alireza Bayesteh,et al.  Uplink contention based SCMA for 5G radio access , 2014, 2014 IEEE Globecom Workshops (GC Wkshps).

[14]  Chung Gu Kang,et al.  Compressive Sensing-Based Random Access with Multiple-Sequence Spreading for MTC , 2015, 2015 IEEE Globecom Workshops (GC Wkshps).