Weighted sum-rate maximization for the ultra-dense user-centric TDD C-RAN downlink relying on imperfect CSI

Abstract

The weighted sum-rate maximization problem of ultra-dense cloud radio access networks is considered. The user-centric clustering is adopted for reducing the complexity. To reduce the training overhead, one only needs to estimate the intra-cluster channel-state information (CSI), while only the large-scale channel gains are available outside the cluster. We first derive the rate lower bound (LB) relying on Jensen’s inequality. For the special case of non-overlapping clusters, the accurate data rate expression is derived in the closed form. The simulation results show the tightness of the LB for both the overlapped and non-overlapped cases. Then, we consider an alternative problem where the actual data rate is replaced by its LB, which constitutes a non-convex optimization problem. First, the globally optimal solution is obtained by applying the high-complexity outer polyblock approximation (OPA) algorithm. Then, we invoke the reduced-complexity modified weighted minimum mean square error (WMMSE) algorithm for mitigating the deleterious effects of the realistic imperfect CSI. For the subproblem solved by each WMMSE iteration, the beamforming vectors are derived in the closed form relying on the Lagrangian dual decomposition method. Finally, our simulation results show that the modified WMMSE algorithm’s performance is comparable to that of the high-complexity OPA algorithm, which outperforms other benchmark algorithms.

More information

Identifiers

ORCID for Lajos Hanzo: orcid.org/0000-0002-2636-5214

Catalogue record

Export record

Altmetrics