首页 | 本学科首页   官方微博 | 高级检索  
     检索      

Successive quadratic programming multiuser detector
作者姓名:References:
作者单位:Mu Xuewen (Dept. of Applied Mathematics, Xidian Univ., Xi'an 710071, P. R. China) ; Zhang Yaling(Dept. of Computer Science and Technology, Xi'an Univ. of Science and Technology, Xi'an 710054, P. R. China) ; Liu Sanyang(Dept. of Applied Mathematics, Xidian Univ., Xi'an 710071, P. R. China) ;
摘    要: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.

关 键 词:码分多址  多用户检测  序列二次规划  特征波形
收稿时间:1 November 2005

Successive quadratic programming multiuser detector
Mu Xuewen,Zhang Yaling,Liu Sanyang.Successive quadratic programming multiuser detector[J].Journal of Systems Engineering and Electronics,2007,18(1):8-13.
Authors:Mu Xuewen  Zhang Yaling  Liu Sanyang
Institution:1. Dept. of Applied Mathematics, Xidian Univ., Xi'an 710071, P. R. China
2. Dept. of Computer Science and Technology, Xi'an Univ. of Science and Technology, Xi'an 710054, P. R. China
Abstract: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 semidefinite 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.
Keywords:Code division multiple access  Multiuser detection  Semidefinite programming  Successive quadratic programming
本文献已被 维普 万方数据 ScienceDirect 等数据库收录!
点击此处可从《系统工程与电子技术(英文版)》浏览原始摘要信息
点击此处可从《系统工程与电子技术(英文版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号