论文信息 - Application of semi-definite relaxation to multiuser detection in a CDMA context

Application of semi-definite relaxation to multiuser detection in a CDMA context

Many signal processing applications boil down to solve combinatorial optimization problems. Recently, Semi-Definite Relaxation (SDR) has been shown to be a very promising approach to combinatorial optimization, where SDR serves as tractable convex relaxation of NP hard problems. In this paper, we present an efficient algorithm for solving SDR with a low complexity. The main focus of this paper is on non-linear programming algorithms based on a change of variables that replaces the symmetrical, positive Semi-Definite variable X in SDR with a rectangular variable V according to . Some recent results on the rank of extreme correlation matrices permit to derive a low-complexity algorithm with almost no performance loss. Very encouraging results are obtained to solve large scale combinatorial optimization programs, as the one arising in multi-user detection for CDMA systems. V V X T =

E. Moulines | M. Abdi

[1] C. Helmberg. Semidefinite Programming for Combinatorial Optimization , 2000 .

[2] Sergio Verdu,et al. Multiuser Detection , 1998 .

[3] H. Vincent Poor,et al. Iterative multiuser receivers for CDMA channels: an EM-based approach , 1996, IEEE Trans. Commun..

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

[5] Alexander I. Barvinok,et al. Problems of distance geometry and convex properties of quadratic maps , 1995, Discret. Comput. Geom..

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

[7] Gábor Pataki,et al. On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues , 1998, Math. Oper. Res..

[8] Renato D. C. Monteiro,et al. A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization , 2003, Math. Program..