摘要
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.
| 原文 | English |
|---|---|
| 文章編號 | 5928440 |
| 頁（從 - 到） | 3503-3509 |
| 頁數 | 7 |
| 期刊 | IEEE Transactions on Vehicular Technology |
| 卷 | 60 |
| 發行號 | 7 |
| DOIs | |
| 出版狀態 | Published - 2011 九月 1 |
指紋
All Science Journal Classification (ASJC) codes
- Automotive Engineering
- Aerospace Engineering
- Electrical and Electronic Engineering
- Applied Mathematics
引用此文
}
Hybrid tree search algorithms for detection in spatial multiplexing systems. / Lai, Kuei-Chiang; Jia, Jiun Jie; Lin, Li Wei.
於: IEEE Transactions on Vehicular Technology, 卷 60, 編號 7, 5928440, 01.09.2011, p. 3503-3509.研究成果: Article
TY - JOUR
T1 - Hybrid tree search algorithms for detection in spatial multiplexing systems
AU - Lai, Kuei-Chiang
AU - Jia, Jiun Jie
AU - Lin, Li Wei
PY - 2011/9/1
Y1 - 2011/9/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=80052860118&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80052860118&partnerID=8YFLogxK
U2 - 10.1109/TVT.2011.2160464
DO - 10.1109/TVT.2011.2160464
M3 - Article
AN - SCOPUS:80052860118
VL - 60
SP - 3503
EP - 3509
JO - IEEE Transactions on Vehicular Technology
JF - IEEE Transactions on Vehicular Technology
SN - 0018-9545
IS - 7
M1 - 5928440
ER -