Dynamic programming applied to unequally spaced arrays

The application of the optimization technique known as dynamic programming to the design of "thinned" arrays with unequally-spaced elements is described. Dynamic programming is a systematic procedure for efficiently utilizing the capabilities of modern high-speed digital computing machines to find solutions to problems not computationally feasible by conventional means. In this paper it is applied to the design of linear arrays of 25 elements spaced within a 50 wavelength aperture. The results obtained compare favorably with similar results found by other design techniques. The effect on the sidelobes of varying the angular region of optimization and the spacing-quantization is also explored.