Method for sparse planar array synthesis

Abstract

The present disclosure relates to the field of array antenna synthesis, in particular to a method for sparse planar array synthesis. In order to balance weights of an exploitation process and an exploration process, a nonlinear function reconstruction is used for a math optimizer accelerated in an arithmetic optimization algorithm; the top three optimal individuals are used to replace the current optimal individuals for exploration and exploitation, and an elite variation strategy is introduced to enhance the ability of the algorithm to jump out of local optimum and improve convergence accuracy of the algorithm. An adaptive matrix mapping rule is proposed to judge the current array element distribution. If the current array element distribution does not satisfy a constraint of minimum array element spacing, the current array element distribution is adjusted by an adjustment strategy to ensure the freedom of array elements while avoiding infeasible solutions.

Dependencies are inferred from the claim text.