Low-Complexity DOA Estimation Based on Constraint Solution Space

The Weighted Subspace Fitting (WSF) algorithm is one of the universal algorithms in Direction-Of-Arrival (DOA) estimation, which is of high accuracy. However, it involves the multi-dimensional nonlinear optimization problem, and the computational complexity is usually high. In this paper, we propose a low-complexity DOA estimation algorithm based on constraint solution space. Firstly, we use ESPRIT algorithm to limit the solution space around the best solution and reduce the computational range. Then, we find the best solution in a smaller solution space constraint by Cramr-Rao Bound (CRB), and seek repeatedly until reaching the global optimal solution of WSF algorithm by using the space of the best solution. By limiting the searching process in smaller solution space, this strategy controls the direction of convergence and reduces computational complexity. The experimental results show that this algorithm needs less iterations when the same DOA accuracy is required, and the computational complexity is apparently reduced.