By Topic

Efficient Tree-Search MIMO Detection with Probabilistic Node Ordering

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chang, R.Y. ; Res. Center for Inf. Technol. Innovation, Acad. Sinica, Taipei, Taiwan ; Wei-Ho Chung

The tree representation of the MIMO detection problem is illuminating for the development, interpretation, and classification of various detection methods. One method, based on the Dijkstra's search algorithm, pursues tree exploration according to a bounded, sorted list of tree nodes. Since sorting directly affects tree exploration and truncation in this tree-search method, it is critical to the performance. Motivated by the observation that sorting according to nodes' path metric, as in the conventional algorithm, does not adequately represent the "goodness" of nodes, a new probabilistic sorting rule is developed by innovatively exploiting the statistical properties of the path metric to yield more effective sorting. The relationship between the probabilistic sorting and the conventional one is established, and new features of the probabilistic sorting are presented. The effectiveness of the proposed method is demonstrated by computer simulation, where the new method outperforms the previous tree-search method in achieving near-ML detection performance, and meanwhile offers significant complexity reduction compared to the previous tree-search method.

Published in:

Communications (ICC), 2011 IEEE International Conference on

Date of Conference:

5-9 June 2011