Subarray Partition in Array Antenna Based on the Algorithm X

Ziyuan Xiong

doi:10.1109/LAWP.2013.2272793

Return

Subarray Partition in Array Antenna Based on the Algorithm X

2013-01-01

PRE

DOI：10.1109/LAWP.2013.2272793

Original

Original request for help

Save

Abstract

En 中文

Subarray partition is usually employed in the design of array antennas. However, it is difficult to get an exact partition of an arbitrary antenna aperture with irregular-shaped subarrays. Based on the exact cover theory, a solution of the exact partition is developed using the algorithm X. We consider the fact that sometimes it would be unpractical to exactly partition an aperture with given-shaped subarrays. Therefore, the concept of slack unit is proposed to find the quasi-exact partition of apertures. Numerical experiments are carried out to demonstrate and validate the effectiveness of the algorithm X as well as the predominance of the irregular-shaped subarrays.

Keywords:

Algorithm X

array antenna

irregular-shaped subarray

polyform

subarray partition

time-delay scanning

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.