Abstract

Non-orthogonal multiple access (NOMA) is an emerging research topic in the future fifth generation wireless communication networks, which is expected to support massive connectivity for massive machine-type communications (mMTC). Due to the sporadic communication nature of mMTC, the grant-free transmission methodology is highly expected in uplink NOMA systems, to drastically reduce the transmission latency and signaling overhead. Exploiting the inherent sparsity nature of user activity, compressive sensing (CS) techniques have been applied for efficient multi-user detection in the uplink grant-free NOMA. In this paper, we propose a prior-information-aided adaptive subspace pursuit (PIA-ASP) algorithm to improve the multi-user detection performance. In this algorithm, a parameter evaluating the quality of the prior-information support set is introduced, in order to exploit the intrinsically temporal correlation of active user support sets in several continuous time slots adaptively. Then, to mitigate the incorrect estimation effect of the prior support quality information, a robust PIA-ASP algorithm is further proposed, which adaptively exploits the prior support based on the corresponding support quality information in a conservative way. It is noted that both of the two proposed algorithms do not require the knowledge of the user sparsity level, while most of the state-of-the-art CS-based multi-user detection algorithms usually need. Moreover, for the two proposed algorithms, the upper bound of the signal detection error and the computational complexity is derived. Simulation results demonstrate that the two proposed algorithms are capable of achieving much better performance than that of the existing CS-based multi-user detection algorithms with a similar computational complexity.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.