Some facts and challenges in array antenna synthesis

Antennas synthesis is one of the canonical problem in applied electromagnetism. Many efforts have been done in recent years to solve the problem in convenient and accurate way. In this framework, global optimization based procedures have been widely applied. On the other side, the diffused enthusiasm for these 'physically inspired' global optimization techniques has induced to neglect, in a number of cases, some characteristics of the problem which may be useful in the synthesis process. With reference to the synthesis of array antennas, we first show that in a number of problems proposed in the literature global optimisation is not required at all, as the problem is indeed convex with respect to all the available degrees of freedom. Then, we also show that a proper exploitation of convexity with respect to a part of the unknowns (when available) allows to achieve design solutions significantly better than those available in the literature. Finally, some challenging synthesis problems which still need attention (and possibly new solution approaches) are briefly introduced.

[1]  R. Haupt,et al.  Interleaved thinned linear arrays , 2005, IEEE Transactions on Antennas and Propagation.

[2]  Y. Rahmat-Samii,et al.  Particle swarm optimization in electromagnetics , 2004, IEEE Transactions on Antennas and Propagation.

[3]  T. Isernia,et al.  An effective approach for the optimal focusing of array fields subject to arbitrary upper bounds , 2000 .

[4]  Fan Yang,et al.  Linear Antenna Array Synthesis Using Taguchi's Method: A Novel Optimization Technique in Electromagnetics , 2007, IEEE Transactions on Antennas and Propagation.

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

[6]  Derek A. McNamara,et al.  Direct synthesis of optimum difference patterns for discrete linear arrays using Zolotarev distributions , 1993 .

[7]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[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]  A. Trucco,et al.  Thinning and weighting of large planar arrays by simulated annealing , 1999, IEEE Transactions on Ultrasonics, Ferroelectrics and Frequency Control.

[10]  T. Isernia,et al.  Solving Some Array Synthesis Problems by Means of an Effective Hybrid Approach , 2007, IEEE Transactions on Antennas and Propagation.

[11]  O. Bucci,et al.  Representation of electromagnetic fields over arbitrary surfaces by a finite and nonredundant number of samples , 1998 .

[12]  Andrea Massa,et al.  Sidelobe reduction in sparse linear arrays by genetic algorithms , 2002 .

[13]  A.A. Kishk,et al.  Quantum Particle Swarm Optimization for Electromagnetics , 2006, IEEE Transactions on Antennas and Propagation.

[14]  COMPUTATIONAL COMPLEXITY IN THE ANALYSIS OF LARGE ANTENNAS , 2004 .

[15]  Tommaso Isernia,et al.  A hybrid approach for the optimal synthesis of pencil beams through array antennas , 2004 .

[16]  D.H. Werner,et al.  Particle swarm optimization versus genetic algorithms for phased array synthesis , 2004, IEEE Transactions on Antennas and Propagation.

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

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

[19]  Andrea Massa,et al.  Planar antenna array design with a multi‐purpose GA‐based procedure , 2002 .

[20]  John Darzentas,et al.  Problem Complexity and Method Efficiency in Optimization , 1983 .

[21]  F. Grimaccia,et al.  Genetical Swarm Optimization: Self-Adaptive Hybrid Evolutionary Algorithm for Electromagnetics , 2007, IEEE Transactions on Antennas and Propagation.

[22]  Paolo Rocca,et al.  Synthesis of monopulse antennas through iterative contiguous partition method , 2007 .

[23]  Yahya Rahmat-Samii,et al.  Electromagnetic Optimization by Genetic Algorithms , 1999 .

[24]  G. Franceschetti,et al.  On the degrees of freedom of scattered fields , 1989 .

[25]  Giuseppe D'Elia,et al.  Antenna pattern synthesis: a new general approach , 1994, Proc. IEEE.

[26]  V. Murino,et al.  Stochastic optimization of linear sparse arrays , 1999 .

[27]  S. Rengarajan,et al.  Genetic algorithms in the design and optimization of antenna array patterns , 1999 .

[28]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..