An Effective Compressed-Sensing Inspired Deterministic Algorithm for Sparse Array Synthesis

Aim of this paper is to discuss a novel technique for sparse array synthesis. The synthesis strategy is based on a sparse-forcing algorithm using an improvement of the reweighted ℓ1 minimization proposed in the framework of the compressed-sensing literature, specifically modified in order to tailor both linear and conformal array synthesis problems. The numerical examples show that the proposed algorithm improves the results provided by concurrent techniques, reducing the number of radiating elements and/or the computational effort.