Key points are not available for this paper at this time.
In this paper, the sum-rate maximization problem is studied for wireless networks that use downlink rate splitting multiple access (RSMA). In the considered model, the base station (BS) divides the messages that can be transmitted to its users into a “private” part and a “common” part. Here, the common message is a message that multiple users want to receive and the private message is a message that is dedicated to only a specific user. The RSMA mechanism enables a BS to adjust the split of common and private messages so as to control the interference by decoding and treating interference as noise and, thus optimizing the data rate of users. To maximize the users' sum-rate, the network can determine the rate allocation for the common message to meet the rate demand, and adjust the transmit power for the private message to reduce the interference. This problem is formulated as an optimization problem whose goal is to maximize the sum-rate of all users. To solve this nonconvex maximization problem with a single-antenna BS, the optimal power used for transmitting the private message to the users is first obtained in closed form for a given rate allocation and common message power. Based on the optimal private message transmit power, the optimal rate allocation is then derived under a fixed common message transmit power. Subsequently, an iterative algorithm is proposed to obtain a suboptimal solution of common message transmit power. To solve this nonconvex maximization problem with a multiple-antenna BS, a successive convex approximation method is utilized. Simulation results show that the RSMA can achieve up to 15.6% and 21.5% gains in terms of data rate compared to non-orthogonal multiple access (NOMA) and orthogonal frequency-division multiple access (OFDMA), respectively.
Yang et al. (Mon,) studied this question.