2017
DOI: 10.1109/jetcas.2017.2743458
|View full text |Cite
|
Sign up to set email alerts
|

Hardware Efficient Massive MIMO Detector Based on the Monte Carlo Tree Search Method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(3 citation statements)
references
References 26 publications
0
3
0
Order By: Relevance
“…In 2017, Chen et al (2017) proposed the MCTS for the MIMO detector for the purpose of decision-making and for game-playing problems. Thus, BER and the complexity were reduced.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In 2017, Chen et al (2017) proposed the MCTS for the MIMO detector for the purpose of decision-making and for game-playing problems. Thus, BER and the complexity were reduced.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Tree search algorithms are also used in detectors [14]- [18], where the MIMO detection problem is formulated as a decision tree and a symbol is recovered at each layer of the tree. In [19], a statistical approach with the Monte Carlo tree search (MCTS) algorithm was proposed with hardware acceleration to recover the transmitted symbols at large MIMO setups. Other nonlinear methods such as belief propagation (BP) [20], [21], semidefinite relaxation (SDR) [22], and approximate message passing (AMP) [23] are all able to achieve good performance under many practical scenarios, while having lower complexity than the ML detector.…”
Section: A Related Workmentioning
confidence: 99%
“…It is worth noting that, comparing Table III and Table IV, the complexity of DRL-MCTS significantly reduces while that of DRL and MCTS both increase in this larger antenna system. The increased complexity for DRL and MCTS results from calculating the reward value of larger matrices for each move [19] and the function operations of higher-dimensional matrices. The main reason for the reduced complexity for DRL-MCTS is the reduced playout number required.…”
Section: Computational Complexitymentioning
confidence: 99%