A general approach to the optimal synthesis of Shaped-Beams through fixed geometry arrays

We propose a new approach to the mask-constrained synthesis of shaped beams through fixed-geometry array antennas. The problem is cast as a (limited) number of convex programming optimizations and can deal with all kinds of linear and planar arrays, including non-uniformly spaced arrays.