Abstract
With rapid advancements in wireless communications, MIMO systems are evolving to include a greater number of antennas and higher modulation orders. In these challenging environments, traditional linear detectors such as the MMSE often fall short in delivering satisfactory performance. While tree-search based detectors like the sphere decoder (SD) and K-Best detector can improve outcomes, they suffer from prohibitive complexity due to the vast search space. This article introduces OptiMISD—an optimized Monte Carlo tree search (MCTS) integrated sphere decoder, designed specifically for challenging MIMO detection scenarios. We propose three innovative techniques to enhance its efficacy: 1) a partial K-Best approach, 2) a fast upper confidence for trees (UCT) policy, and 3) a radius restriction method. Our numerical results demonstrate that OptiMISD not only achieves a performance gain of over 3 dB compared to the K-Best detector (with K = 64) @ BER = 10−4 but also reduces complexity by up to 84.9%. Additionally, the principles of OptiMISD can be adapted to address other tree-search based challenges.
Funding Information
  • National Natural Science Foundation of China (62331009)
  • Jiangsu Provincial National Science Foundation (BG2024004)
  • Jiangsu Provincial National Science Foundation (BM2023016)
  • Fundamental Research Funds for the Central Universities

This publication has 32 references indexed in Scilit: