A NUMERICAL PATTERN SYNTHESIS ALGORITHM FOR ARRAYS

A numerical technique for pattern synthesis in arrays is presented. For a given set of elements, this technique allows one to find a set of array coefficients that steer the main beam in a given direction and yield sidelobes meeting a specified criterion, if such a set of array coefficients exists. If the pattern specifications cannot be met with the given elements, the algorithm finds the best attainable pattern. The advantage of this technique is that it can be used with an arbitrary set of array elements. Different elements in the array can have different element patterns, and the array can have arbitrary nonuniform spacing between elements. The synthesis technique is based on adaptive array theory. The given array elements are assumed to be used as the elements of an adaptive array. The main beam is pointed in the proper direction by choosing the steering vector for that direction. The sidelobes are controlled by introducing a large number of interfering signals at many angles throughout the sidelobe region. The algorithm iterates on the interference powers until a suitable pattern is obtained. © 1990 IEEE