Efficient Massive Machine Type Communication (mMTC) via AMP

Abstract

We propose efficient and low-complexity multiuser detection (MUD) algorithms for Gaussian multiple access channel (G-MAC) for short-packet transmission in massive machine type communications. To do so, we first formulate the G-MAC MUD problem as a sparse signal recovery problem and obtain the exact and approximate joint prior distribution of the sparse vector to be recovered. Then, we employ the Bayesian approximate message passing (AMP) algorithms with the optimal separable and non-separable minimum mean squared error (MMSE) denoisers for soft decoding of the sparse vector. The effectiveness of the proposed MUD algorithms for a large number of devices is supported by simulation results. For packets of 8 information bits, while the state-of-the-art AMP with soft-threshold denoising achieves 8/100 of the upper bound at Eb/N0 = 4 dB, the proposed algorithms reach 4/7 and 1/2 of the upper bound.

References in corpus (7)

• Message Passing Algorithms for Compressed Sensing
• The dynamics of message passing on dense graphs, with applications to compressed sensing
• Sparse Signal Processing for Grant-Free Massive Connectivity: A Future Paradigm for Random Access Protocols in the Internet of Things
• Finite Sample Analysis of Approximate Message Passing Algorithms
• An Approximate Message Passing Framework for Side Information
• Massive Uncoordinated Multiple Access for Beyond 5G
• Bayesian Optimal Approximate Message Passing to Recover Structured Sparse Signals