eprintid: 10192803
rev_number: 8
eprint_status: archive
userid: 699
dir: disk0/10/19/28/03
datestamp: 2024-05-29 10:05:43
lastmod: 2024-10-15 08:26:01
status_changed: 2024-05-29 10:05:43
type: article
metadata_visibility: show
sword_depositor: 699
creators_name: Qin, Yuanyuan
creators_name: Li, Ang
creators_name: Lyu, Yuanmeng
creators_name: Liao, Xuewen
creators_name: Masouros, Christos
title: Symbol-Level Precoding for PAPR Reduction in Multi-User MISO-OFDM Systems
ispublished: pub
divisions: UCL
divisions: B04
divisions: C05
divisions: F46
keywords: MU-MISO-OFDM, peak-to-average power ratio
(PAPR), constructive interference (CI), symbol-level precoding
(SLP), alternating optimization, robust design
note: This version is the author accepted manuscript. For information on re-use, please refer to the publisher's terms and conditions.
abstract: In this paper, we study symbol-level precoding (SLP) design for time-domain peak-to-average power ratio (PAPR) reduction in a multi-user MISO-OFDM transmission through the idea of constructive interference (CI). Specifically, we design the precoded transmit signals that minimize the symbol-level transmit power subject to per-antenna time-domain PAPR constraint and CI condition, using the knowledge of both data information and channel state information (CSI), based on which a non-convex problem is established. This non-convex problem is transformed into a convex one by the vectorization and relaxation method. For the relaxed problem, we employ Lagrangian method and Karush-Kuhn-Tucker (KKT) conditions to obtain a closed-form expression on the precoded signals as a function of the Lagrangian multipliers. Subsequently, we study the dual problem and obtain the optimal Lagrangian multipliers via the proposed alternating iterative algorithm. We further consider the practical communication scenario with imperfect CSI, where the original CI constraint is transformed into a probabilistic constraint in order to achieve robustness against statistically CSI errors. Numerical results validate that the proposed low-complexity algorithm achieves an enhanced performance over existing methods in terms of transmit power, PAPR and computation complexity, both in ideal perfect CSI and practical imperfect CSI cases.
date: 2024-09
date_type: published
publisher: Institute of Electrical and Electronics Engineers (IEEE)
official_url: http://dx.doi.org/10.1109/twc.2024.3392764
oa_status: green
full_text_type: other
language: eng
primo: open
primo_central: open_green
verified: verified_manual
elements_id: 2278650
doi: 10.1109/twc.2024.3392764
lyricists_name: Masouros, Christos
lyricists_id: CMASO14
actors_name: Flynn, Bernadette
actors_id: BFFLY94
actors_role: owner
full_text_status: public
publication: IEEE Transactions on Wireless Communications
volume: 23
number: 9
pagerange: 12484 -12498
issn: 1536-1276
citation:        Qin, Yuanyuan;    Li, Ang;    Lyu, Yuanmeng;    Liao, Xuewen;    Masouros, Christos;      (2024)    Symbol-Level Precoding for PAPR Reduction in Multi-User MISO-OFDM Systems.                   IEEE Transactions on Wireless Communications , 23  (9)   12484 -12498.    10.1109/twc.2024.3392764 <https://doi.org/10.1109/twc.2024.3392764>.       Green open access   
 
document_url: https://discovery.ucl.ac.uk/id/eprint/10192803/1/Symbol-Level_Precoding_for_PAPR_Reduction_in_Multi-User_MISO-OFDM_Systems.pdf