A procedure for antenna array pattern synthesis
In this paper, a new iterative method for any shaped pattern synthesis for one- and two-dimensional antenna arrays is described. The object is to meet prescribed constraints on the power pattern, with an assumption on the number of antenna array elements at specified locations. The synthesis problem is solved using the method of projection on convex sets, by modeling the constraints in terms of convex sets whose elements are vectors representing the excitation coefficients. Two underlying frameworks used in solving the problem are the l2Hilbert Space and an inner product space based on convolution. The synthesis procedure is implemented using a Fast Fourier Transform algorithm.