AN IMPROVED L1-SVD ALGORITHM BASED ON NOISE SUBSPACE FOR DOA ESTIMATION

Abstract

Listen

Translate article

In this paper, an improved L1-SVD algorithm based on noise subspace is presented for direction of arrival (DOA) estimation using reweighted L1 norm constraint minimization. In the proposed method, the weighted vector is obtained by utilizing the orthogonality between noise subspace and signal subspace spanned by the array manifold matrix. The presented algorithm banishes the nonzero entries whose indices are inside of the row support of the jointly sparse signals by smaller weights and the other entries whose indices are more likely to be outside of the row support of the jointly sparse signals by larger weights. Therefore, the sparsity at the real signal locations can be enhanced by using the presented method. The proposed approach ofiers a good deal of merits over other DOA techniques. It not only increases robustness to noise, but also enhances resolution in DOA estimation. Furthermore, it is not very sensitive to the incorrect determination of the number of signals and can primely suppress spurious peak in DOA estimation. Simulation results are shown that the presented algorithm has better performance than the existing algorithms, such as MUSIC, L1-SVD algorithm.