期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Semidefinite programming approach for TDOA/GROA based source localization
1
作者 Yanshen Du Ping Wei Huaguo Zhang 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2015年第4期680-687,共8页
Time-differences-of-arrival (TDOA) and gain-ratios-of- arrival (GROA) measurements are used to determine the passive source location. Based on the measurement models, the con- strained weighted least squares (CWL... Time-differences-of-arrival (TDOA) and gain-ratios-of- arrival (GROA) measurements are used to determine the passive source location. Based on the measurement models, the con- strained weighted least squares (CWLS) estimator is presented. Due to the nonconvex nature of the CWLS problem, it is difficult to obtain its globally optimal solution. However, according to the semidefinite relaxation, the CWLS problem can be relaxed as a convex semidefinite programming problem (SDP), which can be solved by using modern convex optimization algorithms. Moreover, this relaxation can be proved to be tight, i.e., the SDP solves the relaxed CWLS problem, and this hence guarantees the good per- formance of the proposed method. Furthermore, this method is extended to solve the localization problem with sensor position errors. Simulation results corroborate the theoretical results and the good performance of the proposed method. 展开更多
关键词 gain ratios of arrival (GROA) time difference of arrival(TDOA) LOCALIZATION constrained weighted least squares (CWLS) semidefinite programming problem (SDP).
在线阅读 下载PDF
Successive quadratic programming multiuser detector
2
作者 Mu Xuewen Zhang Yaling Liu Sanyang 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 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 random... 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.
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部