稳健收敛的时差定位迭代算法  

Robust Iterative Algorithm for Source Localization Using TDOA

作　　者：房嘉奇[1] 李进[1] 

机构地区：[1]西安电子科技大学雷达信号处理国家重点实验室,西安710071

出　　处：《现代导航》2015年第5期424-429,共6页Modern Navigation

基　　金：国家自然科学基金(61271293)资助课题

摘　　要：为实现目标精确定位,减少初始值对目标定位精度产生的影响,该文提出了一种稳健收敛的时差定位迭代算法。该算法利用最大似然方法确定目标函数,运用牛顿法对目标位置进行迭代求解,对于计算过程中可能出现的病态Hessian矩阵,运用正则化理论构造一个对称正定的Hessian矩阵,使算法能够稳健高效的运行。实验结果表明:相对于传统牛顿法,本文算法在初始值的选取上具有稳健性,对误差选取较大的初始值,仍能够保证算法的收敛性,相对于现有闭合式定位方法,本文算法在噪声较大时具有较好的定位精度。For the purpose of pursuing precise source localization and reducing the impact of location accuracy brought by the initial value, an iterative algorithm which can converge robustly is proposed in this paper for the source localization using time-difference-of-arrival （TDOA）. The new algorithm firstly introduces the maximum likelihood method to determine the objective function, and then uses the Newton method to find the source location. With the problem of the ill-condition Hessian matrix, the algorithm uses the Regularization theory to construct a symmetric definite Hessian matrix, which ensures the robust and the efficient of the algorithm. Experiments results show that this new algorithm is robust to the initial value, and is still able to ensure its convergence even with an inaccurate initial value of large error compared with the classical Newton method, and then compared with some other closed-form source location methods, the new algorithm has better accuracy in large noise levels.

关 键 词：TDOA 正则化算法 HESSIAN矩阵 CRLB 

分 类 号：TN917[电子电信—通信与信息系统]