Weighted Sum-Rate Maximization for MISO Downlink Cellular Networks via Branch and Bound

Worst-case weighted sum-rate maximization for MISO downlink systems with imperfect channel knowledge

“…For comparison, we consider the non-robust BB algorithm proposed in [4]. For a fair comparison, we consider a network with N = 3 BSs each with T = 3 transmit antennas, and a single user in each BS.…”

“…We start by expressing the bounding functions φ lb and φ ub proposed in [4] for the case of perfect CSI in MISO systems as…”

“…The WSRMax problem under the perfect channel state information (CSI) has been addressed in literature, e.g., [1]- [4]. However, in practice the BSs can never have perfect CSI, due to the imperfect channel estimation and limited feedback bandwidth.…”

“…The efficiency of BB algorithm depends on the formulation of computationally efficient lower and upper bound functions [12]. In [4] the perfect CSI is considered, thus the feasibility of the bounding functions can be easily checked by a second order cone program. In this paper, we consider imperfect CSI in all relevant channels for the WSRMax problem, which makes the problem much difficult than that in [4].…”

“…In [4] the perfect CSI is considered, thus the feasibility of the bounding functions can be easily checked by a second order cone program. In this paper, we consider imperfect CSI in all relevant channels for the WSRMax problem, which makes the problem much difficult than that in [4]. After the submission of the first manuscript we found out that, similar problem has been addressed using a different analysis technique in [13].…”