中圖分類號：TP391 文獻標志碼：A DOI: 10.16157/j.issn.0258-7998.222999 中文引用格式： 姜文琦,，張華美，王祥夫. 基于混沌遺傳算法的二維平面陣研究[J]. 電子技術(shù)應(yīng)用,，2023,，49(4)：68-72. 英文引用格式： Jiang Wenqi，Zhang Huamei,，Wang Xiangfu. Research on two-dimensional planar array based on chaotic genetic algorithm[J]. Application of Electronic Technique,，2023,，49(4)：68-72.
Research on two-dimensional planar array based on chaotic genetic algorithm
Jiang Wenqi1,，Zhang Huamei1,，2，Wang Xiangfu1
(1.College of Electronic and Optical Engineering,， Nanjing University of Posts and Telecommunications,， Nanjing 210023， China,； 2.State Key Laboratory of Millimeter Wave,， Southeast University， Nanjing 210096,， China)
Abstract： Aiming at the problem of high sidelobe in the pattern of general uniform planar array, the traditional genetic algorithm is used to arrange the uniform array in two-dimensional sparse distribution,which effectively reduces the sidelobe level, but the convergence speed of genetic algorithm is slow and easy to fall into local optimal solution. Because chaotic optimization algorithm has the characteristics of randomness, ergodicity and regularity, introducing chaotic optimization algorithm into genetic algorithm and initializing population by chaotic sequence can improve the convergence speed of genetic algorithm and the ability to obtain global optimal solution. Therefore, a genetic algorithm based on chaotic optimization algorithm is proposed and applied to the design of two-dimensional planar array antenna.The algorithm optimizes the layout of antenna array. The simulation results show that the convergence speed of chaotic genetic algorithm is improved and the sidelobe level of array antenna is further reduced,which shows that this method is feasible.
Key words : two-dimensional planar array,；convergence speed；reducing side lobe,；genetic algorithm,；chaos
