RSMA Precoding Design Based on Interference Nulling and Sum Rate Upper Bound

• Published in: IEEE transactions on communications Vol. 71; no. 7; p. 1
• Main Authors: Sadeghabadi, Elaheh, Blostein, Steven
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.07.2023; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Broadcast channel; Complexity; Complexity theory; Interference; Interference cancellation; Maximization; Multiaccess communication; Multiple access; Multiple-input multiple-output communications; NOMA; Non-orthogonal multiple access; Optimization; Precoding; Rate-splitting multiple access; Signal to noise ratio; Space-division multiple access; Splitting; Streams; Sums; Upper bound; Upper bounds
• ISSN: 0090-6778; 1558-0857
• DOI: 10.1109/TCOMM.2023.3277033

Rate splitting multiple access (RSMA), a recent generalization and merging of spatial division multiple access (SDMA) and superposition coding has exponential complexity. Hierarchical streams that transmit a subset of possible streams of encoded messages are proposed for rate splitting and analyzed. To reduce precoding complexity, RSMA with interference nulling (RSMA-IN), that nulls the portion of interference that is not decoded is investigated by formulating a sum rate maximization problem subject to a total power constraint. To solve this non-convex problem, a method that combines interference nulling and stream SNR maximization is proposed. A convex upper bound problem is formulated for the sum rate to compare existing algorithms, and conditions under which the upper bound problem is tight are determined. Taking advantage of the tight cases, we propose an upper bound aided (UBA) enhancement of existing precoding designs by exploiting optimal solutions in the tight cases. It is also shown that the existing augmented weighted mean square error (AWMSE) algorithms cannot converge to a local optimum in sum rate maximization. Simulation results indicate that the proposed approaches enhance performance over existing ones as well as approach their upper bounds in certain instances.