Synthesis of Sparse Arrays With a More Efficient Reweighted $\boldsymbol{l}_{1}$-norm Minimization Algorithm

An improved reweighted $l$ 1 -norm optimization algorithm is proposed, which can synthesize sparse arrays at a faster rate. The proposed improvement method is also suitable for improving the computational efficiency of other sparse array synthesis algorithms. In the iterative calculation process of the reweighted $l_{1}$ -norm minimization algorithm, the proposed improvement method is to reduce the amount of calculation by adaptively reducing the number of excitation variables to be solved, thereby reducing the time spent in the calculation process. Compared with the traditional $l$ 1 -norm minimization algorithm, the improved algorithm proposed has higher computational efficiency, and the optimality of the integrated result does not decrease. This method has obvious advantages in synthesizing complex problems such as large arrays.