Skip to main content
Extensions of Dynamic Programming, Machine Learning, Discrete Optimization
TREES
Extensions of Dynamic Programming, Machine Learning, Discrete Optimization
Main navigation
Home
People
All Profiles
Principal Investigators
Postdoctoral Fellows
Students
Alumni
Former Members
Events
All Events
Events Calendar
News
Teaching
Collaborators
Books
Contact Us
configurable tree-searching
A Best-First Soft/Hard Decision Tree Searching MIMO Decoder for a 4$ times $4 64-QAM System
1 min read ·
Wed, Apr 27 2011
News
VLSI
architecture
configurable tree-searching
Shung An Shen, et al., "A Best-First Soft/Hard Decision Tree Searching MIMO Decoder for a 4$\times $4 64-QAM System." IEEE Transactions on Very Large Scale Integration (VLSI) Systems 20 (8), 2011, 1537. Abstract: This paper presents the algorithm and VLSI architecture of a configurable tree-searching approach that combines the features of classical depth-first and breadth-first methods. Based on this approach, techniques to reduce complexity while providing both hard and soft outputs decoding are presented. Furthermore, a single programmable parameter allows the user to tradeoff throughput