Abstract

The sparse signal recovery-based direction of arrival (DOA) estimation has received a great deal of attention over the past decade. From the sparse representation point of view, $$\ell _0$$ -norm is the best choice to evaluate the sparsity of a vector. However, solving an $$\ell _0$$ -norm minimization problem is non-deterministic polynomial hard (NP-hard). Thus, The common idea for many sparse DOA estimation methods is to use the $$\ell _1$$ -norm as the sparsity metric. However, its sparse solution may not coincide with the solution resulting from the $$\ell _0$$ -norm thus deteriorating the DOA estimation performance. In this paper, we propose a new sparse method based on $$\ell _p$$ ( $$0<p<1$$ ) regularization for DOA estimation to achieve a sparser solution than $$\ell _1$$ regularization. In particular, we use the Taylor expansion to convert the $$\ell _p$$ -norm minimization problem to a weighted $$\ell _1$$ -norm problem. Then, a two-step iterative method is employed to achieve the DOA estimate. The $$\ell _p$$ ( $$0<p<1$$ ) regularization is able to improve the angle resolution, leading to an improved performance in low SNR and correlated signal scenarios. Numerical results show that our proposed method has better estimation performance than many other methods do.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call