Stack-based Tree Searching Algorithm for V-Blast Detection with Implementation Friendly Reduction Techniques

V-BLAST (Vertical Bell Labs Layered Space-Time) system is considered as a key enabling technology for achieving high spectral efficiency in wireless communication. To meet the requirements of low complexity and high constant throughput in practical V-BLAST system design, we propose a computationally efficient stack-based tree searching algorithm (SBSA) from a hardware implementation point of view. To reduce the complexity, we introduce sub-space division method, which divides the constellation search space into four or nine sub- spaces. Stack size is adapted to eliminate redundant tree searching and early termination is employed to ensure a constant throughput. Consequently, the SBSA increases the system throughput with significant complexity reduction while achieving near-ML performance, compared with ML detector.