Hybrid tree search algorithms for detection in spatial multiplexing systems

Kuei Chiang Lai, Jiun Jie Jia, Li Wei Lin

Research output: Contribution to journalArticlepeer-review

2 Citations (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.

Original languageEnglish
Article number5928440
Pages (from-to)3503-3509
Number of pages7
JournalIEEE Transactions on Vehicular Technology
Issue number7
Publication statusPublished - 2011 Sept

All Science Journal Classification (ASJC) codes

  • Automotive Engineering
  • Aerospace Engineering
  • Electrical and Electronic Engineering
  • Applied Mathematics


Dive into the research topics of 'Hybrid tree search algorithms for detection in spatial multiplexing systems'. Together they form a unique fingerprint.

Cite this