Statistical group sparse beamforming for green Cloud-RAN via large system analysis

• Published in: Proceedings / IEEE International Symposium on Information Theory pp. 870 - 874
• Main Authors: Shi, Yuanming, Zhang, Jun, Letaief, Khaled B.
• Format: Conference Proceeding Journal Article
• Language: English
• Published: IEEE 01.07.2016
• Subjects: Algorithms; Approximation algorithms; Array signal processing; Beamforming; Channels; Information theory; Iterative algorithms; Linear programming; Mathematical analysis; Minimization; Networks; Order disorder; Power demand; Quality of service; Signal processing algorithms; Switches; Vectors; Vectors (mathematics)
• ISSN: 2157-8117
• DOI: 10.1109/ISIT.2016.7541423

In this paper, we develop a statistical group sparse beamforming framework to minimize the network power consumption for green cloud radio access networks (Cloud-RANs). It will promote group sparsity structures in the beamforming vectors, which will provide a good indicator for remote radio head (RRH) ordering to enable adaptive RRH selection for power saving. In contrast to the previous works that depend heavily on instantaneous channel state information (CSI), the proposed algorithm only depends on the long-term channel state attenuation for RRH ordering, which does not require frequent update, thereby significantly reducing the computation overhead. This is achieved by developing a smoothed ℓ p -minimization approach to induce group sparsity in beamforming vectors, followed by an iterative reweighted-ℓ 2 algorithm via the principles of the majorization-minimization (MM) algorithm and the Lagrangian duality theory. With the well-structured closed-form solutions at each iteration, we further leverage the large-dimensional random matrix theory to derive deterministic approximations for the squared ℓ 2 -norm of the induced group sparse beamforming vectors in the large system regimes. The deterministic approximation results only depend on statistical CSI and will guide the RRH ordering. Simulation results demonstrate the near-optimal performance of the proposed algorithm, even in finite systems.