Quasi-ML detectors with soft output and low complexity for PSK modulated MIMO channels

We propose a quasi-maximum-likelihood (quasi-ML) detection scheme with soft output and low decoding complexity for multiple antenna wireless channels modulated with phase-shift keying (PSK). These detectors, which we refer to as quasi-ML PSK decoders, deploy a nonlinear programming relaxation and are able to achieve the performance of exact ML detection in a wide variety of coded or uncoded and PSK modulated multiple-antenna channels. Yet, the decoding complexity or the soft quasi-ML PSK decoders is much less than of ML detectors using exhaustive search. We also demonstrate that the quasi-ML PSK decoders possess favorable complexity properties compared to the existing sphere decoders.

[1]  Zhi-Quan Luo,et al.  Soft quasi-maximum-likelihood detection for multiple-antenna channels , 2003, IEEE International Conference on Communications, 2003. ICC '03..

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

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

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

[5]  Gerard J. Foschini,et al.  Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas , 1996, Bell Labs Technical Journal.

[6]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[7]  Zhi-Quan Luo,et al.  Soft quasi-maximum-likelihood detection for multiple-antenna wireless channels , 2003, IEEE Trans. Signal Process..

[8]  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).

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

[10]  Yin Zhang,et al.  Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs , 2002, SIAM J. Optim..