Reference : Symbol-Level Precoding for Low Complexity Transmitter Architectures in Large-Scale An...
Scientific journals : Article
Engineering, computing & technology : Computer science
Computational Sciences
http://hdl.handle.net/10993/38128
Symbol-Level Precoding for Low Complexity Transmitter Architectures in Large-Scale Antenna Array Systems
English
Domouchtsidis, Stavros []
Tsinos, Christos mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Chatzinotas, Symeon 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) > >]
13-Dec-2018
IEEE Transactions on Wireless Communications ( Early Access )
IEEE
1-1
Yes (verified by ORBilu)
International
1536-1276
1558-2248
[en] Radio frequency ; Transmitting antennas ; Antenna arrays ; Precoding ; Computer architecture
[en] In this paper we consider three transmitter designs for symbol-level-precoding (SLP), a technique that mitigates multiuser interference (MUI) in multiuser systems by designing the transmitted signals using the Channel State Information and the information-bearing symbols. The considered systems tackle the high hardware complexity and power consumption of existing SLP techniques by reducing or completely eliminating fully digital Radio Frequency (RF) chains. The first proposed architecture referred as, Antenna Selection SLP, minimizes the MUI by activating a subset of the available antennas and thus, reducing the number of required RF chains to the number of active antennas. In the other two architectures, which we refer to as RF domain SLP, the processing happens entirely in the RF domain, thus eliminating the need for multiple fully digital RF chains altogether. Instead, analog phase shifters directly modulate the signals on the transmit antennas. The precoding design for all the considered cases is formulated as a constrained least squares problem and efficient algorithmic solutions are developed via the Coordinate Descent method. Simulations provide insights on the power efficiency of the proposed schemes and the improvements over the fully digital counterparts.
http://hdl.handle.net/10993/38128
10.1109/TWC.2018.2885525
https://ieeexplore.ieee.org/document/8575164/keywords#keywords

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
1.pdfPublisher postprint1.91 MBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.