Pattern synthesis of sparse concentric circular array based on the niche genetic algorithm

This paper proposes a new method for the pattern synthesis of sparse concentric circular array. This method can avoid the premature and improve the poor capability of local optimization of the traditional genetic algorithm. Alternatively implementing the two kinds of genetic breeding operations can effectively alleviate the dependence of the algorithm's convergence on the choice of the initial group. This paper takes the nine-ringed concentric circular array as simulation object. The results show that the number of array elements can be decreased from 278 to 140 with the simultaneous reduction in peak sidelobe level to -21.27dB, and the distortion of mainlobe is avoided.