A Near Optimal List Detection Algorithm in VBLAST Systems

A near optimal list detection algorithm is proposed for V-BLAST systems. The trade-off between performance and complexity of the proposed list algorithm can be adjusted through setting the parameter P, which is the list dimension of the tree searching. Furthermore, a different detection ordering method from OSIC algorithm is proposed, which can greatly improve detection validity. Simulation results and complexity analysis show that list detection algorithm evidently outperforms OSIC algorithm and is even close to ML detection performance under both uncorrelated and highly correlated channels and achieves a good trade-off between performance and complexity. It is a preferable practicable choice.