Answers are grounded in this paper and cite their sources.
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 constraining the beampattern level of a simple array for adaptive and broadband arrays.
No takes yet. Share an insight, caveat, or question.
Lebret et al. (1997) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: