An Effective Excitation Matching Method for the Synthesis of Optimal Compromises between Sum and Difference Patterns in Planar Arrays

In this paper, the extension of the Contiguous Partition Method (CPM) from linear to planar arrays is described and assessed. By exploiting some properties of the solution space, the generation of compromise sum-difference patterns is obtained through an optimal excitation matching procedure based on a combinatorial method. The searching of the solution is carried out thanks to an efficient path-searching algorithm aimed at exploring the solution space represented in terms of a graph. A set of representative results are reported for the assessment as well as for comparison purposes. The final version of this article is available at the url of the journal PIERB http://www.jpier.org/PIERB