Capacity Optimization of MIMO Links with Interference

The capacity optimization problem of MIMO links with interference has attracted an increasing interest. Due to the nonconvexity of the capacity problem, only suboptimal solutions can be found. In the previous works, a Gradient Projection (GP) algorithm and a Quasi-Newton (QN) method were proposed to provide suboptimal solutions subject to the constant power constraint. In this paper, we derive the capacity for MIMO links decomposed via SVD and interfered from other links. Then, each eigenchannel of MIMO link is represented by a set of logical links with a set of discrete data rates and discrete powers. An Integer Programming based algorithm (named as IP) is presented to solve the capacity optimization problem. The solution specifies the set of logical links that can transmit simultaneously. Numerical results show that GP and QN methods achieve better performance than IP method for the case of weak interference because of the convexity of the optimization problem when INR is sufficiently small. In the case of strong interference, IP method achieves better performance than GP and QN methods, which means that transmitting one link at a time is better than transmitting all links simultaneously with full power. In other words, scheduling links to transmit is more important for the case of strong interference.