Reference : Finite-Alphabet Symbol-Level Multiuser Precoding for Massive MU-MIMO Downlink
Scientific journals : Article
Engineering, computing & technology : Electrical & electronics engineering
Security, Reliability and Trust
http://hdl.handle.net/10993/48793
Finite-Alphabet Symbol-Level Multiuser Precoding for Massive MU-MIMO Downlink
English
Haqiqatnejad, Alireza mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > SigCom >]
Kayhan, Farbod mailto [University of Surrey > Institute for Communication Systems, Department of Electrical and Electronic Engineering]
Shahram, ShahbazPanahi mailto [University of Ontario Institute of Technology > Faculty of Engineering and Applied Science, Department of Electrical, Computer and Software Engineering]
Ottersten, Björn mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
20-Sep-2021
IEEE Transactions on Signal Processing
Institute of Electrical and Electronics Engineers (IEEE)
69
5595 - 5610
Yes
International
1053-587X
United States
[en] Biconvex optimization ; Constructive interference ; Finite-alphabet symbol-level precoding ; Massive MU-MIMO downlink ; One-bit quantized precoding
[en] We propose a finite-alphabet symbol-level precoding technique for massive multiuser multiple-input multiple-output (MU-MIMO) downlink systems which are equipped with finite-resolution digital-to-analog converters (DACs) of any precision. Using the idea of constructive interference (CI), we adopt a max-min fair design criterion which aims to maximize the minimum instantaneous received signal-to-noise ratio (SNR) among the user equipments (UEs) while ensuring a CI constraint for each UE under the restriction that the output of the precoder is a vector with finite-alphabet discrete elements. Due to this latter constraint, the design problem is an NP-hard quadratic program with discrete variables, and hence, is difficult to solve. In this paper, we tackle this difficulty by reformulating the problem in several steps into an equivalent continuous-domain biconvex form, including equivalent representations for discrete and binary constraints. Our final biconvex reformulation is obtained via an exact penalty approach and can efficiently be solved using a standard cyclic block coordinate descent algorithm. We evaluate the performance of the proposed finite-alphabet precoding design for DACs with different resolutions, where it is shown that employing low-resolution DACs can lead to higher power efficiencies. In particular, we focus on a setup with one-bit DACs and show through simulation results that compared to the existing schemes, the proposed design can achieve SNR gains of up to 2 dB. We further provide analytic and numerical analyses of complexity and show that our proposed algorithm is computationally efficient as it typically needs only a few tens of iterations to converge.
Interdisciplinary Centre for Security, Reliability and Trust (SnT) > SIGCOM
Fonds National de la Recherche - FnR
Researchers ; Professionals ; Students
http://hdl.handle.net/10993/48793
10.1109/TSP.2021.3113803
https://ieeexplore.ieee.org/document/9541078
FnR ; FNR11332341 > Farbod Kayhan > ESSTIMS > Enhanced Signal Space Optimization For Satellite Communication Systems > 01/02/2017 > 31/01/2020 > 2016

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
Finite-Alphabet_Symbol-Level_Multiuser_Precoding_for_Massive_MU-MIMO_Downlink.pdfAuthor preprint1.82 MBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.