Low-Complexity Grouped Symbol-Level Precoding for MU-MISO Systems

Abstract

Symbol-level precoding (SLP), which can convert the harmful multi-user interference (MUI) into beneficial signals, can significantly improve symbol error rate (SER) performance in multi-user communication systems. While enjoying symbolic gain, however, the complicated non-linear symbol-by-symbol SLP design suffers high computational complexity exponential with the number of users, which is unaffordable in realistic systems. In this paper, we propose a novel low-complexity grouped SLP (G-SLP) approach and develop an efficient design algorithm for a typical max-min fairness problem. This practical G-SLP strategy divides all users into several groups. SLP is utilized for the users within each group to convert intra-group MUI into constructive interference, meanwhile the inter-group MUI is also suppressed. In particular, we first use Lagrangian and Karush-Kuhn-Tucker (KKT) conditions to simplify the G-SLP design problem and then propose an iterative majorization-minimization (MM) based algorithm to solve it. Simulation results illustrate that the proposed G-SLP strategy dramatically reduces the computational complexity without causing significant performance loss compared with the traditional SLP scheme.