Abstract
Exploiting the sparse activity of users, compressed sensing (CS) has been of interest in multiuser detection (MUD) for non-orthogonal multiple access (NOMA), to enable a massive connection of users in machine-type communications (MTC). In this letter, we propose a greedy algorithm with unknown sparsity level for CS-based multiuser activity and data detection in uplink grant-free NOMA. To accommodate practical scenarios, the algorithm employs a criterion to stop the iteration with no prior knowledge of sparsity level. Also, it requires no knowledge of noise variance by computing the log-likelihood ratios (LLR) approximately in its operation. With no need of sparsity and noise levels, we perform CS-based MUD with low complexity. Simulation results demonstrate that the proposed algorithm outperforms conventional CS-based solutions, nearly achieving the oracle performance of fully known supports.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.