Antenna array pattern synthesis via convex optimization
- 1 March 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 45 (3) , 526-532
- https://doi.org/10.1109/78.558465
Abstract
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 arraysKeywords
This publication has 15 references indexed in Scilit:
- Interconnect design using convex optimizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Semidefinite ProgrammingSIAM Review, 1996
- Antenna pattern synthesis: a new general approachProceedings of the IEEE, 1994
- Linear Matrix Inequalities in System and Control TheoryPublished by Society for Industrial & Applied Mathematics (SIAM) ,1994
- Interior-Point Polynomial Algorithms in Convex ProgrammingPublished by Society for Industrial & Applied Mathematics (SIAM) ,1994
- A new approach to the optimization of robust antenna array processorsIEEE Transactions on Antennas and Propagation, 1993
- Path-Following Methods for Linear ProgrammingSIAM Review, 1992
- Robust perturbation algorithms for adaptive antenna arraysIEEE Transactions on Antennas and Propagation, 1990
- Optimal design of efficient acoustic antenna arraysMathematical Programming, 1987
- An algorithm for linearly constrained adaptive array processingProceedings of the IEEE, 1972