2012
DOI: 10.1109/tvt.2012.2204075
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Implementation of the MIMO Sphere Detector: Architecture and Complexity Analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 14 publications
0
3
0
Order By: Relevance
“…Local search methods, while having the benefit of a tunable complexity with detection performance-speed tradeoff, are prone to the local minima problem if not given an extensive search. 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.…”
Section: A Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Local search methods, while having the benefit of a tunable complexity with detection performance-speed tradeoff, are prone to the local minima problem if not given an extensive search. 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.…”
Section: A Related Workmentioning
confidence: 99%
“…In addition, when the number of receive antennas is greater than the number of transmit antennas, as in the asymmetric 8 × 16 channel here, the channel matrix H tends to be more well-conditioned [2]. This is a favorable condition for traditional detectors such as the sphere decoder (producing extensive tree pruning and therefore higher detection speed and lower complexity) [18] and MMSE (producing generally satisfactory solutions) [4], and is similarly so for the tree search-based DRL-MCTS algorithm.…”
Section: B Drl-mcts Vs Mcts Comparisonmentioning
confidence: 99%
“…Among them, Sphere decoding is a very powerful algorithm to find the optimal solution in many scenarios [4][5][6][7][8][9][10][11][12]. Many works have been done to promote this algorithm [13][14][15][16][17][18][19][20][21][22][23][24][25][26][27][28][29]. To utilize the benefit of parallel calculation in signal process is a good method to promote the performance [30][31].…”
Section: Introductionmentioning
confidence: 99%