首页> 外文期刊>IEEE Transactions on Antennas and Propagation >A Prior Knowledge-Based Algorithm for Robust Design of Array Antennas With Interval Excitation and Position Uncertainties
【24h】

A Prior Knowledge-Based Algorithm for Robust Design of Array Antennas With Interval Excitation and Position Uncertainties

机译:一种基于知识的阵列天线的鲁棒设计算法,间隔激励和位置不确定性

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

In this article, the efficiency of the robust design methods for large array antennas with the simultaneous presence of interval amplitude, phase excitation errors, and antenna position errors is addressed. The CPU time for a single iteration of the robust optimization method is greatly reduced by the proposed prior knowledge-based algorithm (PKA). Mathematically, the array factor bounds of array antennas with interval uncertainties can be taken as the bounds of the modulus of the sum of the complex intervals with both the modulus and argument errors (CIMAS). The PKA for the modulus of CIMAS consists of three theorems: 1) the necessary conditions for each complex interval for the upper modulus bound of CIMAS; 2) the method for judging whether the lower modulus bound of CIMAS equals zero; and 3) the necessary conditions for each complex interval for the nonzero lower modulus bound of CIMAS. The efficiency and accuracy of PKA are demonstrated by comparisons with two popular methods. Based on genetic algorithm (GA) and PKA, the robust designs of array antennas under multiple constraints are also presented.
机译:在本文中,解决了大阵列天线的鲁棒设计方法的效率,其具有同时存在间隔幅度,相位激励误差和天线位置误差。通过所提出的基于知识的算法(PKA)大大减少了鲁棒优化方法的单一迭代的CPU时间。在数学上,可以将阵列天线的阵列因子限制具有间隔不确定性,可以作为模数和参数错误(CIMA)的复数间隔和的模数的界限。 CIMAS模量的PKA由三个定理组成:1)用于CIMA的上模量的每个复合间隔的必要条件; 2)用于判断CIMAS的较低模量是否等于零; 3)非零下模量的每个复合时间间隔的必要条件。 PKA的效率和准确性通过两种流行方法的比较来证明。基于遗传算法(GA)和PKA,还呈现了在多个约束下的阵列天线的鲁棒设计。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号