홈 › Papers

Worst-case analysis of array beampatterns using interval arithmetic

Over the past decade, interval arithmetic (IA) has been utilized to determine tolerance bounds of phased array beampatterns. IA only requires that the errors of the array elements are bounded, and can provide reliable beampattern bounds even when a statistical model is missing. However, previous research has not explored the use of IA to find the error realizations responsible for achieving specific bounds. In this study, the capabilities of IA are extended by introducing the concept of ``backtracking'', which provides a direct way of addressing how specific bounds can be attained. Backtracking allows for the recovery of both the specific error realization and the corresponding beampattern, enabling the study and verification of which errors result in the worst-case array performance in terms of the peak sidelobe level. Moreover, IA is made applicable to a wider range of arrays by adding support for arbitrary array geometries with directive elements and mutual coupling, in addition to element amplitude, phase, and positioning errors. Lastly, a simple formula for approximate bounds of uniformly bounded errors is derived and numerically verified. This formula gives insights into how array size and apodization cannot reduce the worst-case peak sidelobe level beyond a certain limit.

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반