Distributed Precoding and User Selection in MIMO Interfering Networks

In this work we shed light on the problem of precoding and user selection in MIMO networks. We formulate the problem using the framework of stable matching, whereby a set of users wish to be matched to a set of serving base stations, such as to maximize the sum-rate performance of the system. Though the problem is NP-hard, we propose a suboptimal heuristic that tackles the problem in a distributed fashion: we apply a many-to-one stable matching algorithm to generate a sequence of matchings, and the Weighted MMSE algorithm to perform the precoding. We benchmark our algorithm againt the recently proposed Weighted MMSE with User Assignment algorithm [1].