Soft quasi-maximum-likelihood detection for multiple-antenna channels

The paper addresses soft maximum-likelihood (ML) detection for multiple-antenna wireless channels. We propose a soft quasi-ML detector, which maximizes the log-likelihood function by developing a semi-definite relaxation (SDR). Given perfect channel state information at the receiver, the quasi-ML detector achieves the performance of the optimal ML detector in both coded and uncoded multiple-input multiple-output (MIMO) channels with quadrature phase-shift keying modulation and frequency-flat Rayleigh fading. The complexity of the quasi-ML SDR detector is much less than that of the optimal ML detector, and, thus, the quasi-ML detector offers more favorable performance/complexity trade-off. Compared to the existing sphere decoder the quasi-ML detector enjoys low polynomial worst-case complexity, as well as guaranteed near capacity performance.

[1]  Y. Nesterov Quality of semidefinite relaxation for nonconvex quadratic optimization , 1997 .

[2]  Zhi-Quan Luo,et al.  Quasi-maximum-likelihood multiuser detection using semi-definite relaxation with application to synchronous CDMA , 2002, IEEE Trans. Signal Process..

[3]  Emre Telatar,et al.  Capacity of Multi-antenna Gaussian Channels , 1999, Eur. Trans. Telecommun..

[4]  Babak Hassibi,et al.  Towards closing the capacity gap on multiple antenna channels , 2002, 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing.

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

[6]  U. Fincke,et al.  Improved methods for calculating vectors of short length in a lattice , 1985 .

[7]  Babak Hassibi,et al.  On the expected complexity of integer least-squares problems , 2002, 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[8]  Patrick Robertson,et al.  A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[9]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[10]  Alain Glavieux,et al.  Reflections on the Prize Paper : "Near optimum error-correcting coding and decoding: turbo codes" , 1998 .

[11]  Sergio Benedetto,et al.  A soft-input soft-output maximum a posteriori (MAP) module to decode parallel and serial concatenated codes , 1996 .

[12]  Robert J. Vanderbei,et al.  An Interior-Point Method for Semidefinite Programming , 1996, SIAM J. Optim..

[13]  R. Vanderbei,et al.  Max-min eigenvalue problems, primal-dual Interior point algorithms, and Trust region subproblemst , 1995 .

[14]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[15]  B. Hassibi,et al.  On the expected complexity of sphere decoding , 2001, Conference Record of Thirty-Fifth Asilomar Conference on Signals, Systems and Computers (Cat.No.01CH37256).