作者: Sean Huberman , Tho Le-Ngoc
关键词:
摘要: This paper proposes two Sequential Convex Programming (SCP) algorithms, namely Difference of functions (DC)-based and Approximations for Matrix-variable (SCAMP), solving the non-convex matrix-variable sum-rate maximization problem in Full-Duplex (FD) Single-User Multiple-Input-Multiple-Output (SU-MIMO) systems. The proposed algorithms result different approximations objective function hence, depending on environment, one may be favorable than other. Numerical results show that SCP can significantly increase over existing techniques SU-MIMO scenario. In particular, scenario, DC-based algorithm outperforms SCAMP.