Robust Design for Massive CSI Acquisition in Analog Function Computation Networks

被引:18
作者
Ang, Fan [1 ]
Chen, Li [1 ]
Zhao, Nan [2 ,3 ]
Chen, Yunfei [4 ]
Yu, F. Richard [5 ]
机构
[1] Univ Sci & Technol China, Dept Elect Engn & Informat Sci, Hefei 230022, Anhui, Peoples R China
[2] Dalian Univ Technol, Sch Informat & Commun Engn, Dalian 116024, Peoples R China
[3] Southeast Univ, Natl Mobile Commun Res Lab, Nanjing 210096, Jiangsu, Peoples R China
[4] Univ Warwick, Sch Engn, Coventry CV4 7AL, W Midlands, England
[5] Carleton Univ, Dept Syst & Comp Engn, Ottawa, ON K1S 5B6, Canada
基金
中国国家自然科学基金;
关键词
Analog function computation; expectation-based model; transceiver design; worst-case model; HARNESSING INTERFERENCE; OPTIMIZATION;
D O I
10.1109/TVT.2019.2891904
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Analog function computation utilizes the superposition property of multi-access channel to compute the target function in an efficient way. However, its corresponding transceiver requires global channel state information (CSI) of the network, which incurs large latency. To tackle this challenge, a novel scheme called over-the-air signaling procedure is proposed by exploiting a defined effective CSI in this paper. We first derive the training complexity of the proposed scheme and compare it with the conventional design. It is shown that the training complexity of the proposed scheme can be greatly reduced for massive CSI acquisition by avoiding collecting individual CSI. To account for the difference of the desired CSI, a corresponding robust model is further discussed. Through modeling the channel uncertainties under the expectation-based model and the worst case model, we formulate the transceiver optimization for both the conventional scheme and the over-the-air signaling procedure. The computational time complexity is derived as a polynomial expression, and it can be significantly reduced for the over-the-air signaling procedure due to its independence of the number of nodes. Finally, the mean-square error improvement and complexity reduction of the proposed design are demonstrated via simulation.
引用
收藏
页码:2361 / 2373
页数:13
相关论文
共 28 条
[1]  
Abari Omid, 2015, 2015 IEEE Conference on Computer Communications (INFOCOM). Proceedings, P1742, DOI 10.1109/INFOCOM.2015.7218555
[2]  
Abari O., 2016, ARXIV PREPRINT ARXIV
[3]  
[Anonymous], ARXIV180608632
[4]  
[Anonymous], 2001, LECT MODERN CONVEX O
[5]  
[Anonymous], STUD SCEN REQ NEXT G
[6]   Robust Monotonic Optimization Framework for Multicell MISO Systems [J].
Bjornson, Emil ;
Zheng, Gan ;
Bengtsson, Mats ;
Ottersten, Bjoern .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2012, 60 (05) :2508-2523
[7]  
Boyd S.P., 1994, LINEAR MATRIX INEQUA, V15
[8]  
Boyd Stephen P., 2014, Convex Optimization
[9]   APPROXIMATE COMPLEXITY AND FUNCTIONAL REPRESENTATION [J].
BUCK, RC .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1979, 70 (01) :280-298
[10]   Over-the-Air Computation for IoT Networks: Computing Multiple Functions With Antenna Arrays [J].
Chen, Li ;
Zhao, Nan ;
Chen, Yunfei ;
Yu, F. Richard ;
Wei, Guo .
IEEE INTERNET OF THINGS JOURNAL, 2018, 5 (06) :5296-5306