Antenna Array Pattern Synthesis via Convex Optimization
H. Lebret and S. Boyd
IEEE Transactions on Signal Processing, 45(3):526-532, March 1997.
We show that a variety of antenna array pattern synthesis problems can be expressed as convex optimization problems, which can be (numerically) solved with great efficiency by recently developed interior-point methods. The synthesis problems involve arrays with arbitrary geometry and element directivity, constraints on far and near field patterns over narrow or broad frequency bandwidth, and some important robustness constraints. We show several numerical simulations for the particular problem of minimizing the sidelobe level of a simple array.