Precoder Design for Signal Superposition in MIMO-NOMA Multicell Networks

• Published in: IEEE journal on selected areas in communications Vol. 35; no. 12; pp. 2681 - 2695
• Main Authors: Van-Dinh Nguyen, Hoang Duong Tuan, Duong, Trung Q., Poor, H. Vincent, Oh-Soon Shin
• Format: Journal Article
• Language: English
• Published: IEEE 01.12.2017
• Subjects: 5G mobile communication; Array signal processing; Interference; MIMO; Multi-user interference system; multiple-input multiple-output (MIMO); NOMA; non-orthogonal multiple access (NOMA); nonconvex optimization; Quality of service; quality-of-service (QoS); signal superposition; successive interference cancellation (SIC); Symmetric matrices; Throughput
• DOI: 10.1109/JSAC.2017.2726007
• ISSN: 0733-8716

The throughput of users with poor channel conditions, such as those at a cell edge, is a bottleneck in wireless systems. A major part of the power budget must be allocated to serve these users in guaranteeing their quality-of-service (QoS) requirements, hampering QoS for other users, and thus compromising the system reliability. In non-orthogonal multiple access (NOMA), the message intended for a user with a poor channel condition is decoded by itself and by another user with a better channel condition. The message intended for the latter is then successively decoded by itself after canceling the interference of the former. The overall information throughput is thus improved by this particular successive decoding and interference cancellation. This paper aims to design linear precoders/beamformers for signal superposition at the base stations of NOMA multiple-input multiple-output multi-cellular systems to maximize the overall sum throughput subject to the users' QoS requirements, which are imposed independently on the users' channel conditions. This design problem is formulated as the maximization of a highly nonlinear and nonsmooth function subject to nonconvex constraints, which is very computationally challenging. Path-following algorithms for its solution, which invoke only a simple convex problem of moderate dimension at each iteration, are developed. Generating a sequence of improved points, these algorithms converge at least to a local optimum. Extensive numerical simulations are then provided to demonstrate their merit.