Hide/Show Apps

Iterative Rank Minimization For Broadcast Beamforming

2014-04-25
Demir, Özlem Tuğfe
Tuncer, Temel Engin
Show full item record
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
1
views
0
downloads
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.
Convex optimization, Semidefinite relaxation, Broadcast beamformer, Transmit beamformer
https://hdl.handle.net/11511/54217
Department of Electrical and Electronics Engineering, Conference / Seminar
METU IIS - Integrated Information Service IT Support Service
You can transmit your request, problems about services
provided by METU Computer Center, and follow the process.