Dual-Net for Joint Channel Estimation and Data Recovery in Grant-free Massive Access

In massive machine-type communications (mMTC), the conflict between millions of potential access devices and limited channel freedom leads to a sharp decrease in spectral efficiency. The sparse nature of mMTC provides a solution by using compressive sensing (CS) to perform multiuser detection (MUD) but suffers conflict between the high computation complexity and low latency requirements. In this paper, we propose a novel Dual-network for joint channel estimation and data recovery. The proposed Dual-Net utilizes the sparse consistency between the channel vector and data matrix of all users. Experimental results show that the proposed Dual-Net outperforms existing CS algorithms and general neural networks in computation complexity and accuracy, which means reduced access delay and more supported devices.

[1]  Wei Chen,et al.  Contention-based nonorthogonal massive access with massive MIMO , 2020, China Communications.

[2]  B. Ai,et al.  Solving Sparse Linear Inverse Problems in Communication Systems: A Deep Learning Approach With Adaptive Depth , 2020, IEEE Journal on Selected Areas in Communications.

[3]  Wei Chen,et al.  Deep Learning Methods for Solving Linear Inverse Problems: Research Directions and Paradigms , 2020, Signal Process..

[4]  Naveen Mysore Balasubramanya,et al.  Toward the Standardization of Grant-Free Operation and the Associated NOMA Strategies in 3GPP , 2019, IEEE Communications Standards Magazine.

[5]  Sarah J. Johnson,et al.  Grant-Free Non-Orthogonal Multiple Access for IoT: A Survey , 2019, IEEE Communications Surveys & Tutorials.

[6]  P. Fan,et al.  6G Wireless Networks: Vision, Requirements, Architecture, and Key Technologies , 2019, IEEE Vehicular Technology Magazine.

[7]  Wei Chen,et al.  A Grant-Free Access and Data Recovery Method for Massive Machine-Type Communications , 2019, ICC 2019 - 2019 IEEE International Conference on Communications (ICC).

[8]  Wei Chen,et al.  Deep Learning Based Fast Multiuser Detection for Massive Machine-Type Communication , 2018, 2019 IEEE 90th Vehicular Technology Conference (VTC2019-Fall).

[9]  Zhi Chen,et al.  Efficient Multi-User Detection for Uplink Grant-Free NOMA: Prior-Information Aided Adaptive Compressive Sensing Perspective , 2017, IEEE Journal on Selected Areas in Communications.

[10]  Wen Gao,et al.  Maximal Sparsity with Deep Networks? , 2016, NIPS.

[11]  Jonathan Le Roux,et al.  Deep Unfolding: Model-Based Inspiration of Novel Deep Architectures , 2014, ArXiv.

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

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

[14]  Armin Dekorsy,et al.  Sparse Multi-User Detection for CDMA transmission using greedy algorithms , 2011, 2011 8th International Symposium on Wireless Communication Systems.

[15]  Yann LeCun,et al.  Learning Fast Approximations of Sparse Coding , 2010, ICML.

[16]  Andrea Montanari,et al.  Message passing algorithms for compressed sensing: I. motivation and construction , 2009, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[17]  Bo Ai,et al.  A Grant-Free Method for Massive Machine-Type Communication With Backward Activity Level Estimation , 2020, IEEE Transactions on Signal Processing.

[18]  Marc Teboulle,et al.  A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems , 2009, SIAM J. Imaging Sci..