Multi-User Visible Light Communications With Probabilistic Constellation Shaping and Precoding

This paper proposes a joint design of probabilistic constellation shaping (PCS) and precoding to enhance the sum-rate performance of multi-user visible light communications (VLC) broadcast channels subject to signal amplitude constraint. In the proposed design, the transmission probabilities of bipolar <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">M</i>-pulse amplitude modulation (<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">M</i>-PAM) symbols for each user and the transmit precoding matrix are jointly optimized to improve the sum-rate performance. The joint design problem is shown to be a complex multivariate non-convex problem due to the non-convexity of the objective function. To tackle the original non-convex optimization problem, the firefly algorithm (FA), a nature-inspired heuristic optimization approach, is employed to solve a local optima. The FA-based approach, however, suffers from high computational complexity. Thus, using zero-forcing (ZF) precoding, we propose a low-complexity design, which is solved using an alternating optimization approach. Additionally, considering the channel uncertainty, a robust design based on the concept of end-to-end learning with autoencoder (AE) is also presented. Simulation results reveal that the proposed joint design with PCS significantly improves the sum-rate performance compared to the conventional design with uniform signaling. For instance, the joint design achieves <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mathbf {17.5\%}$ </tex-math></inline-formula> and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mathbf {19.2\%}$ </tex-math></inline-formula> higher sum-rate for 8-PAM and 16-PAM, respectively, at 60 dB peak amplitude-to-noise ratio. Some insights into the optimal symbol distributions of the two joint design approaches are also provided. Furthermore, our results show the advantage of the proposed robust design over the non-robust one under uncertain channel conditions.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Communications
Published
2025-02-18
DOI
https://doi.org/10.1109/tcomm.2025.3543208
Citations
2
Primary Topic
Optical Wireless Communication Technologies
Type
article
Field-Weighted Citation Impact
1.46

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-User Visible Light Communications With Probabilistic Constellation Shaping and Precoding

Chuyen T. Nguyen, Thanh V. Pham, Hoang D. Le, Thang K. Nguyen et al.
2 citations
IEEE Transactions on Communications
Optical Wireless Communication Technologies
1.46
article

Multi-User Visible Light Communications With Probabilistic Constellation Shaping and Precoding

Chuyen T. Nguyen, Thanh V. Pham, Hoang D. Le, Thang K. Nguyen, Anh T. Pham
article en
2 citations

Abstract

This paper proposes a joint design of probabilistic constellation shaping (PCS) and precoding to enhance the sum-rate performance of multi-user visible light communications (VLC) broadcast channels subject to signal amplitude constraint. In the proposed design, the transmission probabilities of bipolar <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">M</i>-pulse amplitude modulation (<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">M</i>-PAM) symbols for each user and the transmit precoding matrix are jointly optimized to improve the sum-rate performance. The joint design problem is shown to be a complex multivariate non-convex problem due to the non-convexity of the objective function. To tackle the original non-convex optimization problem, the firefly algorithm (FA), a nature-inspired heuristic optimization approach, is employed to solve a local optima. The FA-based approach, however, suffers from high computational complexity. Thus, using zero-forcing (ZF) precoding, we propose a low-complexity design, which is solved using an alternating optimization approach. Additionally, considering the channel uncertainty, a robust design based on the concept of end-to-end learning with autoencoder (AE) is also presented. Simulation results reveal that the proposed joint design with PCS significantly improves the sum-rate performance compared to the conventional design with uniform signaling. For instance, the joint design achieves <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mathbf {17.5\%}$ </tex-math></inline-formula> and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mathbf {19.2\%}$ </tex-math></inline-formula> higher sum-rate for 8-PAM and 16-PAM, respectively, at 60 dB peak amplitude-to-noise ratio. Some insights into the optimal symbol distributions of the two joint design approaches are also provided. Furthermore, our results show the advantage of the proposed robust design over the non-robust one under uncertain channel conditions.

IEEE Transactions on CommunicationsVol. 73(9)
Shizuoka University (JP), University of Aizu (JP), Hanoi University of Science and Technology (VN)
Japan Society for the Promotion of Science
Openalex Percentile: Top 19%
Optical Wireless Communication Technologies
1.46
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.