TY - JOUR
T1 - Learning-Aided Deep Path Prediction for Sphere Decoding in Large MIMO Systems
AU - Weon, Doyeon
AU - Lee, Kyungchun
N1 - Publisher Copyright:
© 2013 IEEE.
PY - 2020
Y1 - 2020
N2 - In this paper, we propose a novel learning-aided sphere decoding (SD) scheme for large multiple-input-multiple-output systems, namely, deep path prediction-based sphere decoding (DPP-SD). In this scheme, we employ a neural network (NN) to predict the minimum metrics of the 'deep' paths in sub-trees before commencing the tree search in SD. To reduce the complexity of the NN, we employ the input vector with a reduced dimension rather than using the original received signals and full channel matrix. The outputs of the NN, i.e., the predicted minimum path metrics, are exploited to determine the search order between the sub-trees, as well as to optimize the initial search radius, which may reduce the computational complexity of SD. For further complexity reduction, an early termination scheme based on the predicted minimum path metrics is also proposed. Our simulation results show that the proposed DPP-SD scheme provides a significant reduction in computational complexity compared with the conventional SD algorithm, despite achieving near-optimal performance.
AB - In this paper, we propose a novel learning-aided sphere decoding (SD) scheme for large multiple-input-multiple-output systems, namely, deep path prediction-based sphere decoding (DPP-SD). In this scheme, we employ a neural network (NN) to predict the minimum metrics of the 'deep' paths in sub-trees before commencing the tree search in SD. To reduce the complexity of the NN, we employ the input vector with a reduced dimension rather than using the original received signals and full channel matrix. The outputs of the NN, i.e., the predicted minimum path metrics, are exploited to determine the search order between the sub-trees, as well as to optimize the initial search radius, which may reduce the computational complexity of SD. For further complexity reduction, an early termination scheme based on the predicted minimum path metrics is also proposed. Our simulation results show that the proposed DPP-SD scheme provides a significant reduction in computational complexity compared with the conventional SD algorithm, despite achieving near-optimal performance.
KW - deep learning
KW - machine learning
KW - MIMO
KW - neural network
KW - sphere decoding
KW - tree search
UR - https://www.scopus.com/pages/publications/85084300012
U2 - 10.1109/ACCESS.2020.2987375
DO - 10.1109/ACCESS.2020.2987375
M3 - Article
AN - SCOPUS:85084300012
SN - 2169-3536
VL - 8
SP - 70870
EP - 70877
JO - IEEE Access
JF - IEEE Access
M1 - 9064572
ER -