Alternative formulation and applications aspects of the generalized projection method for array antenna synthesis

Abstract

An array synthesis technique is formulated, which implements the method of generalized projections in the array excitation space. This permits the use of relaxation in the overall recursion relation that is not possible with previous formulations, resulting in accelerated convergence for slowly converging problems. Weighted least squares is introduced as a backward operator in an integral way that enhances the method. Means are described for determining starting points that assist the synthesis algorithm in avoiding socalled traps. The results obtained for a diverse selection of applications of the method are discussed. These demonstrate the effects on convergence of the use of relaxation, different pattern sampling angle selection schemes, and different starting point selection schemes.

Antenna Shape Synthesis Without Prior Specification of the Feedpoint Locations

“…Those synthesis methods already in use in antenna design can be categorized as excitation optimization, size optimization, shape optimization, and material optimization. Excitation optimization includes the determination of the complex excitations of an array of known radiating elements required to provide some desired radiation pattern performance [2], [3], usually called array pattern synthesis. Size optimization is the adjustment of the values of a predetermined set of feature dimensions; the majority of antenna design procedures fall into this category.…”