Abstract
In this paper, a hybrid approach for the synthesis of the ldquooptimalrdquo compromise between sum and difference patterns for subarrayed monopulse antennas is presented. First, the subarray configuration is determined by exploiting the knowledge of the optimum difference mode coefficients to reduce the dimension of the searching space. In the second step, the subarray weights are computed by means of a convex programming procedure, which takes advantages from the convexity, for a fixed clustering, of the problem at hand. A set of representative results is reported to assess the effectiveness of the proposed approach. Comparisons with state-of-the-art techniques are also presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
