Toward Optimally Efficient Search With Deep Learning for Large-Scale MIMO Systems

被引:35
作者
He, Le [1 ]
He, Ke [1 ,2 ]
Fan, Lisheng [1 ]
Lei, Xianfu [3 ]
Nallanathan, Arumugam [4 ]
Karagiannidis, George K. [5 ]
机构
[1] Guangzhou Univ, Sch Comp Sci & Cyber Engn, Guangzhou 510006, Peoples R China
[2] Univ Luxembourg, Signal Proc & Satellite Commun Res Grp SIGCOM, Interdisciplinary Ctr Secur Reliabil & Trust SnT, L-1855 Luxembourg, Luxembourg
[3] Southwest Jiaotong Univ, Sch Informat Sci & Technol, Inst Mobile Commun, Chengdu 610031, Peoples R China
[4] Queen Mary Univ London, Sch Elect Engn & Comp Sci, London E1 4NS, England
[5] Aristotle Univ Thessaloniki, Wireless Commun & Informat Proc Grp WCIP, Thessaloniki 54124, Greece
基金
中国国家自然科学基金;
关键词
MIMO communication; Search problems; Complexity theory; Deep learning; Signal detection; Lattices; Heuristic algorithms; integer least-squares; deep learning; maximum likelihood detection; MIMO; sphere decoding; best-first search; ALGORITHM; MODEL;
D O I
10.1109/TCOMM.2022.3158367
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper investigates the optimal signal detection problem with a particular interest in large-scale multiple-input multiple-output (MIMO) systems. The problem is NP-hard and can be solved optimally by searching the shortest path on the decision tree. Unfortunately, the existing optimal search algorithms often involve prohibitively high complexities, which indicates that they are infeasible in large-scale MIMO systems. To address this issue, we propose a general heuristic search algorithm, namely, hyper-accelerated tree search (HATS) algorithm. The proposed algorithm employs a deep neural network (DNN) to estimate the optimal heuristic, and then use the estimated heuristic to speed up the underlying memory-bounded search algorithm. This idea is inspired by the fact that the underlying heuristic search algorithm reaches the optimal efficiency with the optimal heuristic function. Simulation results show that the proposed algorithm reaches almost the optimal bit error rate (BER) performance in large-scale systems, while the memory size can be bounded. In the meanwhile, it visits nearly the fewest tree nodes. This indicates that the proposed algorithm reaches almost the optimal efficiency in practical scenarios, and thereby it is applicable for large-scale systems. Besides, the code for this paper is available at https://github.com/skypitcher/hats.
引用
收藏
页码:3157 / 3168
页数:12
相关论文
共 43 条
[1]   Closest point search in lattices [J].
Agrell, E ;
Eriksson, T ;
Vardy, A ;
Zeger, K .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (08) :2201-2214
[2]  
Askri A, 2019, IEEE INT SYMP INFO, P1172, DOI [10.1109/isit.2019.8849786, 10.1109/ISIT.2019.8849786]
[3]  
Bäro S, 2003, 2003 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5, P2653
[4]  
Bishop Christopher M., 2006, Pattern recognition and machine learning
[5]   Massive MIMO is a reality-What is next? Five promising research directions for antenna arrays [J].
Bjornson, Emil ;
Sanguinetti, Luca ;
Wymeersch, Henk ;
Hoydis, Jakob ;
Marzetta, Thomas L. .
DIGITAL SIGNAL PROCESSING, 2019, 94 :3-20
[6]   A* Algorithm Inspired Memory-Efficient Detection for MIMO Systems [J].
Chang, Ronald Y. ;
Chung, Wei-Ho ;
Lin, Sian-Jheng .
IEEE WIRELESS COMMUNICATIONS LETTERS, 2012, 1 (05) :508-511
[7]  
Chen WB, 2015, J COMB OPTIM, V30, P447, DOI 10.1007/s10878-013-9646-4
[8]  
Cui T, 2006, IEEE ICC, P391
[9]   Memory-Constrained Tree Search Detection and New Ordering Schemes [J].
Dai, Yongmei ;
Yan, Zhiyuan .
IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2009, 3 (06) :1026-1037
[10]   GENERALIZED BEST-1ST SEARCH STRATEGIES AND THE OPTIMALITY OF A [J].
DECHTER, R ;
PEARL, J .
JOURNAL OF THE ACM, 1985, 32 (03) :505-536