TY - GEN
T1 - Compressive channel estimation and multi-user detection in C-RAN
AU - He, Qi
AU - Quek, Tony Q.S.
AU - Chen, Zhi
AU - Li, Shaoqian
N1 - Funding Information:
This work is supported in part by the SUTD-ZJU Research Collaboration under Grant SUTD-ZJU/RES/01/2014, and the MOE ARF Tier 2 under Grant MOE2014-T2-2-002, and the National Natural Science Foundation of China under Grant 61631004.
PY - 2017/7/28
Y1 - 2017/7/28
N2 - 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 ℓ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.
AB - 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 ℓ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.
UR - http://www.scopus.com/inward/record.url?scp=85028299145&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85028299145&partnerID=8YFLogxK
U2 - 10.1109/ICC.2017.7996388
DO - 10.1109/ICC.2017.7996388
M3 - Conference contribution
AN - SCOPUS:85028299145
T3 - IEEE International Conference on Communications
BT - 2017 IEEE International Conference on Communications, ICC 2017
A2 - Debbah, Merouane
A2 - Gesbert, David
A2 - Mellouk, Abdelhamid
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 IEEE International Conference on Communications, ICC 2017
Y2 - 21 May 2017 through 25 May 2017
ER -