2019
DOI: 10.1049/el.2019.1229
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of three interval arithmetic‐based algorithms for antenna array pattern upper bound estimation

Abstract: This Letter reveals the underlying relations of three state-of-the-art interval arithmetic (IA)-based algorithms for antenna array pattern upper bound estimation with excitation amplitude errors. Theoretical analysis proves that the matrix IA algorithm has better performance than both the rIA and circular IA algorithms. Mathematical derivations are presented in detail, and representative numerical examples are given for validating this conclusion.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
6
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(6 citation statements)
references
References 9 publications
0
6
0
Order By: Relevance
“…Although well established, statistical methods have not always guaranteed reliable confidence bounds, some extreme cases can still fall outside the bounds. On the contrary, IA based methods introduce intervals to represent the possible values of the element excitation including both amplitude and phase, and predict the array performance by its upper and lower bounds [30][31][32][33][34][35][36][37][38][39][40]. Thanks to the inclusion property of IA to deal with uncertainties, the determined bounds of antenna array pattern are finite and inclusive thus reliable.…”
Section: Introductionmentioning
confidence: 99%
“…Although well established, statistical methods have not always guaranteed reliable confidence bounds, some extreme cases can still fall outside the bounds. On the contrary, IA based methods introduce intervals to represent the possible values of the element excitation including both amplitude and phase, and predict the array performance by its upper and lower bounds [30][31][32][33][34][35][36][37][38][39][40]. Thanks to the inclusion property of IA to deal with uncertainties, the determined bounds of antenna array pattern are finite and inclusive thus reliable.…”
Section: Introductionmentioning
confidence: 99%
“…They analyzed and compared the difference between the upper and lower boundaries of three interval algorithms to calculate the power pattern of an array antenna. 24,25 However, studies on IA-based tolerance analysis of the patch are lacking.…”
Section: Introductionmentioning
confidence: 99%
“…To minimize the over‐estimation problem of the conventional interval‐based method, the Minkowski sum 22 and Taylor expansion 23 methods are proposed, and they have achieved good results. They analyzed and compared the difference between the upper and lower boundaries of three interval algorithms to calculate the power pattern of an array antenna 24,25 . However, studies on IA‐based tolerance analysis of the patch are lacking.…”
Section: Introductionmentioning
confidence: 99%
“…Indeed, the only quantities involved in the IA-based maths are the endpoints of the intervals of the input variables (i.e., the antenna descriptors such as the excitations for the antenna arrays) affected by uncertainties. Thanks to these advantages, IA-based methods have been profitably applied to different antenna systems and devices such as PAs [18]- [23], reflector antennas [24] [25], reflectarrays, [26] and antenna materials [27] or radomes [28] [29]. Moreover, IA-based tolerance analysis techniques have been exploited, jointly with optimization algorithms, for the robust synthesis of antennas [30] [31] [32] in order to obtain antenna designs resilient to uncertainties within the considered error intervals, without the need of correcting their effects through suitable compensation methods [33]- [35].…”
mentioning
confidence: 99%
“…Successive extensions have dealt with calibration errors and mutual coupling effects through the circular interval arithmetic and the circular IA in which the intervals are represented as circles in the complex plane centered in the nominal value and characterized by an interval radius proportional to the error tolerance [39]. To mitigate the dependency problem 2 , a Taylor expansion has been used to estimate the sensitivity of the array pattern performance on small errors in the excitation amplitudes [21], while a matrixbased IA method has been applied to PAs with errors on the amplitude coefficients [22] [23]. The presence of both amplitude and phase deviations from the nominal array weights has 2 The dependency problem arises when an interval variable is present more than once into an expression.…”
mentioning
confidence: 99%