Hybrid Approach for Sub-arrayed Monopulse Antenna Synthesis

A computationally effective hybrid approach to define the “optimal” compromise between sum and difference patterns in monopulse arrays is presented. Firstly, the partitioning into sub-arrays is performed by exploiting the knowledge of independently optimal sum and difference excitations. Then, the sub-array gains are computed by means of a gradient-based procedure, which takes advantage from the convexity of the problem at hand. Selected results are shown and compared with those from state-of-the-art methods in dealing with representative test cases. This paper is a postprint of a paper submitted to and accepted for publication in Electronics Letters and is subject to Institution of Engineering and Technology Copyright. The copy of record is available at IET Digital Library.