TY - JOUR
T1 - Joint Channel Identification and Estimation in Wireless Network
T2 - Sparsity and Optimization
AU - Nguyen, Thang Van
AU - Quek, Tony Q.S.
AU - Shin, Hyundong
N1 - Funding Information:
Manuscript received June 20, 2017; revised October 23, 2017 and February 1, 2018; accepted February 2, 2018. Date of publication February 23, 2018; date of current version May 8, 2018. The work was supported by the MOE ARF Tier 2 under Grant MOE2014-T2-2-002. The associate editor coordinating the review of this paper and approving it for publication was Z. Dawy. (Corresponding authors: Tony Q. S. Quek; Hyundong Shin.) T. V. Nguyen is with the Singapore University of Technology and Design, Singapore 487372 (e-mail: [email protected]).
Publisher Copyright:
© 2018 IEEE.
PY - 2018/5
Y1 - 2018/5
N2 - In this paper, we study channel identification for a wireless network with the aid of compressed sensing (CS) in both cases of known and unknown sparsity levels of clusters. For the unknown case, we propose using blind CS signal recovery algorithm to sequentially estimate both sparsity level and channel gains. The refined version of blind CS technique is also provided to improve the consistency of channel identification process. The convergence of two algorithms is guaranteed by ensuring that the cost functions decrease after each update. We then investigate the cluster sparsity of users in the case of known sparsity levels of all clusters. By exploiting the alternating direction method of multipliers algorithm through distributed optimization, we can identify channels in sparse clusters parallelly and efficiently compared with conventional convex techniques. In summary, this paper provides some insight into employing sparse and distributed algorithms to efficiently solve the problem of fast channel identification and estimation of users in future network.
AB - In this paper, we study channel identification for a wireless network with the aid of compressed sensing (CS) in both cases of known and unknown sparsity levels of clusters. For the unknown case, we propose using blind CS signal recovery algorithm to sequentially estimate both sparsity level and channel gains. The refined version of blind CS technique is also provided to improve the consistency of channel identification process. The convergence of two algorithms is guaranteed by ensuring that the cost functions decrease after each update. We then investigate the cluster sparsity of users in the case of known sparsity levels of all clusters. By exploiting the alternating direction method of multipliers algorithm through distributed optimization, we can identify channels in sparse clusters parallelly and efficiently compared with conventional convex techniques. In summary, this paper provides some insight into employing sparse and distributed algorithms to efficiently solve the problem of fast channel identification and estimation of users in future network.
UR - http://www.scopus.com/inward/record.url?scp=85042715989&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85042715989&partnerID=8YFLogxK
U2 - 10.1109/TWC.2018.2806978
DO - 10.1109/TWC.2018.2806978
M3 - Article
AN - SCOPUS:85042715989
SN - 1536-1276
VL - 17
SP - 3141
EP - 3153
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 5
ER -