基于网格爬山法的最大似然DOA估计算法

Maximum Likelihood DOA Estimator based on Grid Hill Climbing Method

  • 摘要: 最大似然波达方向(DOA)估计具有最优的理论性能,但是存在计算量过大的问题。为了降低最大似然DOA估计的计算量,将参数估计转化为高维非线性函数的优化问题,并提出了一种新的优化算法。首先利用波束形成法对空间谱进行预估计并根据空间谱信息构造一组满足“预估分布”的初始解,这组初始解以较大概率落在全局最优解的局部吸引域中。然后将其中适应度最大的一个初始解作为局部搜索的起点。网格爬山法是一种以网格为单元的局部搜索方法,比传统爬山法更加高效和稳定,因此采用该方法获取全局最优解。新算法不仅能够得到精确的参数估计,同时具有较高的计算效率,计算机仿真显示新算法的计算效率高于基于粒子群优化的最大似然DOA估计算法。

     

    Abstract: The maximum likelihood estimator for direction of arrival (DOA) possesses optimum theoretical performance as well as high computational complexity. Taking the estimation as an optimization problem of high-dimension nonlinear function, a novel algorithm has been proposed to reduce the computational load of that. At the beginning, the beamforming method is adopted to estimate the spatial spectrum roughly, and a group of initial solutions that obey the law of the “pre-estimated distribution ” are obtained according to the information of the spatial spectrum, and the initial sulotions will locate in the local attractive area of the global optimum solution in great probability. Then, one of the soultions in this group who possesses the maximum fitness is selected to be the initial point of the local search. Grid Hill-climbing Method (GHCM) is a kinds of local search methods that takes a grid as a search unit, which is an improved version of the traditional Hill-climbing Method, and the GHCM is more efficient and stable than the traditional one, so it is adopted to obtain the global optimum solution at last. The proposed algorithm can obtain accurate DOA estimation with lower computational cost, and the simulation shows that the propoesd algorithm is more efficient than the maximum likelihood DOA estimator based on PSO .

     

/

返回文章
返回