采用和声搜索算法研究了带约束条件的稀布线阵峰值旁瓣优化问题。探讨了稀布阵综合中的天线口径、阵元数目以及峰值旁瓣的关系,并拟合了三者的数学模型。仿真结果表明,与现有优化算法相比,改进的和声搜索算法具有更快的收敛速度;在峰值旁瓣优化中,不同阵元数目可获得最佳的天线口径;而在固定天线口径条件下,少量的阵元可获得更佳的峰值旁瓣。天线口径、阵元数目以及峰值旁瓣的相互关系可为稀布线阵的优化设计提供参考和借鉴。
A method based on harmony search algorithm for the sidelobe optimization of sparse linear array with multi-ple constraints is presented. And the relationships among the array aperture, element number and peak sidelobe level (PSLL) are given by the mathematic model. The simulation results confirm the great efficiency and fast convergence of the proposed method, compared with other algorithms. For a fixed element number, there is an optimal antenna aperture to a-chieve the lowest PSLL while there is also an optimal element number to achieve the lowest PSLL for a fixed aperture of the sparse array. The results may be used as a reference to the linear array design.