Paper Info
Title
Rank-constrained separable semidefinite programming with applications to optimal beamforming
Abstract
Consider a downlink communication system where multiantenna base stations transmit independent data streams to decentralized single-antenna users over a common frequency band. The goal of the base stations is to jointly adjust the beamforming vectors to minimize the transmission powers while ensuring the signal-to-interference-noise ratio requirement of each user within the system. At the same time, it may be necessary to keep the interference generated on other coexisting systems under a certain tolerable level. In addition, one may want to include general individual shaping constraints on the beamforming vectors. This beamforming problem is a separable homogeneous quadratically constrained quadratic program, and it is difficult to solve in general. In this paper, we give conditions under which strong duality holds and propose efficient algorithms for the optimal beamforming problem. First, we study rank-constrained solutions of general separable semidefinite programs (SDPs) and propose rank reduction procedures to achieve a lower rank solution. Then we show that the SDP relaxation of three classes of optimal beamforming problem always has a rank-one solution, which can be obtained by invoking the rank reduction procedures.
Year
DOI
Venue
2010
10.1109/TSP.2009.2031732
IEEE Transactions on Signal Processing
Keywords
Field
DocType
general individual,beamforming problem,lower rank solution,general separable semidefinite program,beamforming vector,base station,coexisting system,optimal beamforming problem,rank reduction procedure,rank-constrained separable semidefinite programming,downlink communication system,design optimization,information theory,communication system,downlink,quadratically constrained quadratic program,base stations,quadratic programming,quality of service,strong duality,frequency
WSDMA,Beamforming,Mathematical optimization,Quadratically constrained quadratic program,Control theory,Communications system,Strong duality,Quadratic programming,Semidefinite programming,Mathematics,Constrained optimization
Journal
Volume
Issue
ISSN
58
2
1053-587X
Citations 
PageRank 
References 
222
8.57
13
Authors
2
Search Limit
100222
Name
Order
Citations
PageRank
Yongwei Huang181450.83
Daniel Pérez Palomar22146134.10