Abstract
Non-orthogonal multiple Access (NOMA) is a potential 5G era multiple-access scheme that is proposed for the future mobile Internet and IoT applications which will require enormous increase in data traffic, massive-number of devices connectivity, high spectral efficiency, low-overhead and low-latency. It utilizes the same time-slots, frequency and spreading-codes for all the users. It uses the power-domain and assign different power levels to users for multiple access. The uplink (UL) communication in the present 4G-Networks is performed by the base station (BS) that uses a request-grant mechanism in which a large-overhead and latency is produced. This issue will get more severe in upcoming 5G-Networks. For this purpose, a grant-free NOMA for UL communication, in which dynamic compressed-sensing (DCS) algorithm will perform multi-user detection (MUD) as well as data-detection is proposed. It deploys the temporal-correlation of active-user sets (AUS) in adjacent time-slots from which the estimated AUS is used as the prior-knowledge to estimate AUS in the next time-slot. For the downlink (DL) communication, the proposed system performance evaluation is performed using Rician fading-channels for Cooperative Relaying System (CRS) NOMA. The simulations results show that the proposed DCS-MUD and CRS NOMA over Rician fading-channels perform much better than the conventional CS-MUD and traditional-CRS.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Communication Networks and Information Security (IJCNIS)
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.