Low-complexity adaptive tree search algorithm for MIMO detection

Kuei Chiang Lai, Li Wei Lin

Research output: Contribution to journalArticlepeer-review

30 Citations (Scopus)


In this paper, a reduced-complexity multiple-input multiple-output (MIMO) detector for the spatial multiplexing systems is described. It incorporates the idea of Ungerboeck's set partitioning in the tree search to reduce the computational complexity. An algorithm that adapts the number of partitions based on the channel conditions is proposed to achieve a better tradeoff between complexity and performance. Simulation results are presented to demonstrate the efficacy of the proposed algorithm under the assumptions of perfect channel and noise power estimates.

Original languageEnglish
Pages (from-to)3716-3726
Number of pages11
JournalIEEE Transactions on Wireless Communications
Issue number7
Publication statusPublished - 2009 Jul

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Applied Mathematics


Dive into the research topics of 'Low-complexity adaptive tree search algorithm for MIMO detection'. Together they form a unique fingerprint.

Cite this