Synthesis of Sparse Linear Arrays Including Directivity via a Hybrid l1 Minimization Algorithm

A hybrid l1 minimization algorithm with enhanced sparsity is proposed for the synthesis of sparse linear arrays. Moreover, the desired directivity as a constraint condition for a fixed scanning range is included in the hybrid algorithm in order to obtain a better pattern. In particular, the proposed hybrid algorithm can be divided into two steps. The first step is to iteratively solve a smooth-weighted l1 minimization problem. The obtained weight vector is then considered as the initial weight vector in the second step, where a weighted l1 minimization problem is solved. In comparison to other methods, simulation results show that the proposed method has an improved synthesis efficiency for sparse arrays.