Grant-Free NOMA Using Approximate Message Passing with Multi-Measurement Vector

Author(s):  
Takanori Hara ◽  
Koji Ishibashi
Electronics ◽  
2020 ◽  
Vol 9 (8) ◽  
pp. 1286
Author(s):  
Mengjiang Sun ◽  
Peng Chen

In massive machine-type communications (mMTC) scenarios, grant-free non-orthogonal multiple access becomes crucial due to the small transmission latency, limited signaling overhead and the ability to support massive connectivity. In a multi-user detection (MUD) problem, the base station (BS) is unaware of the active users and needs to detect active devices. With sporadic devices transmitting signals at any moment, the MUD problem can be formulated as a multiple measurement vector (MMV) sparse recovery problem. Through the Khatri–Rao product, we prove that the MMV problem is transformed into a single measurement vector (SMV) problem. Based on the basis pursuit de-noising approximate message passing (BPDN-AMP) algorithm, a novel learning AMP network (LAMPnet) algorithm is proposed, which is designed to reduce the false alarm probability when the required detection probability is high. Simulation results show that when the required detection probablity is high, the AMP algorithm based on LAMPnet noticeably outperforms the traditional algorithms with acceptable computational complexity.


2020 ◽  
Vol 17 (8) ◽  
pp. 187-198
Author(s):  
Chao Li ◽  
Ting Jiang ◽  
Sheng Wu

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 4807-4815 ◽  
Author(s):  
Xiangming Meng ◽  
Jiang Zhu

2018 ◽  
Vol 66 (9) ◽  
pp. 2358-2373 ◽  
Author(s):  
Zhaoyang Zhang ◽  
Xiao Cai ◽  
Chunguang Li ◽  
Caijun Zhong ◽  
Huaiyu Dai

Sign in / Sign up

Export Citation Format

Share Document