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 t...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on antennas and propagation Vol. 69; no. 3; pp. 1355 - 1368
Main Authors Wang, Congsi, Yuan, Shuai, Gao, Wei, Jiang, Chao, Yan, Yuefei, Zheng, Yuanpeng, Wang, Zhihai, Wang, Meng, Song, Xueguan
Format Journal Article
LanguageEnglish
Published New York IEEE 01.03.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary: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.
ISSN:0018-926X
1558-2221
DOI:10.1109/TAP.2020.3026880