Synthesis of Subarrayed Monopluse Arrays With Contiguous Elements Using a DE Algorithm

Subarrayed monopulse linear and conformal circular arc arrays with low-sidelobe sum and difference patterns are synthesized. For the monopulse array with a subarray partition consisting of contiguous elements to reduce the cross points, the synthesis problem is first formulated as a constrained optimization problem. Then, by defining an appropriate fitness function to convert the problem into an unconstrained one, the problem is efficiently solved by the differential evolution algorithm under successful-parent-selecting framework. The numerical results of small and large monopulse linear arrays are reported by comparisons with the state-of-the-art techniques. At last, synthesis of a monopulse conformal circular arc array is also investigated based on the same technique.