Subarray Partition in Array Antenna Based on the Algorithm X

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

Full description

Saved in:
Bibliographic Details
Published in:IEEE antennas and wireless propagation letters 2013, Vol.12, p.906-909
Main Authors: Zi-Yuan Xiong, Zhen-Hai Xu, Si-Wei Chen, Shun-Ping Xiao
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Algorithm X
Antenna arrays
Apertures
array antenna
Arrays
irregular-shaped subarray
Lattices
Partitioning algorithms
polyform
subarray partition
time-delay scanning
Wideband
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1536-1225
1548-5757
DOI:10.1109/LAWP.2013.2272793