Joint Pilot Allocation and Robust Transmission Design for Ultra-Dense User-Centric TDD C-RAN With Imperfect CSI

This paper considers the unavailability of complete channel state information (CSI) in ultra-dense cloud radio access networks. The user-centric cluster is adopted to reduce the computational complexity, while the incomplete CSI is considered to reduce the heavy channel training overhead, where only...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on wireless communications Vol. 17; no. 3; pp. 2038 - 2053
Main Authors Cunhua Pan, Mehrpouyan, Hani, Yuanwei Liu, Elkashlan, Maged, Arumugam, Nallanathan
Format Journal Article
LanguageEnglish
Published IEEE 01.03.2018
Subjects
Online AccessGet full text
ISSN1536-1276
1558-2248
1558-2248
DOI10.1109/TWC.2017.2788001

Cover

More Information
Summary:This paper considers the unavailability of complete channel state information (CSI) in ultra-dense cloud radio access networks. The user-centric cluster is adopted to reduce the computational complexity, while the incomplete CSI is considered to reduce the heavy channel training overhead, where only large-scale inter-cluster CSI is available. Channel estimation for intra-cluster CSI is also considered, where we formulate a joint pilot allocation and user equipment (UE) selection problem to maximize the number of admitted UEs with fixed number of pilots. A novel pilot allocation algorithm is proposed by considering the multi-UE pilot interference. Then, we consider robust beam-vector optimization problem subject to UEs' data rate requirements and fronthaul capacity constraints, where the channel estimation error and incomplete inter-cluster CSI are considered. The exact data rate is difficult to obtain in closed form, and instead we conservatively replace it with its lower-bound. The resulting problem is non-convex, combinatorial, and even infeasible. A practical algorithm, based on UE selection, successive convex approximation and semi-definite relaxation approach, is proposed to solve this problem with guaranteed convergence. We strictly prove that the semidefinite relaxation is tight with probability 1. Finally, extensive simulation results are presented to show the fast convergence of our proposed algorithm and demonstrate its superiority over the existing algorithms.
ISSN:1536-1276
1558-2248
1558-2248
DOI:10.1109/TWC.2017.2788001