Constellation-Optimal Beamformers for Multiuser MISO Broadcast Visible Light Communications

In this paper, we design energy-efficient space constellations for multiuser multi-input single-output visible light communication broadcast systems with channel state information (CSI) at the receiver in the three scenarios: 1) with CSI at the transmitter (CSIT); 2) with statistical CSIT; and 3) wi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory 2019-06, Vol.65 (6), p.3848-3870
Hauptverfasser: Zhang, Yan-Yu, Yu, Hong-Yi, Zhang, Jian-Kang
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we design energy-efficient space constellations for multiuser multi-input single-output visible light communication broadcast systems with channel state information (CSI) at the receiver in the three scenarios: 1) with CSI at the transmitter (CSIT); 2) with statistical CSIT; and 3) without CSIT. By utilizing the cooperation of multiuser interference, optimal multidimensional additively uniquely decomposable constellation groups are designed to optimize the received worst case performance metrics of all users subject to two commonly used power constraints, i.e., average and peak optical power constraints. The resulting optimal designs are proved to be pulse amplitude modulated with an optimal beamformer, which can be efficiently attained by numerical search for Scenarios 1 and 2 and be given in a closed form for Scenario 3. One of the common significant advantages of these designs is the fast demodulation of the sum signal from a noisy received signal, since these optimal designs result in an equivalent ideal scalar AWGN channel. Comprehensive computer simulations demonstrate that our designs significantly outperform traditional zero-forcing, minimum mean square error, and time-division methods.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2019.2891726