Array Pattern Synthesis Via Sparse Weight Vector Finding and Convex Programming

In array pattern synthesis, smaller aperture or fewer elements are expected to obtain the desired array performance. In this paper, a novel approach is proposed to design a non-uniform array with a desired pattern. First, this problem is formulated as finding a sparse weight vector. Second, the antenna elements corresponding to nonzero values of the sparse weight vector are retained to form the non-uniform array. Finally, the weight vector of the non-uniform array is optimized via convex programming. Numerical examples are provided to verify the superior performance of the proposed method.