Iterative rank minimization for broadcast beamforming

Abstract

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… (More)
DOI: 10.1109/SIU.2014.6830429

Topics

  • Presentations referencing similar topics