Efficient Massive Machine Type Communication (mMTC) via AMP
Authors:
- Mostafa MohammadkarimiMMMostafa Mohammadkarimi
- Masoud ArdakaniMAMasoud Ardakani
Preprint
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.Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Learning-Based Sparse Recovery for Joint Activity Detection and Channel Estimation in Massive Random Access SystemsIEEE Wireless Communications Letters, 2022
- Massive Gaussian Multiple-Access by Random Coding With Soft Interference Cancellation2021
- Detection Techniques for Massive Machine-Type Communications: Challenges and SolutionsIEEE Access, 2020
- Improved bounds on Gaussian MAC and sparse regression via Gaussian inequalities2019
- NOMA-Based Compressive Random Access Using Gaussian SpreadingIEEE Transactions on Communications, 2019
- State evolution for approximate message passing with non-separable functionsInformation and Inference: A Journal of the IMA, 2019
- Signature-Based Nonorthogonal Massive Multiple Access for Future Wireless Networks: Uplink Massive Connectivity for Machine-Type CommunicationsIEEE Vehicular Technology Magazine, 2018
- Sparse Signal Processing for Grant-Free Massive Connectivity: A Future Paradigm for Random Access Protocols in the Internet of ThingsIEEE Signal Processing Magazine, 2018
- The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed SensingIEEE Transactions on Information Theory, 2011
- Message-passing algorithms for compressed sensingProceedings of the National Academy of Sciences of the United States of America, 2009