pith. sign in

arxiv: 2402.15681 · v1 · pith:G3KASGCLnew · submitted 2024-02-24 · 💻 cs.IT · eess.SP· math.IT

Study of Noncoherent Sparse Subarrays for Direction Finding Based on Low-Rank and Sparse Recovery

classification 💻 cs.IT eess.SPmath.IT
keywords sparsesubarraysarraynoncoherentestimationarraysdifferentlow-rank
0
0 comments X
read the original abstract

This paper investigates the problem of noncoherent direction-of-arrival (DOA) estimation using different sparse subarrays. In particular, we present a Multiple Measurements Vector (MMV) model for noncoherent DOA estimation based on a low-rank and sparse recovery optimization problem. Moreover, we develop two different practical strategies to obtain sparse arrays and subarrays: i) the subarrays are generated from a main sparse array geometry (Type-I sparse array), and ii) the sparse subarrays that are directly designed and grouped together to generate the whole sparse array (Type-II sparse array). Numerical results demonstrate that the proposed MMV model can benefit from multiple data records and that Type-II sparse noncoherent arrays are superior in performance for DOA estimation

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.