Maximum diversity detection for layered space-time codes

We propose a new iterative signal processing algorithm, which can be seen as an extension of many well-known detection algorithms for multiple-input multiple-output (MIMO) channels, e.g. zero-forcing (ZF) and successive ing and cancellation algorithms. In this paper, we apply our algorithm to the VBLAST algorithm proposed by [Wolniansky, PW, et al., 1998] and the ZF algorithm. We show, that our approach takes advantage of the maximum available diversity level to improve the initial data estimate obtained by ing the cancellation (or ZF) algorithm with a minimum additional effort. Simulation results show significant improvements in comparison to ZF and the regular VBLAST system considered in [Wolniansky, PW, et al., 1998] in terms of complexity and performance.