By Topic

An Innovative Approach Based on a Tree-Searching Algorithm for the Optimal Matching of Independently Optimum Sum and Difference Excitations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Manica, L. ; Trento Univ., Trento ; Rocca, P. ; Martini, A. ; Massa, A.

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.

Published in:

Antennas and Propagation, IEEE Transactions on  (Volume:56 ,  Issue: 1 )