一种基于最小化广义Rayleigh商的无源定位算法研究  

Research on a Passive Localization Algorithm Based on Minimizing the Generalized Rayleigh Quotient

作　　者：徐征[1,2] 曲长文[2] 王昌海[2] 李炳荣[2] 

机构地区：[1]航空电子系统综合技术重点实验室,上海200233 [2]海军航空工程学院电子信息工程系,山东烟台264001

出　　处：《电子学报》2012年第12期2446-2450,共5页Acta Electronica Sinica

基　　金：航空电子系统综合技术重点实验室和航空科学基金联合资助(No.20105584004)

摘　　要：为改善只测角无源定位的性能,提出了一种基于最小化广义Rayleigh商的无源定位算法.该算法利用扰动观测矩阵和扰动观测向量的乘性结构,将约束总体最小二乘问题转化为最小化广义Rayleigh商问题,从而只需对一对矩阵束进行广义特征值分解即可求得全局最优定位解.仿真结果表明所提算法性能稳健且计算量较小,定位收敛精度逼近克拉美罗限(CRLB),远优于最小二乘(LS)算法和总体最小二乘(TLS)算法,实用性强.In order to improve the performance of bearings-only passive localization, a new passive localization algorithm based on minimizing the generalized Rayleigh quotient was proposed, which uses the maltiplicative structure of perlurbation part of the observation matrix and observation vector. The constrained total least squares（CrY） problem was converted to the generalized Rayleigh quotient minimization problem, which only needs to do the generalized eigenvalue decomposition for a pair of matrixes to obtain the globally optimal localization solution. Simulation results indicate the proposed algorithm possesses robust performance and low computation load. Its localization solution can achieve the CRLB performance and is far better than those of the least squares （LS） algorithm and total least squares （TLS） algorithm, which implies good practicability.

关 键 词：无源定位 广义Rayleigh商 约束总体最小二乘 广义特征值分解 克拉美罗限 

分 类 号：TN958.97[电子电信—信号与信息处理]