Sparse 2-D Array Placement for Arbitrary Pattern Mask and With Excitation Constraints: A Simple Deterministic Approach

Abstract

We present a novel algorithm for the synthesis of planar (2-D) arrays subject to arbitrary pattern masks and excitation constraints (e.g., dynamic range). The algorithm is simple and deterministic, and considers the radiating element pattern. The procedure starts with a conventional constrained fixed-grid synthesis on a regular lattice, yielding a goal radiated field. Next, element locations are selected sequentially by maximizing projection on field difference to goal, while excitation amplitudes are computed using fixed-grid constrained synthesis for irregular lattices. The final result is the sparse layout and constrained excitation coefficients. The proposed method is validated against literature results; application examples are given for circular flat-top, isoflux and triangular flat-top shaped beam patterns, with constraints on excitation coefficients dynamic range, both for isotropic and patch-type element patterns.