Compressive sensing based multi-user detection for uplink grant-free non-orthogonal multiple access

View Researcher II's Other Codes

Disclaimer: The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).

Authors Bichai Wang, Linglong Dai, Yifei Yuan, Zhaocheng Wang
Journal/Conference Name IEEE 82nd Vehicular Technology Conference (VTC…
Paper Category
Paper Abstract Non-orthogonal multiple access (NOMA) has become one of the promising key technologies for future 5G wireless communications to improve spectral efficiency and support massive connectivity. However, in the uplink grant-free NOMA system, the current near-optimal multi-user detection (MUD) based on message passing algorithm (MPA) assumes that the user activity information is exactly known at the receiver, which is impractical yet challenging due to anyone of massive users can randomly enter or leave the system. In this paper, inspired by the observation of user sparsity, we jointly use compressive sensing (CS) and MPA to propose a CS-MPA detector to realize both user activity and data detection for uplink grant-free NOMA. Specifically, the MUD problem is firstly formulated under CS framework by exploiting user sparsity, and then user activity can be detected by sparse signal recovery algorithms in CS. Then, MPA can be performed to reliably detect active users' data. It is shown that the proposed CS-MPA detector with affordable complexity not only outperforms the conventional MPA detector without user activity information, but also achieves very close performance to the genie- knowledge MPA detector with exact knowledge of user activity, especially when the signal-to-noise ratio (SNR) is high.
Date of publication 2015
Code Programming Language MATLAB
Comment

Copyright Researcher II 2021