English

Compressive Channel Estimation and Multi-user Detection in C-RAN

Information Theory 2017-02-22 v1 math.IT

Abstract

This paper considers the channel estimation (CE) and multi-user detection (MUD) problems in cloud radio access network (C-RAN). Assuming that active users are sparse in the network, we solve CE and MUD problems with compressed sensing (CS) technology to greatly reduce the long identification pilot overhead. A mixed L{2,1}-regularization functional for extended sparse group-sparsity recovery is proposed to exploit the inherently sparse property existing both in user activities and remote radio heads (RRHs) that active users are attached to. Empirical and theoretical guidelines are provided to help choosing tuning parameters which have critical effect on the performance of the penalty functional. To speed up the processing procedure, based on alternating direction method of multipliers and variable splitting strategy, an efficient algorithm is formulated which is guaranteed to be convergent. Numerical results are provided to illustrate the effectiveness of the proposed functional and efficient algorithm.

Keywords

Cite

@article{arxiv.1702.06381,
  title  = {Compressive Channel Estimation and Multi-user Detection in C-RAN},
  author = {Qi He and Tony Q. S. Quek and Zhi Chen and Shaoqian Li},
  journal= {arXiv preprint arXiv:1702.06381},
  year   = {2017}
}

Comments

6 pages, 3 figures

R2 v1 2026-06-22T18:24:07.225Z