UCL Discovery Stage
UCL home » Library Services » Electronic resources » UCL Discovery Stage

Speeding-up Symbol-Level Precoding Using Separable and Dual Optimizations

Yang, J; Li, A; Liao, X; Masouros, C; (2023) Speeding-up Symbol-Level Precoding Using Separable and Dual Optimizations. IEEE Transactions on Communications , 71 (12) 7056 -7071. 10.1109/TCOMM.2023.3308149. Green open access

[thumbnail of Speeding-up_Symbol-Level_Precoding_Using_Separable_and_Dual_Optimizations.pdf]
Preview
Text
Speeding-up_Symbol-Level_Precoding_Using_Separable_and_Dual_Optimizations.pdf - Accepted Version

Download (948kB) | Preview

Abstract

Symbol-level precoding (SLP) can fully exploit the multi-user interference in the downlink. This paper investigates fast SLP algorithms for phase-shift keying (PSK) and quadrature amplitude modulation (QAM). In particular, we prove that the weighted max-min signal-to-interference-plus-noise ratio (SINR) balancing (SB) SLP problem with PSK signaling is not separable, which is contrary to the power minimization (PM) SLP problem, and accordingly, existing decomposition methods are not applicable. To tackle this issue, we establish an explicit duality between the SB-SLP and PM-SLP problems with PSK modulation. The proposed duality enables simultaneously obtaining the solutions to the SB-SLP and PM-SLP problems. We concurrently propose a closed-form power scaling algorithm to address the SB-SLP problem by the solution to the PM-SLP problem, via which the separability can be leveraged to decompose the problem. In terms of QAM signaling, a succinct model is used to formulate the PM-SLP problem and convert it into a separable equivalent. The new problem is decomposed into several simple parallel subproblems with closed-form solutions, employing the proximal Jacobian alternating direction method of multipliers (PJ-ADMM). We further prove that the proposed duality can be generalized to the multi-level modulation case, based on which a power scaling parallel inverse-free algorithm is proposed to solve the SB-SLP problem with QAM signaling. Numerical results show that the proposed algorithms offer optimal performance with lower complexity than the state-of-the-art.

Type: Article
Title: Speeding-up Symbol-Level Precoding Using Separable and Dual Optimizations
Open access status: An open access version is available from UCL Discovery
DOI: 10.1109/TCOMM.2023.3308149
Publisher version: https://doi.org/10.1109/TCOMM.2023.3308149
Language: English
Additional information: This version is the author accepted manuscript. For information on re-use, please refer to the publisher's terms and conditions.
Keywords: MU-MISO, symbol-level precoding, separability, duality, inverse problem, ADMM.
UCL classification: UCL
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Electronic and Electrical Eng
URI: https://discovery-pp.ucl.ac.uk/id/eprint/10176249
Downloads since deposit
123Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item