Optimal Array Pattern Synthesis Using Semidefinite
Programming
Optimal Array Pattern Synthesis Using Semidefinite
Programming
F. Wang, V. Balakrishnan,
P. Zhou, J.
Chen, R. Yang, and C. Frank
IEEE Trans. Signal Processing,
vol. 51, no. 5, pages 1172-1183, May 2003
Abstract:
We present algorithms for the solution of two problems in array
pattern synthesis. The first is the design of non-uniform arrays
with a desired magnitude response. The second is that of robust
design, i.e., design in the presence of uncertainties. Constraints
such as power limitation can be addressed with both problems. The
algorithms that we present are based on semidefinite programming,
for which efficient software is readily available. We present
examples that illustrate the effectiveness of our approach.
Download Postscript
PDF
Bibtex entry