Skip to main content
Computer Vision- Core Artificial Intelligence Research
Computer Vision- Core Artificial Intelligence Research
Main navigation
Home
People
All Profiles
Faculty
Postdoctoral Fellows
Students
Alumni
Former Members
Visiting Scholars
Events
All Events
Events Calendar
News
Hiring Opportunities
Publications
Teaching
tree-searching
A best-first tree-searching approach for ML decoding in MIMO system
1 min read ·
Thu, Apr 29 2010
News
ML
Circuits
tree-searching
MIMO system
Chung-An Shen, et al., "A best-first tree-searching approach for ML decoding in MIMO system." In Proceedings of 2010 IEEE International Symposium on Circuits and Systems, 2010, 3533. In MIMO communication systems maximum-likelihood (ML) decoding can be formulated as a tree-searching problem. This paper presents a tree-searching approach that combines the features of classical depth-first and breadth-first approaches to achieve close to ML performance while minimizing the number of visited nodes. A detailed outline of the algorithm is given, including the required storage. The effects of