On the complexity of optimal coordinated downlink beamforming

In a cellular wireless system, users located at cell edges often suffer significant out-of-cell interference. In this paper we consider a coordinated beamforming approach whereby multiple base stations jointly optimize their downlink beamforming vectors in order to simultaneously improve the data rates of a given group of cell edge users. Assuming perfect channel knowledge, we formulate this problem as the maximization of a system utility function (which balances user fairness and average user rates), subject to individual power constraints at each base station. We show that, for the single carrier case and when the number of antennas at each base station is at least two, the optimal coordinated beamforming problem is strongly NP-hard for both the harmonic mean utility function and the proportional fairness utility function. For the min-rate utility function, we show that the problem is solvable in polynomial time.

[1]  Wei Yu,et al.  Coordinated beamforming for the multi-cell multi-antenna wireless system , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[2]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[3]  Erik G. Larsson,et al.  Complete Characterization of the Pareto Boundary for the MISO Interference Channel , 2008, IEEE Transactions on Signal Processing.

[4]  Emil Björnson,et al.  Cooperative Multicell Precoding: Rate Region Characterization and Distributed Strategies With Instantaneous and Statistical CSI , 2010, IEEE Transactions on Signal Processing.

[5]  Zhi-Quan Luo,et al.  Dynamic Spectrum Management: Complexity and Duality , 2008, IEEE Journal of Selected Topics in Signal Processing.

[6]  Ami Wiesel,et al.  Linear precoding via conic optimization for fixed MIMO receivers , 2006, IEEE Transactions on Signal Processing.

[7]  Randa Zakhour,et al.  Coordination on the MISO interference channel using the virtual SINR framework , 2009 .