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

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

Volumn III, Issue , 2005, Pages

  Kisialiou, Mikalai ^a   Luo, Zhi Quan ^a  

^a University of Minnesota   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIT ERROR RATE; COMPUTATIONAL COMPLEXITY; DETECTOR CIRCUITS; POLYNOMIAL APPROXIMATION; RAYLEIGH FADING; SIGNAL TO NOISE RATIO;

POLYNOMIAL WORST CASE COMPLEXITY; POPULAR SUBOPTIMAL DETECTORS; RANDOM MATRIX THEORY; SEMI-DEFINITE PROGRAMMING;

ERROR DETECTION;

EID: 33646764918     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2005.1415739     Document Type: Conference Paper

References (7)

1. B. Hassibi, B.M. Hochwald, "High-Rate Codes That Are Linear in Space and Time," IEEE Trans. Inform. Theory, vol. 48, no. 7, pp. 1804 - 1824, 2002.
2. E. Viterbo and J. Boutros, "A Universal Lattice Code Decoder for Fading Channels," IEEE Trans. Inform. Theory, pp. 1639 - 1642, 1999.
3. U. Fincke, M. Pohst, "Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis," Math. Comput., vol. 44, pp. 463-471, 1985.
4. J. Jalden, B. Ottersten, "An Exponential Lower Bound on the Expected Complexity of Sphere Decoding," Proc. ICASSP '04, vol. 4, pp. 393 - 396, 2004.
5. W.K. Ma, T.N. Davidson, K.M. Wong, Z.-Q. Luo and P.C. Ching, "Quasi-Maximum-Likelihood Multiuser Detection Using Semi-Definite Relaxation," IEEE Trans. Signal Processing, vol. 50, no. 4, pp. 912 - 922, 2002.
6. Z.-Q. Luo, X. Luo and M. Kisialiou, "An Efficient Quasi-Maximum-Likelihood Decoder for PSK Signals," in Proc. ICASSP '03, vol. 6, pp. VI 561 - VI 564, 2003.
7. J.W. Silverstein, Z.D. Bai, "On the Empirical Distribution of Eigenvalues of a Class of Large Dimensional Random Matrices," J. Multivariate Analysis, vol. 54, no. 2, pp. 175 - 192, 1995.