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

July 27, 2018 Β· Declared Dead Β· πŸ› IEEE Signal Processing Letters

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors A. Haqiqatnejad, F. Kayhan, B. Ottersten arXiv ID 1807.10619 Category eess.SP: Signal Processing Cross-listed cs.IT Citations 35 Venue IEEE Signal Processing Letters Last Checked 6 months ago
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 $10^3$ in computational time compared to the optimal solution.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Signal Processing

Died the same way β€” πŸ‘» Ghosted