English

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

Signal Processing 2018-07-30 v1 Information Theory math.IT

Abstract

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 10310^3 in computational time compared to the optimal solution.

Keywords

Cite

@article{arxiv.1807.10619,
  title  = {Power Minimizer Symbol-Level Precoding: A Closed-Form Sub-Optimal Solution},
  author = {A. Haqiqatnejad and F. Kayhan and B. Ottersten},
  journal= {arXiv preprint arXiv:1807.10619},
  year   = {2018}
}

Comments

7 pages, 1 figure, 1 table, submitted to IEEE signal processing letters

R2 v1 2026-06-23T03:17:00.164Z