An innovative approach based on a tree-searching algorithm for the optimal matching of independently optimum sum and difference excitations

An innovative approach for the optimal matching of independently optimum sum and difference patterns through sub-arrayed monopulse linear arrays is presented. By exploiting the relationship between the independently optimal sum and difference excitations, the set of possible solutions is considerably reduced and the synthesis problem is recast as the search of the best solution in a noncomplete binary tree. Towards this end, a fast resolution algorithm that exploits the presence of elements more suitable to change subarray membership is presented. The results of a set of numerical experiments are reported in order to validate the proposed approach pointing out its effectiveness also in comparison with state-of-the-art optimal matching techniques.