Abstract

Non-orthogonal multiple access (NOMA) will provide massive connectivity for future Internet of Things. However, the intrinsic non-orthogonality in NOMA makes it non-trivial to approach the performance limit with only conventional communication-theoretic tools. In this paper, we resort to deep multi-task learning for end-to-end optimization of NOMA, by regarding the overlapped transmissions as multiple distinctive but correlated learning tasks. First of all, we establish a unified multi-task deep neural network (DNN) framework for NOMA, namely DeepNOMA, which consists of a channel module, a multiple access signature mapping module, namely DeepMAS, and a multi-user detection module, namely DeepMUD. DeepMAS and DeepMUD are automatically trained in a data-driven fashion, and a multi-task balancing technique is then proposed to guarantee fairness among tasks as well as to avoid local optima. To further exploit the benefits of communication-domain expertise, we introduce constellation shape prior and inter-task interference cancellation structure into DeepMAS and DeepMUD, respectively. These sophisticated designs help to reduce the implementation complexity without sacrificing DNN’s universal function approximation property, which makes DeepNOMA a universal transceiver optimization approach. Detailed experiments and link-level simulations show that higher transmission accuracy and lower computational complexity can be simultaneously achieved by DeepNOMA under various channel models, compared with state-of-the-art.

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.