Optimal array pattern synthesis using semidefinite programming

We present a new technique to solve array pattern synthesis problems by using semidefinite programming. We first formulate (or reformulate) the array design problems into semidefinite programming problems, and then use the recently developed efficient numerical algorithms and software to compute the numerical solution of antenna array weights. Using this approach, we can directly solve not only the standard synthesis problems for nonuniform arrays, but also the synthesis problems for arrays having power restrictions and uncertainties. Numerical examples are presented to illustrate our approach.

[1]  Kai-Bor Yu,et al.  Adaptive antenna array pattern synthesis using recursive minimum-norm solution with constraint selection and phase optimization , 1994, Proceedings of ICASSP '94. IEEE International Conference on Acoustics, Speech and Signal Processing.

[2]  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.

[3]  M. Er,et al.  A flexible array synthesis method using quadratic programming , 1993 .

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

[5]  K. Keeping,et al.  Sidelobe control in cylindrical arrays , 1982 .

[6]  Alan J. Laub,et al.  The LMI control toolbox , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[7]  R.T. Compton,et al.  A numerical pattern synthesis algorithm for arrays , 1990, International Symposium on Antennas and Propagation Society, Merging Technologies for the 90's.

[8]  L. J. Griffiths,et al.  A simple algorithm to achieve desired patterns for arbitrary arrays , 1992, IEEE Trans. Signal Process..

[9]  R. T. Compton,et al.  A numerical pattern synthesis algorithm for arrays , 1990 .