Successive quadratic programming multiuser detector  

作　　者：Mu Xuewen Zhang Yaling Liu Sanyang 

机构地区：[1]Dept. of Applied Mathematics, Xidian Univ., Xi'an 710071, E R. China [2]Dept. of Computer Science and Technology, Xi'an Univ. of Science and Technology, Xi'an 710054, P. R. China

出　　处：《Journal of Systems Engineering and Electronics》2007年第1期8-13,共6页系统工程与电子技术（英文版）

摘　　要：Based on the semidefinite programming relaxation of the CDMA maximum likelihood multiuser detection problem, a detection strategy by the successive quadratic programming algorithm is presented. Coupled with the randomized cut generation scheme, the suboptimal solution of the multiuser detection problem in obtained. Compared to the interior point methods previously reported based on semidefmite programming, simulations demonstrate that the successive quadratic programming algorithm often yields the similar BER performances of the multiuser detection problem. But the average CPU time of this approach is significantly reduced.Based on the semidefinite programming relaxation of the CDMA maximum likelihood multiuser detection problem, a detection strategy by the successive quadratic programming algorithm is presented. Coupled with the randomized cut generation scheme, the suboptimal solution of the multiuser detection problem in obtained. Compared to the interior point methods previously reported based on semidefmite programming, simulations demonstrate that the successive quadratic programming algorithm often yields the similar BER performances of the multiuser detection problem. But the average CPU time of this approach is significantly reduced.

关 键 词：Code division multiple access Multiuser detection Semidefinite programming Successive quadratic programming. 

分 类 号：TN914.53[电子电信—通信与信息系统]