On the Synthesis of Sub-Arrayed Planar Array Antennas for Tracking Radar Applications

The synthesis of compromise sum and difference patterns of large planar arrays is addressed in this letter by means of a suitable implementation of the Contiguous Partition Method (CPM). By exploiting some properties of the solution space, the generation of compromise sum-difference patterns is recast as the searching of the optimal path in a graph that codes the admissible solution space. Some numerical experiments are provided in order to assess the effectiveness of the proposed method.