Pith. Sign in

RECORD

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

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
A. Haqiqatnejad, F. Kayhan, B. Ottersten

Signal Processing · Submitted 27 Jul 2018

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim 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.

how it is stated · asserted 0.99 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1807.10619 (version 1)
Pith IDOFGJSQQ6, Pith's permanent record of this paper and its review
CitationA. Haqiqatnejad, B. Ottersten, F. Kayhan. "Power Minimizer Symbol-Level Precoding: A Closed-Form Sub-Optimal Solution." arXiv:1807.10619 (2018). https://pith.science/paper/OFGJSQQ6
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 5,051 input tokens.

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.81 · human participants 0.01 · controlled comparison 0.86 · randomized assignment 0.01 · states quantitative result 0.96 · compares with prior results 0.97 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

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.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 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. contribution 0.58 0.67 0.05 asserted 0.81
s1 Adopting the distance preserving constructive interference regions (DPCIR), we first derive a simplified reformulation of the problem. method 0.94 0.92 0.03 asserted 0.99
s2 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). method 0.54 0.96 0.11 asserted 1.00
s3 This further leads us to a closed-form sub-optimal SLP solution (CF-SLP) for the original problem. contribution 0.85 0.95 0.43 asserted 1.00
s4 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. result 1.00 0.95 0.49 asserted 0.99
s5 The results further indicate that the CF-SLP method has a reduction of order $10^3$ in computational time compared to the optimal solution. result 1.00 0.95 0.19 hedged possibility 0.51

What kind of paper the classifier reports this is: method or tool 0.91 · evidence from simulation or computation 0.55.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original 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.

Human review

How Pith checks papers → · Full audit of this paper →

How the literature uses it

What this paper does with the arXiv papers it cites

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.