稳健收敛的时差频差定位技术  

A Robustly Convergent Algorithm for Source Localization Using Time Difference of Arrival and Frequency Difference of Arrival

作　　者：房嘉奇[1] 冯大政[1] 李进[1] 

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

出　　处：《电子与信息学报》2015年第4期798-803,共6页Journal of Electronics & Information Technology

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

摘　　要：为实现对目标位置和速度的精确定位,该文提出一种基于正则化理论的时差频差定位技术。该算法首先利用最大似然方法确定目标函数,然后通过传统牛顿法对目标位置和速度进行迭代求解。众所周知传统牛顿法对初始值要求较高,较差初始值会导致Hess矩阵趋于病态,从而致使迭代发散,该文引入正则化理论修正Hess矩阵,使其更加合理,保证算法稳健收敛。实验结果表明:相对于传统牛顿法,该文算法在初始值的选取上具有稳健性,对误差选取较大的初始值,仍能够保证算法的收敛性;相对于现有闭合式定位方法,该文算法在噪声较大时具有较好的定位精度,定位精度接近于Cramer-Rao界,具有广泛的实用价值。To pursue accurate source location and velocity, this paper proposes a method based on the Regularization theory to solve the source localization problem utilizing Time-Difference-Of-Arrival（TDOA） and Frequency-Difference-Of-Arrival（FDOA）. The proposed algorithm determines the objective function using the maximum likelihood estimator, and then uses classical Newton method to estimate the source position and velocity in an iterative way. It is known that the Newton method requires a good initial value, and a bad initial value can cause an ill-posed Hess matrix which leads to the iteration divergence. This paper introduces the Regularization theory to modify the Hess matrix to make it more proper, which ensures the iteration convergence. The experiment results show that compared with the classical Newton method, the proposed 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 some other closed-form source location methods, the proposed algorithm has better location accuracy in large noise levels which can achieve the Cramer-Rao bound. The proposed algorithm can be widely applied in practice.

关 键 词：无源定位 到达时差 到达频差 传统牛顿法 Hess矩阵 正则化算法 

分 类 号：TN911.7[电子电信—通信与信息系统]