Low Complexity Iterative Sequential Detection Algorithm for V-BLAST Systems

In this paper, the authors propose a computationally efficient iterative sequential detection algorithm that can achieve near-ML performance for V-BLAST systems. To reduce the receiver's efforts as much as possible while achieving the average bit error rate as small as possible, the proposed algorithm employs four essential ideas: adaptive number of iterative tree searching, two early termination techniques, branch metric calculation with limited constellation points, and variable stack extension. More specifically, they first establish an M-ary tree structure using QR decomposition of the channel matrix.