%I University of Trento
%A Luca Manica
%A Paolo Rocca
%A Anna Martini
%A Andrea Massa
%D 2008
%X 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 non-complete binary tree. Towards this end, a fast resolution algorithm that exploits the presence of elements more suitable to charge sub-array 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. (c) 2008 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
%K Linear Arrays, Monopulse Antennas, Sum and Difference Pattern Synthesis, Tree-Searching Algorythm
%L elediasc12475
%T An innovative approach based on a tree-searching algorithm for the optimal matching of independently optimum sum and difference excitations