Reference : One-Bit Quantized Constructive Interference Based Precoding for Massive Multiuser MIM...
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Electrical & electronics engineering
Security, Reliability and Trust
http://hdl.handle.net/10993/44185
One-Bit Quantized Constructive Interference Based Precoding for Massive Multiuser MIMO Downlink
English
Haqiqatnejad, Alireza mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Kayhan, Farbod mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Shahbazpanahi, Shahram mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Ottersten, Björn mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
27-Jul-2020
One-Bit Quantized Constructive Interference Based Precoding for Massive Multiuser MIMO Downlink
Yes
International
IEEE International Conference on Communications (ICC)
from 07-06-2020 to 11-06-2020
IEEE
Dublin
Ireland
[en] Biconvex optimization ; constructive interference ; massive multiuser multiple-input multiple-output downlink ; onebit quantized precoding
[en] We propose a one-bit symbol-level precoding method for massive multiuser multiple-input multiple-output (MU-MIMO) downlink systems using the idea of constructive interference (CI). In particular, 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 and under the restriction that the output of the precoder is a vector of binary elements. This design problem is an NP-hard binary quadratic programming due to the one-bit constraints on the elements of the precoder’s output vector, 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. Our final biconvex reformulation is obtained via an exact penalty approach and can efficiently be solved using a standard block coordinate ascent algorithm. We show through simulation results that the proposed design outperforms the existing schemes in terms of (uncoded) bit error rate. It is further shown via numerical analysis that our solution algorithm is computationally-efficient as it needs only a few tens of iterations to converge in most practical scenarios.
Interdisciplinary Centre for Security, Reliability and Trust (SnT) > SIGCOM
Fonds National de la Recherche - FnR
Researchers ; Professionals ; Students
http://hdl.handle.net/10993/44185
10.1109/ICC40277.2020.9148679
https://ieeexplore.ieee.org/document/9148679
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
Open access
SLP_1BIT.pdfAuthor preprint577.65 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.