This paper gives an overview over work on layout and weight optimization of sparse 1D and 2D arrays which has been done over the last decade. The optimization methods have been linear programming, genetic methods and simulated annealing. The latter is our preferred method. The paper shows examples of optimized arrays on Cartesian and nonCartesian grids such as polar and hex. Non-planar arrays (...
