Low-Complexity Algorithm for Near-Optimum Detection of V-BLAST Systems

For the Vertical Bell Laboratories Layered Space-Time systems, the optimum a posteriori probability detector encounters the problem of calculating Gaussian mixtures with large numbers of components. In this letter, a new detector is proposed, which consists of an minimum-mean-square-error generalized decision feedback equalization-based dominant symbol combinations selection algorithm for mixture components reduction, and a Cholesky factorization-based efficient algorithm for likelihood function calculation. The new detector can obtain near optimum performance with a complexity much lower than that of a previous sequential algorithm with Gaussian approximation.

[1]  John M. Cioffi,et al.  On the relation between V-BLAST and the GDFE , 2001, IEEE Communications Letters.

[2]  H. Vincent Poor,et al.  Downlink capacity of interference-limited MIMO systems with joint detection , 2004, IEEE Transactions on Wireless Communications.

[3]  Christophe Andrieu,et al.  Gaussian approximation based mixture reduction for near optimum detection in MIMO systems , 2005, IEEE Communications Letters.

[4]  Zhan Guo,et al.  Algorithm and implementation of the K-best sphere decoding for MIMO detection , 2006, IEEE Journal on Selected Areas in Communications.

[5]  Mahesh K. Varanasi,et al.  Decision Feedback Multiuser Detection: A Systematic Approach , 1999, IEEE Trans. Inf. Theory.

[6]  Georgios B. Giannakis,et al.  Approaching MIMO channel capacity with reduced-complexity soft sphere decoding , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[7]  Stephan ten Brink,et al.  Achieving near-capacity on a multiple-antenna channel , 2003, IEEE Trans. Commun..