Application of Convex Relaxation to Array Synthesis Problems

A general procedure to solve efficiently non convex array synthesis problems is presented. It is based on the SemiDefinite Relaxation (SDR) technique. The way to properly relax the constraints in order to formulate the synthesis of shaped beams, phase-only arrays and reconfigurable arrays as semidefinite programming problems is detailed. These so-approximated array synthesis problems are then convex, easy to implement and can be efficiently solved using off-the-shelf numerical routines. The conditions under which the relaxed problems provide the optimal solution to the original non convex synthesis problems are specified. Various representative numerical comparisons with arrays designed by other approaches show the validity of the proposed method and illustrate its potentialities.

[1]  C.L. Dolph,et al.  A Current Distribution for Broadside Arrays Which Optimizes the Relationship between Beam Width and Side-Lobe Level , 1946, Proceedings of the IRE.

[2]  G. Panariello,et al.  Reconfigurable arrays by phase-only control , 1989, Digest on Antennas and Propagation Society International Symposium.

[3]  Giorgio Franceschetti,et al.  Intersection approach to array pattern synthesis , 1990 .

[4]  G. Strang.  Introduction to Linear Algebra , 1993 .

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

[6]  Stephen P. Boyd,et al.  Antenna array pattern synthesis via convex optimization , 1997, IEEE Trans. Signal Process..

[7]  Stephen P. Boyd,et al.  FIR Filter Design via Spectral Factorization and Convex Optimization , 1999 .

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

[9]  Kerim Guney,et al.  Shaped‐beam pattern synthesis of equally and unequally spaced linear antenna arrays using a modified tabu search algorithm , 2003 .

[10]  Y. Rahmat-Samii,et al.  Two-pattern linear array antenna: synthesis and analysis of tolerance , 2004 .

[11]  Stephen P. Boyd,et al.  Rank minimization and applications in system theory , 2004, Proceedings of the 2004 American Control Conference.

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

[13]  G. K. Mahanti,et al.  Design of Phase-Differentiated Reconfigurable Array Antennas With Minimum Dynamic Range Ratio , 2006, IEEE Antennas and Wireless Propagation Letters.

[14]  Nathaniel E. Helwig,et al.  An Introduction to Linear Algebra , 2006 .

[15]  R. Vescovo,et al.  Reconfigurability and Beam Scanning With Phase-Only Control for Antenna Arrays , 2008, IEEE Transactions on Antennas and Propagation.

[16]  Zhi-Quan Luo,et al.  Semidefinite Relaxation of Quadratic Optimization Problems , 2010, IEEE Signal Processing Magazine.

[17]  A F Morabito,et al.  Optimal Synthesis of Sum and Difference Patterns With Arbitrary Sidelobes Subject to Common Excitations Constraints , 2010, IEEE Antennas and Wireless Propagation Letters.

[18]  P. Rocca,et al.  Differential Evolution as Applied to Electromagnetics , 2011, IEEE Antennas and Propagation Magazine.

[19]  P. J. Kajenski,et al.  Phase Only Antenna Pattern Notching Via a Semidefinite Programming Relaxation , 2012, IEEE Transactions on Antennas and Propagation.

[20]  T. Isernia,et al.  An Effective Approach to the Synthesis of Phase-Only Reconfigurable Linear Arrays , 2012, IEEE Transactions on Antennas and Propagation.

[21]  P. J. Kajenski.  Phase-only monopulse pattern notching via Semidefinite Programming , 2012, Proceedings of the 2012 IEEE International Symposium on Antennas and Propagation.