mlsanityData to 14 Oct 2026

Power Minimizer Symbol-Level Precoding: A Closed-Form Sub-Optimal Solution

arXiv 1807.10619 ↗First posted 27 Jul 2018eess.SP cs.IT math.ITcited by 1

Not on the map. Why?

Abstract (arXiv)

In this letter, we study the optimal solution of the multiuser symbol-level precoding (SLP) for minimization of the total transmit power under given signal-to-interference-plus-noise ratio (SINR) constraints. Adopting the distance preserving constructive interference regions (DPCIR), we first derive a simplified reformulation of the problem. Then, we analyze the structure of the optimal solution using the Karush-Kuhn-Tucker (KKT) optimality conditions, thereby we obtain the necessary and sufficient condition under which the power minimizer SLP is equivalent to the conventional zero-forcing beamforming (ZFBF). This further leads us to a closed-form sub-optimal SLP solution (CF-SLP) for the original problem. Simulation results show that CF-SLP provides significant gains over ZFBF, while performing quite close to the optimal SLP in scenarios with rather small number of users. The results further indicate that the CF-SLP method has a reduction of order 103 in computational time compared to the optimal solution.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 27 Jul 2018.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.