TY - GEN
T1 - MIMO Receive Antenna Selection via Deep Learning and Greedy Adaptation
AU - Shen, Cong
AU - Li, Donghao
AU - Yang, Jing
N1 - Funding Information:
The work of C. Shen was partially supported by the US National Science Foundation (NSF) under Grant CNS-2002902. The work of J. Yang was partially supported by the US National Science Foundation (NSF) under Grant CNS-1956276.
Publisher Copyright:
© 2020 IEEE.
PY - 2020/11/1
Y1 - 2020/11/1
N2 - Computationally efficient optimal solutions for selecting a subset of antennas to maximize the mutual information of a MIMO channel have eluded the practitioners due to its combinatorial nature, and the performance gap is widened with massive MIMO. In this work, recent advances in deep learning are leveraged to develop a deep neural network (DNN) based receive antenna selection solution for a given problem dimension. We detail the neural network structure and evaluate several relevant figures of merit via numerical simulations. This data-driven solution is shown to achieve near optimal mutual information in simple settings, but does not scale naturally with the problem dimension. For the practical scenario where the number of selected antennas is unknown a priori, hybrid greedy solutions are proposed which build on the DNN-based solution for a given dimension and then greedily increase or decrease the number of antennas to approximate the optimal solution of the new problem dimension. Numerical simulations demonstrate the effectiveness of the hybrid solutions.
AB - Computationally efficient optimal solutions for selecting a subset of antennas to maximize the mutual information of a MIMO channel have eluded the practitioners due to its combinatorial nature, and the performance gap is widened with massive MIMO. In this work, recent advances in deep learning are leveraged to develop a deep neural network (DNN) based receive antenna selection solution for a given problem dimension. We detail the neural network structure and evaluate several relevant figures of merit via numerical simulations. This data-driven solution is shown to achieve near optimal mutual information in simple settings, but does not scale naturally with the problem dimension. For the practical scenario where the number of selected antennas is unknown a priori, hybrid greedy solutions are proposed which build on the DNN-based solution for a given dimension and then greedily increase or decrease the number of antennas to approximate the optimal solution of the new problem dimension. Numerical simulations demonstrate the effectiveness of the hybrid solutions.
UR - http://www.scopus.com/inward/record.url?scp=85107820357&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85107820357&partnerID=8YFLogxK
U2 - 10.1109/IEEECONF51394.2020.9443510
DO - 10.1109/IEEECONF51394.2020.9443510
M3 - Conference contribution
AN - SCOPUS:85107820357
T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers
SP - 403
EP - 407
BT - Conference Record of the 54th Asilomar Conference on Signals, Systems and Computers, ACSSC 2020
A2 - Matthews, Michael B.
PB - IEEE Computer Society
T2 - 54th Asilomar Conference on Signals, Systems and Computers, ACSSC 2020
Y2 - 1 November 2020 through 5 November 2020
ER -