检索结果-内蒙古大学图书馆

A Continuous Relaxation Method for multiuser detection problem

WIRELESS PERSONAL COMMUNICATIONS 2013年第3期71卷 2067-2077页

作者： Mu, Xuewen Zhang, Yaling Xidian Univ Dept Math Xian 710071 Peoples R China Xian Sci & Technol Univ Dept Comp Sci Xian 710054 Peoples R China

Based on the binary quadratic programming model of the code division multiple access maximum likelihood multiuser detection problem, a detection strategy by the continuous relaxation method is presented. The proposed method relaxes the binary quadratic programming as a nonlinear programming, which is a quadratic objective function with simple quadratic constraints. A feasible direction method is used to solve the nonlinear programming. Based on the KKT solution of the nonlinear programming, a near optimal solution is obtained for the multiuser detection problem. Simulation results show that the bit error rate performances of a detection strategy based on the continuous relaxation method is low. Furthermore, average CPU time of continuous relaxation method is much lower than that of the semidefinite programming relaxation method, especially for the large-scale detection problems. This approach provides good approximations to the optimal maximum likelihood performance.

关键词： multiuser detection problem Binary quadratic programming Continuous relaxation method Semidefinite programming

来源：评论

学校读者我要写书评

暂无评论

A Second-Order Cone Programming Method for multiuser detection problem

引用

WIRELESS PERSONAL COMMUNICATIONS 2011年第2期60卷 335-344页

作者： Mu, Xuewen Zhang, Yaling Xidian Univ Dept Appl Math Xian 710071 Peoples R China Xian Sci & Technol Univ Dept Comp Sci Xian 710054 Peoples R China

Based on the binary quadratic programming model of the CDMA maximum likelihood multiuser detection problem, a detection strategy by the second-order cone programming method is presented. The proposed method relaxes the binary quadratic programming model as a second-order cone programming model. Coupled with the sign function, a suboptimal solution is obtained for the multiuser detection problem. Comparing with the reported semidefinite programming method, simulations demonstrate that the second-order cone programming method often yields the similar bit error rate (BER) performances for the multiuser detection problem, but the average CPU time of this method is significantly reduced.

关键词： multiuser detection problem Binary quadratic programming Second-order cone programming

来源：评论

学校读者我要写书评

暂无评论

A New Rank-two Semidefinite Programming Relaxation Method for multiuser detection problem

引用

WIRELESS PERSONAL COMMUNICATIONS 2012年第1期65卷 223-233页

作者： Mu, Xuewen Zhang, Yaling Xidian Univ Dept Math Xian 710071 Peoples R China Xian Sci & Technol Univ Dept Comp Sci Xian 710054 Peoples R China

Based on the semidefinite programming relaxation model of the code division multiple access maximum likelihood multiuser detection problem, a detection strategy by the rank-two method is presented. The proposed method restricts the matrix variable in the semidefinite programming relaxation to be rank-two, and yields a quadratic objective function with simple quadratic constraints. A feasible direction method is used to solve the nonlinear programming. Coupled with randomized method, a suboptimal solution is obtained for the multiuser detection problem. Simulation results show that the bit error rate performances of a detection strategy based on the new rank-two method are almost similar to that of the detection strategy based on the semidefinite programming relaxation. Furthermore, average CPU time of the new rank-two method is at least 10 times lower than that of the semidefinite programming relaxation method, With the increasing of the users number, the average CPU time increasing rate of the new rank-two method is lower than that of the semidefinite programming relaxation method, especially for the large-scale detection problems. This approach provides good approximations to the optimal maximum likelihood performance.

关键词： multiuser detection problem Binary quadratic programming Rank-two Semidefinite programming Feasible direction method

来源：评论

学校读者我要写书评

暂无评论

Application of Semi Definite Relaxation and Variable Neighborhood Search for multiuser detection in Synchronous CDMA

引用

NETWORKS 2010年第3期55卷 187-193页

作者： Lisser, Abdel Lopez, Rafael Univ Paris 11 Rech Informat Lab F-91405 Orsay France

In this article, a detection strategy based on variable neighborhood search (VNS) and semidefinite relaxation of the multiuser model maximum likelihood (ML) is investigated. The VNS method provides a good method for solving the ML problem while keeping the integer constraints. A SDP relaxation is used as an efficient way to generate an initial solution in a limited amount of time, in particular using early termination. The SDP resolution tool used is the spectral bundle method developed by Helmberg. We show that using VNS can result in a better error rate, but at a cost of calculation time. (C) 2009 Wiley Periodicals, Inc. NETWORKS, Vol. 55(3), 187-193 2010

关键词： semidefinite programming variable neighborhood search multiuser detection problem

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：