added 3 research items
Resolution from co-prime arrays and from a full ULA of the size equal to the virtual size of co-prime arrays is investigated. We take into account not only the resulting beam width but also the fact that fewer measurements are acquired by co-prime arrays. This fact is relevant in compressive acquisition typical for compressive sensing. Our stochastic approach to resolution uses information distances computed from the geometrical structure of data models that is characterized by the Fisher information. The probability of resolution is assessed from a likelihood ratio test by using information distances. Based on this information-geometry approach, we compare stochastic resolution from active co-prime arrays and from the full-size ULA. This novel stochastic resolution analysis is applied in a one-dimensional angle processing. Results demonstrate the suitability in radar-resolution analysis.
A bound for sparse reconstruction involving both the signal-to-noise ratio (SNR) and the estimation grid size is presented. The bound is illustrated for the case of a uniform linear array (ULA). By reducing the number of possible sparse vectors present in the feasible set of a constrained l 1 -norm minimization problem, ambiguities in the reconstruction of a single source under noise can be reduced. This reduction is achieved by means of a proper selection of the estimation grid, which is naturally linked with the mutual coherence of the sensing matrix. Numerical simulations show the performance of sparse reconstruction with an estimation grid meeting the provided bound demonstrating the effectiveness of the proposed bound.