.png){kind=icon}
.png){kind=icon}
Return
Low Complexity Algorithms for Robust Multigroup Multicast Beamforming
.png){kind=icon}
OA
AI
DOI：10.1109/LCOMM.2019.2917431.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Existing methods for robust multigroup multicast beamforming obtain feasible points using semidefinite relaxation (SDR) and Gaussian randomization and have high computational complexity. In this letter, we consider the robust multigroup multicast beamforming design to minimize the sum power (SP) or per-antenna power (PAP) under the signal-to-interference-plus-noise ratio (SINR) constraints and to maximize the worst-case SINR under the SP constraint or PAP constraints, respectively. The resulting optimization problems are challenging non-convex problems with infinitely many constraints. For each problem, using the majorization-minimization (MM) approach, we propose an iterative algorithm to obtain a feasible solution which is shown to be a stationary point under certain conditions. We also show that the proposed algorithms have much lower computational complexity than the existing SDR-based algorithms.
Keywords:
Robust multigroup multicasting
majorization-minimization
power minimization
max-min fair optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W