一种低复杂度的动目标DOA估计算法  

A low complexity DOA estimation algorithm for moving sources

作　　者：艾名舜[1,2] 马红光[1] 刘刚[2] 

机构地区：[1]第二炮兵工程学院,陕西西安710025 [2]信息综合控制国家重点实验室,四川成都610036

出　　处：《电路与系统学报》2011年第3期138-142,共5页Journal of Circuits and Systems

摘　　要：针对运动目标信号波达方向(DOA)估计问题,提出将简化的数据投影法(DPM)与快速求根MUISC(FR-MUSIC)算法相结合,得到了一种新的动目标DOA估计算法。该算法的特点是利用FR-MUSIC中的子矩阵求逆过程抵消了原DPM算法中的正交化步骤,从而在不损失DOA估计性能的前提下,将子空间跟踪的运算量降至同类算法运算量的下限。与经典的同类算法相比,新算法具有相近的估计性能和较低的计算复杂度,仿真实验结果验证了该算法的有效性。Aiming at the problem of moving sources direction-of-arrival（DOA） estimation,a novel algorithm is proposed,which combines a simplified data projection method（DPM） and the fast Root-MUSIC（FR-MUSIC）.The distinct point of proposed algorithm is that taking advantage of the sub-matrix inversion of the FR-MUSIC,the orthogonalization of the original DPM is removed,so that the computational load of the subspace-tracking procedure is reduced to the lowest bound of that of the algorithms in the some class,and the proposed algorithm does not loss any performance of DOA estimation.Compared with a classical algorithm of the kind,the novel algorithm possesses similar performance but lower computational complexity,and the results of simulation verify its validity.

关 键 词：低复杂度 数据投影法 DOA估计 动目标 

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