Efficient Tree-Search MIMO Detection With Probabilistic Node Ordering

Free registration required

Executive Summary

The tree representation of the MIMO detection problem is illuminating for the development, interpretation, and classification of various detection methods. Dijkstra's search-based detection method pursues tree exploration according to a sorted list of tree nodes. In this paper, a new probabilistic sorting scheme is developed and incorporated in an enhanced Dijkstra's algorithm for MIMO detection. The proposed sorting exploits the statistical properties of the path metric of tree nodes and yields effective tree exploration and truncation in the proposed algorithm.

  • Format: PDF
  • Size: 172.8 KB