DocumentCode
2807695
Title
On the complexity of optimal coordinated downlink beamforming
Author
Liu, Ya-Feng ; Dai, Yu-Hong ; Luo, Zhi-Quan
Author_Institution
State Key Lab. of Sci. & Eng. Comput., Chinese Acad. of Sci., Beijing, China
fYear
2010
fDate
14-19 March 2010
Firstpage
3274
Lastpage
3277
Abstract
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.
Keywords
array signal processing; cellular radio; computational complexity; radiofrequency interference; NP-hard problems; cell edge users; cellular wireless system; harmonic mean utility function; optimal coordinated downlink beamforming; out-of-cell interference; polynomial time; Array signal processing; Base stations; Downlink; Interference channels; Polynomials; Signal processing; Signal to noise ratio; Transmitters; Transmitting antennas; Wireless cellular systems;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics Speech and Signal Processing (ICASSP), 2010 IEEE International Conference on
Conference_Location
Dallas, TX
ISSN
1520-6149
Print_ISBN
978-1-4244-4295-9
Electronic_ISBN
1520-6149
Type
conf
DOI
10.1109/ICASSP.2010.5496027
Filename
5496027
Link To Document