Optimal array pattern synthesis using semidefinite programming
- 13 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5, 2925-2928 vol.5
- https://doi.org/10.1109/icassp.2001.940259
Abstract
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.Keywords
This publication has 8 references indexed in Scilit:
- Antenna array pattern synthesis via convex optimizationIEEE Transactions on Signal Processing, 1997
- A flexible array synthesis method using quadratic programmingIEEE Transactions on Antennas and Propagation, 1993
- Equivalent linear array approach to array pattern synthesisIEEE Journal of Oceanic Engineering, 1993
- A simple algorithm to achieve desired patterns for arbitrary arraysIEEE Transactions on Signal Processing, 1992
- A numerical pattern synthesis algorithm for arraysIEEE Transactions on Antennas and Propagation, 1990
- Linear antenna array pattern synthesis with prescribed broad nullsIEEE Transactions on Antennas and Propagation, 1990
- Sidelobe control in cylindrical arraysIEEE Transactions on Antennas and Propagation, 1982
- A Current Distribution for Broadside Arrays Which Optimizes the Relationship between Beam Width and Side-Lobe LevelProceedings of the IRE, 1946