Hybrid tree search algorithms for detection in spatial multiplexing systems

Kuei Chiang Lai, Jiun Jie Jia, Li Wei Lin

研究成果: Article同行評審

2 引文 斯高帕斯(Scopus)

摘要

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 9月

All Science Journal Classification (ASJC) codes

  • 汽車工程
  • 航空工程
  • 電氣與電子工程
  • 應用數學

指紋

深入研究「Hybrid tree search algorithms for detection in spatial multiplexing systems」主題。共同形成了獨特的指紋。

引用此