An efficient global algorithm for single-group multicast beamforming
C Lu, YF Liu - IEEE Transactions on Signal Processing, 2017 - ieeexplore.ieee.org
Consider the single-group multicast beamforming problem, where multiple users receive the
same data stream simultaneously from a single transmitter. The problem is NP-hard and all …
same data stream simultaneously from a single transmitter. The problem is NP-hard and all …
Fast approximation algorithms for a class of non-convex QCQP problems using first-order methods
A Konar, ND Sidiropoulos - IEEE Transactions on Signal …, 2017 - ieeexplore.ieee.org
A number of important problems in engineering can be formulated as non-convex
quadratically constrained quadratic programming (QCQP). The general QCQP problem is …
quadratically constrained quadratic programming (QCQP). The general QCQP problem is …
Efficient transceiver design for large-scale SWIPT system with time-switching and power-splitting receivers
PV Tuan, I Koo - IEICE Transactions on Communications, 2018 - search.ieice.org
The combination of large-scale antenna arrays and simultaneous wireless information and
power transfer (SWIPT), which can provide enormous increase of throughput and energy …
power transfer (SWIPT), which can provide enormous increase of throughput and energy …
Fast first-order methods for the massive robust multicast beamforming problem with interference temperature constraints
In this paper, we consider the large-scale case of the robust beamforming problem with
interference temperature constraints. Previous semidefinite relaxation (SDR) method …
interference temperature constraints. Previous semidefinite relaxation (SDR) method …