Computationally-effective optimal excitation matching for the synthesis of large monopulse arrays

This contribution presents an innovative approach based on an optimal excitation matching procedure. By exploiting the relationship between independently-optimal sum and difference patterns, the dimension of the solution space is considerably reduced and efficiently sampled by taking into account the presence of array elements more suitable to change sub-array membership. In the following, the proposed technique is described pointing out, through a representative case, its potentialities and effectiveness in dealing with large arrays.