首页> 外文会议>International Conference on Natural Computation;International Conference on Fuzzy Systems and Knowledge Discovery >Pattern synthesis of the distributed array based on the hybrid algorithm of particle swarm optimization and convex optimization
【24h】

Pattern synthesis of the distributed array based on the hybrid algorithm of particle swarm optimization and convex optimization

机译:基于粒子群优化与凸优化混合算法的分布式阵列模式综合

获取原文

摘要

To solve the high peak side-lobe level of the distributed array, a hybrid optimization method of particle swarm optimization and convex optimization is proposed in this paper. With the peak side-lobe level as the objective function, the particle swarm optimization is considered as a global optimization algorithm to optimize the elements' positions while the convex optimization is considered as a local optimization algorithm to optimize the elements' weights. In this algorithm, the reducing of the variables' dimensions and the complete match of positions and weights for every particle improve the optimal performance effectively. The results show that for a distributed linear array, the algorithm proposed in this paper can obtain a lower peak side-lobe level under the constraint of main lobe width and limited number of array elements. The better performance of pattern synthesis demonstrates the effectiveness of the algorithm.
机译:为了解决分布式阵列的高旁瓣电平问题,提出了粒子群优化和凸优化的混合优化方法。以峰值旁瓣水平为目标函数,粒子群算法被认为是用于优化元素位置的全局优化算法,而凸面算法被认为是用于优化元素权重的局部优化算法。在该算法中,减小变量的尺寸以及每个粒子的位置和权重的完全匹配可有效提高最佳性能。结果表明,对于分布式线性阵列,本文提出的算法在主瓣宽度和有限的阵列元素数量的约束下可以获得较低的峰值旁瓣电平。模式合成的更好性能证明了该算法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号