Computing the degrees of freedom for arbitrary MIMO interference channels

In this paper we provide an efficient procedure to compute the total number of degrees of freedom (DoF), achievable by linear beamforming, of the K-user multiple-input multiple-output (MIMO) interference channel with an arbitrary number of Tx-Rx antennas at each link. Firstly, we derive an analytical outer bound that generalizes the results that exist for the symmetric K-user M × N interference channel. Secondly, we obtain a tighter bound by solving a convex optimization problem that includes as constraints the DoF characterizations for point-to-point MIMO links and for 2-user interference channels. The solution to this convex problem admits an interesting waterfilling interpretation. Finally, exploiting this outer bound and using a recently proposed feasibility test, we show that it is possible to obtain the DoF for any interference channel in an efficient way. Some simulations results are included to illustrate the tightness of the derived bounds, as well as to study the DoF achievable for the 4-user channel when we distribute the total number of antennas among users and between transmitters and receivers in different ways.