约束最小二乘无源定位算法的求解与分析  

Solution and analysis of constrained least square passive location algorithm

作　　者：李淳[1,2] 刘聪锋[3] 廖桂生[1] 李艳斌[2] 

机构地区：[1]西安电子科技大学雷达信号处理国家重点实验室,陕西西安710071 [2]中国电子科技集团公司第54研究所,河北石家庄050081 [3]西安电子科技大学电子对抗研究所,陕西西安710071

出　　处：《系统工程与电子技术》2012年第2期221-226,共6页Systems Engineering and Electronics

基　　金：国家自然科学基金(61072107);国家杰出青年基金(60825104);中央高校基本科研业务费专项资金(JY10000902025);中国博士后科学基金(20090451252);陕西省科技厅工业公关项目(2009K08-31)资助课题

摘　　要：针对约束最小二乘无源定位算法中最优Lagrange乘数的求解问题,提出了新的计算方法。通过详细分析该定位算法的最优化问题求解过程,给出了求解最优Lagrange乘数的准确公式,同时将其转化为等价的多项式方程,并推导了相应的多项式方程系数。通过仿真实验,分析了最小二乘定位算法的性能,重点分析了最优Lagrange乘数的选取对算法性能的影响,并给出了经验选取方法,验证了所提方法的正确性和有效性。In order to obtain the optimal Lagrange multiplier of the constrained least square passive location algorithm, a new method is proposed. With the detail analysis of the solving process of the optimization problem, the explicit formula for solving the Lagrange multiplier is obtained. At the same time, the formula is converted to an equivalent polynomial equation, and the coefficients are deduced. With detail simulation experiments, the performance of the least square location algorithms is analyzed, and the impact of the Lagrange multiplier selection is also analyzed. Moreover, the experiential selecting method is given, and the correctness and validness of the proposed algorithm are attested.

关 键 词：无源定位 时差定位 最小二乘 到达时间差 

分 类 号：TN957[电子电信—信号与信息处理]