Abstract
A unified tree-search detection scheme based on Dijkstra's algorithm is developed for MIMO systems. The proposed framework generalizes the original Dijkstra's algorithm by allowing the memory usage, detection complexity, and sorting dynamic associated with the algorithm to be customized. By tuning different parameters, desired performance- complexity tradeoffs are attained and a fixed- complexity version can be produced to facilitate hardware implementation. Simulation results demonstrate that the proposed algorithm shows abilities to achieve highly favorable performance- complexity tradeoffs. © 2011 IEEE.