分布源目标方位估计的降维最大似然估计
Lower dimensional maximum likelihood estimation of direction of arrival for distributed sources
-
摘要: 介绍了已有的分布源目标方位估计中的最大似然估计(MLE)算法,它是四维非线性最优化问题,文中称之为四维MLE算法,因计算量庞大,同时提出了一种降为三维的MLE算法,简化为三维非线性最优化,称之为三维MLE算法。两种算法均采用牛顿型搜索算法,来搜索未知参数的全局最优点。在单次迭代过程中,三维MLE算法比四维MLE算法减少了51次协方差矩阵求逆和87次矩阵乘法,搜索效率得到提高,并且节省了存储空间。得出了新算法克拉美-罗界的计算公式,其计算量也有所降低。计算机仿真验证,三维MLE算法和四维MLE算法的估计精度相当,新算法在减少计算量的同时并无损失性能,所以实用性和实时性都得到显著提高。Abstract: In the estimation of direction of arrival(DOA) for distributed sources,maximum likelihood estimation(MLE) has attracted much attention because of its good performance.MLE is a four-dimensional non-linear optimization problem with large computational cost,and is termed 4D MLE.We propose a lower dimensional MLE algorithm,which is simplified to a three dimensional nonlinear optimization problem,therefore called 3D MLE.Both 4D and 3D algorithms use the search algorithm of the Newton type to find the globe optimum.In a single search process,compared to the 4D method,the 3D MLE can reduce inverse operations of the covariance matrix by 51 times,and reduce matrix multiplications by 87 times.The search efficiency is improved and memory is saved.The Cramér-Rao bound(CRB) for the new 3D MLE algorithm is presented,showing reduction in the computation cost.Computer simulation shows that both methods have similar estimation accuracy.The 3D algorithm can also avoid loss of performance,and is more practicable.