Papers
Topics
Authors
Recent
2000 character limit reached

Deep-Learning based Multiuser Detection for NOMA (2011.11752v1)

Published 23 Nov 2020 in cs.IT and math.IT

Abstract: In this paper, we study an application of deep learning to uplink multiuser detection (MUD) for non-orthogonal multiple access (NOMA) scheme based on Welch bound equality spread multiple access (WSMA). Several non-cooperating users, each with its own preassigned NOMA signature sequence (SS), transmit over the same resource. These SSs have low correlation among them and aid in the user separation at the receiver during MUD. Several subtasks such as equalizing, combining, slicing, signal reconstruction and interference cancellation are involved in MUD. The neural network (NN) considered in this paper replaces these well-defined receiver blocks with a single black box, i.e., the NN provides a one-shot approximation for these modules. We consider two different supervised feed-forward NN implementations, namely, a deep NN and a 2D-Convolutional NN, for MUD. Performance of these two NNs is compared with the conventional receivers. Simulation results show that by proper selection of the NN parameters, it is possible for the black box approximation to provide faster and better performance, compared to conventional MUD schemes, and it achieves almost the same symbol error rate as the ultimate one obtained by the complex maximum likelihood-based detectors.

Citations (1)

Summary

We haven't generated a summary for this paper yet.

Slide Deck Streamline Icon: https://streamlinehq.com

Whiteboard

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.