Skip to main content
Communication and Computing Systems Lab
CCSL
Communication and Computing Systems Lab
Home
People
All Profiles
Principal Investigator
Postdoctoral Fellows
Research Scientists
Research Staff
Students
Alumni
Former Members
Research
Wireless Communication
Body Area Network
AI Accelerator
All Projects
Publications
Publications
Google Scholar
DBLP
IEEE Xplore
KAUST Repository
ORCID
Events
Media Gallery
Contacts
Join us
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