Pattern synthesis of sparse linear array by off‐grid Bayesian compressive sampling

Abstract

An off-grid (OG) pattern synthesis algorithm for sparse non-uniform linear arrays is presented. It is based on Bayesian compressive sampling (BCS), and the design of maximally sparse linear arrays for the given reference patterns can be obtained. The proposed algorithm novelly introduces the OG model into the pattern synthesis problem, and it makes the synthesis more accurate than the conventional BCS algorithm. Moreover, the proposed algorithm has the advantage of high computational efficiency, since the BCS-based algorithms can be realised by the fast relevance vector machine. Numerical experiments show that the proposed algorithm has improved accuracy in terms of normalised mean square error.