Cart (Loading....) | Create Account
Close category search window

Performance analysis of quasi-maximum-likelihood detector based on semi-definite programming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Kisialiou, M. ; Dept. of Electr. & Comput. Eng., Minnesota Univ., Minneapolis, MN, USA ; Zhi-Quan Luo

Despite its optimal bit-error-rate (BER) performance, maximum-likelihood (ML) detection is known to be NP-hard and suffers from high computational complexity. The currently popular suboptimal detectors either achieve a polynomial time complexity at the expense of BER performance degradation (e.g., MMSE detector), or offer a near ML performance with a complexity that is exponential in the worst case. The paper considers a highly efficient (polynomial worst case complexity) quasi-ML detection method based on semi-definite (SDP) relaxation. It is shown that, for a standard vector Rayleigh fading channel, this SDP-based quasi-ML detector achieves, in the high signal-to-noise ratio (SNR) region, a BER which is identical to that of the exact ML detector. In the low SNR region, we use the random matrix theory to show that the SDP-based detector serves as a constant factor approximation to the ML detector for large systems.

Published in:

Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP '05). IEEE International Conference on  (Volume:3 )

Date of Conference:

18-23 March 2005

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.