检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Yanshen Du Ping Wei Huaguo Zhang
机构地区:[1]School of Electronic Engineering, University of Electronic Science and Technology of China
出 处:《Journal of Systems Engineering and Electronics》2015年第4期680-687,共8页系统工程与电子技术(英文版)
基 金:supported by the National Natural Science Foundation of China(61201282);the Science and Technology on Communication Information Security Control Laboratory Foundation(9140C130304120C13064)
摘 要: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.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).
分 类 号:TN911.7[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.227.21.218