Optimal array pattern synthesis using semidefinite programming

TLDR

The paper proposes algorithms to solve two array pattern synthesis problems: designing nonuniform arrays for a desired magnitude response and achieving robust performance under uncertainties. The methods use semidefinite programming, enabling efficient implementation and handling constraints such as power limits. Illustrative examples demonstrate the effectiveness of the proposed semidefinite programming approach.

Abstract

We present algorithms for the solution of two problems in array pattern synthesis. The first is the design of nonuniform 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.