Name
Abstract | ||
|---|---|---|
Hybrid tree search algorithms are described for maximum-likelihood symbol detection in spatial multiplexing (SM) systems. Essentially, the search tree is iteratively expanded in breadth-first (BF) manner until the probability that the current most likely path is correct exceeds the specified threshold, at which point, the depth-first (DF) stage is initiated to traverse the rest of the tree. In contrast with the sphere decoding (SD) algorithm, which starts off with the DF search, the proposed algorithms use the BF stage to enhance the accuracy of the initial DF search direction by exploiting the diversity inherent in the SM scheme. Simulation results demonstrate that, with a moderate increase in the memory requirement, the proposed algorithms achieve a significantly lower complexity than the SD algorithm in many scenarios. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/TVT.2011.2160464 | IEEE T. Vehicular Technology |
Keywords | Field | DocType |
tree search,tree searching,initial depth-first search direction,space division multiplexing,maximum likelihood detection,spatial multiplexing systems,mimo communication,sphere decoding algorithm,mulitple-input–multiple-output (mimo),sphere decoding,multiple-input-multiple-output technology,breadth-first manner,mimo technology,decoding,maximum-likelihood symbol detection,hybrid tree search algorithms,indexing terms,spatial multiplexing,search algorithm,maximum likelihood | Search algorithm,Maximum likelihood detection,Computer science,Algorithm,Electronic engineering,Theoretical computer science,Decoding methods,Space division multiplexing,Mimo communication,Spatial multiplexing,Search tree,Traverse | Journal |
Volume | Issue | ISSN |
60 | 7 | 0018-9545 |
Citations | PageRank | References |
1 | 0.36 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kuei-Chiang Lai | 1 | 73 | 9.29 |
| Jiun-Jie Jia | 2 | 18 | 2.98 |
| Liwei Lin | 3 | 122 | 28.76 |