Please use this identifier to cite or link to this item:

Lorentz-positive mapswith applications to robust MISO downlink beamforming

Authors Huang, Yongwei
Palomar, Daniel P. View this author's profile
Zhang, Shuzhong
Issue Date 2012
Source ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings , 2012, p. 2801-2804p. 2801-2804
Summary Consider a unicast downlink beamforming optimization problem with robust signal-to-interference-plus-noise ratio constraints to account for non-perfect channel state information at the base station. The convexity of the robust beamforming problem remains unknown. A slightly conservative version of the robust beamforming problem is thus studied herein as a compromise. It is in the form of a semi-infinite second-order cone program (SOCP), and more importantly, it possesses an equivalent and explicit convex reformulation, due to an linear matrix inequality description of the cone of Lorentz-positive maps. Hence the robust beamforming problem can be efficiently solved by an optimization solver. The simulation results show that the conservativeness of the robust form of semi-infinite SOCP is appropriate in terms of problem feasibility rate and the average transmission power.
ISSN 1520-6149
ISBN 978-1-4673-0046-9
Language English
Format Conference paper
Access View full-text via DOI
View full-text via Web of Science
View full-text via Scopus