Iterative Rank Minimization For Broadcast Beamforming

Date

2014-04-25

Author

Demir, Özlem Tuğfe
Tuncer, Temel Engin

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

4
views

0
downloads

Cite This

Optimization problem of broadcast beamforming is nonconvex due to rank condition. Semidefinite relaxation (SDR) method is proposed to solve this problem. However, in certain cases, the performance of SDR becomes unacceptable. In this paper, an equivalent formulation of the original problem without rank condition is found. An iterative algorithm which is shown to converge to a rank one solution is presented. Experimental results show that the proposed algorithm is very effective and gives better results than other existing approaches.

Subject Keywords

Convex optimization, Semidefinite relaxation, Broadcast beamformer, Transmit beamformer

URI

https://hdl.handle.net/11511/54217

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar