Thinned arrays using genetic algorithms
暂无分享,去创建一个
Large arrays are difficult to thin in order to obtain low sidelobes. Traditional statistical methods of aperiodic array synthesis fall far short of optimum configurations. Traditional optimization methods are not well suited for optimizing a large number of parameters or discrete parameters. This paper presents how to optimally thin an array using genetic algorithms. The genetic algorithm determines which elements are turned off in a periodic array to yield the lowest maximum relative sidelobe level. Simulation results for 200 element linear arrays and 200 element planar arrays are shown. The arrays are thinned to obtain sidelobe levels of less than -20 dB. The linear arrays are also optimized over both scan angle and bandwidth. >
[1] J. Galejs,et al. Minimization of sidelobes in space tapered linear arrays , 1964 .
[2] William H. Press,et al. Numerical recipes , 1990 .
[3] C. Ruf. Numerical annealing of low-redundancy linear arrays , 1993 .
[4] Y. T. Lo,et al. A study of space-tapered arrays , 1966 .
[5] R. Willey,et al. Space tapaering of linear and planar arrays , 1962 .