Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Thang K. Nguyen

dblp:299/0429 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2025
0000-0002-2968-8043ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3 · 3 first-author · 3 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Physical-layer communications · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications
modulation
0.912025
Multi-User Visible Light Communications With Probabilistic Constellation Shaping and Precoding · IEEE Trans. Commun. 2025
Physical-layer communications › MIMO › precoding
multiuser precoding
0.912025
Multi-User Visible Light Communications With Probabilistic Constellation Shaping and Precoding · IEEE Trans. Commun. 2025
Physical-layer communications › modulation › constellation design
probabilistic constellation shaping
0.912025
Multi-User Visible Light Communications With Probabilistic Constellation Shaping and Precoding · IEEE Trans. Commun. 2025
Physical-layer communications › modulation › pulse modulation
pulse amplitude modulation
0.912025
Multi-User Visible Light Communications With Probabilistic Constellation Shaping and Precoding · IEEE Trans. Commun. 2025
Physical-layer communications › optical wireless communication
visible light communication
0.912025
Multi-User Visible Light Communications With Probabilistic Constellation Shaping and Precoding · IEEE Trans. Commun. 2025
Physical-layer communications › channel state information
channel uncertainty
0.312025
Multi-User Visible Light Communications With Probabilistic Constellation Shaping and Precoding · IEEE Trans. Commun. 2025
Physical-layer communications › MIMO › precoder design
robust precoding
0.312025
Multi-User Visible Light Communications With Probabilistic Constellation Shaping and Precoding · IEEE Trans. Commun. 2025

Methods — techniques the papers use, named apart from their topics

zero-forcing precoding · 0.9firefly algorithm · 0.9autoencoder end-to-end learning · 0.9alternating optimization · 0.9
YearPublicationVenuePosition
2025 Multi-User Visible Light Communications With Probabilistic Constellation Shaping and Precoding
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 bipolarM-pulse amplitude modulation (M-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$\mathbf {17.5\%}$and$\mathbf {19.2\%}$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.
Thang K. Nguyen, Thanh V. Pham, Hoang D. Le, Chuyen T. Nguyen, Anh T. Pham 0002
IEEE Trans. Commun.1
2024 Joint Design of Probabilistic Constellation Shaping and Precoding for Multi-user VLC Systems
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 M-pulse amplitude modulation (M-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 non-convex problem due to the non-convexity of the objective function. To tackle the problem, the firefly algorithm (FA), a nature-inspired heuristic optimization approach, is employed to solve a local optima to the original non-convex optimization problem. The FA-based approach, however, suffers from high computational complexity. Therefore, we propose a low-complexity design based on zero-forcing (ZF) precoding, which is solved using an alternating optimization (AO) approach. Simulation results reveal that the proposed joint design with PCS significantly improves the sum-rate performance compared to the conventional design with uniform signaling. Some insights into the optimal symbol distributions of the two joint design approaches are also provided.
Thang K. Nguyen, Thanh V. Pham, Hoang D. Le, Chuyen T. Nguyen, Anh T. Pham 0002
GLOBECOM1
2024 On the Energy Efficiency of RSMA-Based VLC Systems with Confidential Private Messages
abstract
This paper investigates the energy efficiency (EE) of rate-splitting multiple access (RSMA)-based visible light communications (VLC) with confidential private messages. We first formulate an EE maximization problem that takes into account the achievable rate of the common message and the sum secrecy rate of private messages. Due to the fractional non-convex nature of the design problem, an algorithm that leverages the Dinkelbach algorithm and convex-concave procedure (CCP) is proposed to solve local optima. In this study, the channel similarity$S_{C}$and the rate-splitting power allocation ratio$\rho$are jointly considered to evaluate EE performance and trade-offs between the achievable common rate and the sum secrecy rate. Numerical results reveal that when$S_{C}$is below 0.7, the EE saturates at its optimum as$\rho$increases, while when$S_{C}$exceeds 0.7, an optimal$\rho$exists beyond which the EE starts declining. Moreover, it is observed that while the relationship between the sum secrecy rate and$S_{C}$is inversely proportional, it is directly proportional in the case of the common rate.
Thang K. Nguyen, Thanh V. Pham, Chuyen T. Nguyen, Anh T. Pham 0002
WCNC1