TY - JOUR
T1 - Pre-filters design for weighted sum rate maximization in multiuser time reversal downlink systems
AU - Wang, Mingyue
AU - Li, Fangwei
AU - Li, Yingsong
AU - Luo, Shengyuan
PY - 2024/8/12
Y1 - 2024/8/12
N2 - In high-speed multiuser Time Reversal (TR) downlink systems, the transmission rate is degraded due to the presence of severe inter-user and inter-symbol interference. Moreover, maximizing the weighted sum rate in such systems is a critical objective, since the weighting factors represent the priority of different users in different applications. However, it faces significant challenges as it is an NP-hard and non-convex problem. In order to suppress these interferences and maximize the weighted sum rate, in this paper we present a novel approach for the joint design of the pre-filters. The proposed method applies successive convex approximation to transform the original problem into a Second-Order Cone Programming (SOCP) problem. Then, a low-complexity iterative algorithm is provided to effectively solve the resulting SOCP problem. According to the simulation results, the proposed method reaches a local optimum within a few iterations and demonstrates superior performance in terms of weighted sum rate compared to the current algorithm.
AB - In high-speed multiuser Time Reversal (TR) downlink systems, the transmission rate is degraded due to the presence of severe inter-user and inter-symbol interference. Moreover, maximizing the weighted sum rate in such systems is a critical objective, since the weighting factors represent the priority of different users in different applications. However, it faces significant challenges as it is an NP-hard and non-convex problem. In order to suppress these interferences and maximize the weighted sum rate, in this paper we present a novel approach for the joint design of the pre-filters. The proposed method applies successive convex approximation to transform the original problem into a Second-Order Cone Programming (SOCP) problem. Then, a low-complexity iterative algorithm is provided to effectively solve the resulting SOCP problem. According to the simulation results, the proposed method reaches a local optimum within a few iterations and demonstrates superior performance in terms of weighted sum rate compared to the current algorithm.
U2 - 10.1016/j.dcan.2024.08.011
DO - 10.1016/j.dcan.2024.08.011
M3 - Journal article
SN - 2468-5925
JO - Digital Communications and Networks
JF - Digital Communications and Networks
ER -