Skip to Main Content
In this paper, application of dynamic programming to linear arrays consisting of unequally spaced elements is investigated. Variants of the algorithms proposed previously are created and tested for optimality. The method of total enumeration is utilized to verify how close to optimal the obtained results are. The criterion for comparison used is the peak sidelobe level in a given region of optimization. Where total enumeration is not feasible, a comparison is made with an alternative method of optimization that uses simulated annealing.