Optimal Synthesis of Sum and Difference Patterns With Arbitrary Sidelobes Subject to Common Excitations Constraints

An innovative and computationally effective approach to the synthesis of optimal sum and difference patterns via uniformly spaced arrays with a number of common excitations is presented and assessed. The proposed technique takes advantage from known results in the (separate) optimal synthesis of sum and difference patterns and allows one to manage arbitrary and different bounds concerning both the sidelobe level (SLL) and the beamwidth (BW) of the couple of patterns while sharing part of the feeding network. A set of examples is provided to support the underlying theory and to show potentialities and features of the arising procedure.

[1]  P. Rocca,et al.  An Innovative Approach Based on a Tree-Searching Algorithm for the Optimal Matching of Independently Optimum Sum and Difference Excitations , 2008, IEEE Transactions on Antennas and Propagation.

[2]  Francisco J. Ares-Pena,et al.  Synthesising Taylor and Bayliss linear distributions with common aperture tail , 2009 .

[3]  Tommaso Isernia,et al.  Optimal synthesis of difference patterns subject to arbitrary sidelobe bounds by using arbitrary array antennas , 2005 .

[4]  Ta-Sung Lee,et al.  Subarray-synthesized low-side-lobe sum and difference patterns with partial common weights , 1993 .

[5]  T. Isernia,et al.  An Effective Hybrid Approach for the Optimal Synthesis of Monopulse Antennas , 2007, IEEE Transactions on Antennas and Propagation.

[6]  Thomas A. Milligan,et al.  Modern Antenna Design: Milligan/Modern Antenna Design , 2005 .

[7]  F. Ares Pena,et al.  Optimal Compromise Among Sum and Difference Patterns in Monopulse Antennas: Use of Subarrays and Distributions with Common Aperture Tail , 2009 .

[8]  A. Massa,et al.  Optimization of the difference patterns for monopulse antennas by a hybrid real/integer-coded differential evolution method , 2005, IEEE Transactions on Antennas and Propagation.

[9]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[10]  E. Moreno,et al.  Optimal compromise among sum and difference patterns , 1996 .

[11]  T. Isernia,et al.  Optimal far-field focusing of uniformly spaced arrays subject to arbitrary upper bounds in nontarget directions , 2002 .

[12]  D. McNamara.  Maximisation of normalised boresight slope of a difference array of discrete elements , 1987 .

[13]  E. Moreno,et al.  Subarray weighting for the difference patterns of monopulse antennas: joint optimization of subarray configurations and weights , 2001 .

[14]  Z. Nie,et al.  The Application of a Modified Differential Evolution Strategy to Some Array Pattern Synthesis Problems , 2008, IEEE Transactions on Antennas and Propagation.

[15]  P. Rocca,et al.  A Fast Graph-Searching Algorithm Enabling the Efficient Synthesis of Sub-Arrayed Planar Monopulse Antennas , 2009, IEEE Transactions on Antennas and Propagation.

[16]  T. Taylor,et al.  Design of circular apertures for narrow beamwidth and low sidelobes , 1960 .