Deep-Learned Approximate Message Passing for Asynchronous Massive Connectivity

  title={Deep-Learned Approximate Message Passing for Asynchronous Massive Connectivity},
  author={Weifeng Zhu and Meixia Tao and Xiaojun Yuan and Yunfeng Guan},
  journal={IEEE Transactions on Wireless Communications},
This paper considers the massive connectivity problem in an asynchronous grant-free random access system, where a huge number of devices sporadically transmit data to a base station (BS) with imperfect synchronization. The goal is to design algorithms for joint user activity detection, delay detection, and channel estimation. By exploiting the sparsity on both user activity and delays, we formulate a hierarchical sparse signal recovery problem in both the single-antenna and the multiple-antenna… 
Asynchronous Massive Access in Multi-cell Wireless Networks Using Reed-Muller Codes
The device identification and message decoding scheme developed in this work can serve as the basis for grant-free massive access for billions of devices with hundreds of simultaneously active devices in each cell.
Joint Channel Estimation, Activity Detection and Decoding using Dynamic Message-Scheduling for Machine-Type Communications
Numerical results show that BiMSGAMP outperforms state-of-the-art algorithms, highlighting the gains achieved by using the dynamic scheduling strategies and the effects of the channel decoding part in the system.


Asynchronous Massive Connectivity with Deep-Learned Approximate Message Passing
This paper considers massive connectivity in asynchronous systems, where a large number of devices sporadically send data to the base station (BS) with imperfect synchronization, and proposes the Learned approximate message passing (LAMP) network that combines deep learning in the AMP framework to solve the problem.
Deep Learning Based Fast Multiuser Detection for Massive Machine-Type Communication
  • Yanna Bai, B. Ai, Wei Chen
  • Computer Science
    2019 IEEE 90th Vehicular Technology Conference (VTC2019-Fall)
  • 2019
A novel block restrictive activation nonlinear unit, is proposed to capture the block sparse structure in wide-band wireless communication systems (or multi-antenna systems) and shows that the proposed approach outperforms various existing algorithms for CS-MUD and allows for ten-fold decrease of the computing time.
Sparse Activity Detection for Massive Connectivity
This paper proposes an AMP algorithm design that exploits the statistics of the wireless channel and provides an analytical characterization of the probabilities of false alarm and missed detection via state evolution and designs the minimum mean squared error denoiser for AMP according to the channel statistics.
Massive Unsourced Random Access Based on Uncoupled Compressive Sensing: Another Blessing of Massive MIMO
The proposed scheme relies on a slotted transmission framework but eliminates the need for concatenated coding that was introduced in the context of the coupled compressive sensing (CCS) paradigm, and can bring performance improvements, at high spectral efficiencies, as compared to a state-of-the-art technique.
Comprehensive grant-free random access for massive & low latency communication
  • A. T. Abebe, C. Kang
  • Computer Science
    2017 IEEE International Conference on Communications (ICC)
  • 2017
A comprehensive grant-free random access scheme for machine-type communication which is characterized by massive connectivity and low latency, designed in such a way that channel estimation and multi-user detection have a bi-directional mutual relationship.
Exploiting Sparsity in Channel and Data Estimation for Sporadic Multi-User Communication
This paper investigates how to adapt several approaches to channel estimation, such that they are suitable for this joint detection and estimation of Compressive Sensing detectors in Multi-User Detection.
Grant-Free Massive MTC-Enabled Massive MIMO: A Compressive Sensing Approach
An algorithm is designed that jointly detects device activity along with embedded information bits and exploits the structured sparsity introduced by the non-coherent transmission scheme and has superior performance compared with application of the original AMP approach.
DNN-Aided Block Sparse Bayesian Learning for User Activity Detection and Channel Estimation in Grant-Free Non-Orthogonal Random Access
Simulation results show that the proposed DNN-MP-BSBL algorithm could improve the UAD and CE accuracy with a smaller number of iterations, indicating its advantages for low-latency grant-free NORA systems.
Massive Connectivity With Massive MIMO—Part I: Device Activity Detection and Channel Estimation
  • Liang Liu, Wei Yu
  • Computer Science
    IEEE Transactions on Signal Processing
  • 2018
It is shown that in the asymptotic massive multiple-input multiple-output regime, both the missed device detection and the false alarm probabilities for activity detection can always be made to go to zero by utilizing compressed sensing techniques that exploit sparsity in the user activity pattern.
Compressive Random Access Using a Common Overloaded Control Channel
A "one shot" random access procedure where users can send a message without a priori synchronizing with the network is introduced and a link between achievable rates and standard compressing sensing estimates is provided.