Abstract

This paper considers a downlink ultradense heterogeneous cloud radio access network, which guarantees seamless coverage and can provide high date rates. In order to reduce channel state information (CSI) feedback overhead, incomplete intercluster CSI is considered, i.e., each remote radio head or macro base station only measures the CSI from user equipments (UEs) in its serving cluster. To reduce pilot consumption, pilot reuse among UEs is assumed, resulting in imperfect intracluster CSI. A two-stage optimization problem is then formulated. In the first stage, a pilot scheduling algorithm is proposed to minimize the sum mean square error (MSE) of all channel estimates. Specifically, the minimum number of required pilots along with a feasible pilot allocation solution are first determined by applying the Dsatur algorithm, and adjustments based on the defined level of pilot contamination are then carried out for further improvement. Based on the pilot allocation result obtained in the first stage, the second stage aims at maximizing the sum spectral efficiency (SE) of the network by optimizing the beam vectors. Due to incomplete intercluster CSI and imperfect intracluster CSI, an explicit expression of each UE's achievable rate is unavailable. Hence, a lower bound on the achievable rate is derived based on Jensen's inequality, and an alternative robust transmission design algorithm along with its distributed realization are then proposed to maximize the derived tight lower bound. Simulation results show that compared with the existing algorithms, the system performance can be greatly improved by the proposed algorithms in terms of both sum MSE and sum SE.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.