z-logo
open-access-imgOpen Access
Energy Efficiency Maximization for Full Duplex MIMO Cloud Radio Access Networks
Author(s) -
Tien Ngoc Ha,
Xuan-Xinh Nguyen,
Hoang Kha Ha
Publication year - 2021
Publication title -
phát triển khoa học and công nghệ - kỹ thuật and công nghệ
Language(s) - English
Resource type - Journals
ISSN - 2615-9872
DOI - 10.32508/stdjet.v3i3.685
Subject(s) - telecommunications link , mimo , computer science , transmitter power output , maximization , cloud computing , radio access network , optimization problem , mathematical optimization , convex optimization , efficient energy use , remote radio head , beamforming , computer network , base station , regular polygon , wireless , algorithm , mathematics , telecommunications , cognitive radio , engineering , transmitter , electrical engineering , mobile station , channel (broadcasting) , geometry , operating system
This paper studies a joint precoder and fronthaul compression design for full-duplex (FD) miltiple-input-multiple-output (MIMO) cloud radio access networks (CRANs). A cloud control unit (CU) communicates with multiple downlink and uplink users through FD radio units (RUs) connected to the CU through fronthaul links which are limited capacity. We address the energy efficiency (EE) maximization problem subject to the transmit power constraints at each RU, each user and the limited capacity of fronthaul links. Since the formulated design problem is a highly non-convex problem in design variables, we exploit a successive convex approximation (SCA) method to obtain the concave lower bound of the achievable sum rate and a convex upper bound of limited capacity fronthaul link functions. Then, we apply the Dinkelbach method to develop an efficient iterative algorithm guaranteeing convergence in which the convex optimization problems are solved. Numerical results are provided to investigate the EE of the proposed algorithm.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here