Simultaneous optimization of subarray weights and sizes for low sidelobe synthesis of large array antennas

In this paper, the synthesis of large linear arrays by means of contiguous subarrays has been dealt with. An effective approach for the simultaneous optimization of the array clustering and the subarray gains has been presented. Essentially based on an excitation matching procedure and exploiting the convexity of the functional with respect to the subarray weights, the solution space has been properly reduced and an efficient sampling algorithm has been used to look for the dasiacompromisepsila solution affording a pattern with the lowest SLL. Preliminary results have been reported in order to show potentialities and limitations of the proposed approach.