arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2101.02420cs.LGcs.ITmath.IT
收藏

Towards Optimally Efficient Search with Deep Learning for Large-Scale MIMO Systems

Guangzhou University(广州大学);University of Luxembourg(卢森堡大学);Southwest Jiaotong University(西南交通大学);Queen Mary University of London(伦敦玛丽女王大学);Aristotle University of Thessaloniki(塞萨洛尼基亚里士多德大学)

Le He, Ke He, Lisheng Fan, Xianfu Lei, Arumugam Nallanathan, George K. Karagiannidis

英文摘要:

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 \url{https://github.com/skypitcher/hats}.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑