Maximum-likelihood MIMO detection using adaptive hybrid tree search

Kuei-Chiang Lai, Jiun Jie Jia, Li Wei Lin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

A hybrid tree search algorithm is described for maximum-likelihood symbol detection in spatial multiplexing (SM) systems. Essentially, the search tree is iteratively expanded in the breadth-first (BF) manner until the probability that the current most likely path is correct exceeds a specified threshold, at which point the depth-first (DF) stage is initiated to traverse the rest of the tree. In contrast to the sphere decoding (SD) algorithm, the proposed algorithm uses 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 the proposed algorithm achieves a significantly lower complexity than the SD algorithm in many scenarios of practical interest.

Original languageEnglish
Title of host publication2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'11
Pages1506-1510
Number of pages5
DOIs
Publication statusPublished - 2011 Dec 1
Event2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'11 - Toronto, ON, Canada
Duration: 2011 Sep 112011 Sep 14

Publication series

NameIEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC

Other

Other2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'11
CountryCanada
CityToronto, ON
Period11-09-1111-09-14

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Maximum-likelihood MIMO detection using adaptive hybrid tree search'. Together they form a unique fingerprint.

Cite this