TY - JOUR
T1 - Aperiodic array layout optimization by the constraint relaxation approach
AU - Kaifas, Theodoros N.
AU - Babas, Dimitrios G.
AU - Miaris, George S.
AU - Siakavara, Katherine
AU - Vafiadis, Elias E.
AU - Sahalos, John N.
PY - 2012/1
Y1 - 2012/1
N2 - An optimization procedure for the layout assessment of electrically large but finite planar arrays is presented. The synthesis takes into account the desired directivity pattern that is prescribed employing bound constraints. Moreover, the size of the radiators is taken into account, which results in a hard nonoverlapping, between the elements, constraint. The latter should not be violated if we want the attained solution not only to obey the far-field mask, but also to be physically realizable. As stated, the optimization problem is twofold. An antenna design is associated with a packing problem. In order to take the constraints on the layout into account and solve the whole problem, we propose the constraint relaxation approach, which is equipped with a packing algorithm. Our study is applied to various initial geometries, and the resulting arrays appear to comply with the desired pattern and the nonoverlapping constraint. Several examples for different cases including symmetric arrays and a study on maximally sparse arrays are presented, which show the applicability and merit of the method.
AB - An optimization procedure for the layout assessment of electrically large but finite planar arrays is presented. The synthesis takes into account the desired directivity pattern that is prescribed employing bound constraints. Moreover, the size of the radiators is taken into account, which results in a hard nonoverlapping, between the elements, constraint. The latter should not be violated if we want the attained solution not only to obey the far-field mask, but also to be physically realizable. As stated, the optimization problem is twofold. An antenna design is associated with a packing problem. In order to take the constraints on the layout into account and solve the whole problem, we propose the constraint relaxation approach, which is equipped with a packing algorithm. Our study is applied to various initial geometries, and the resulting arrays appear to comply with the desired pattern and the nonoverlapping constraint. Several examples for different cases including symmetric arrays and a study on maximally sparse arrays are presented, which show the applicability and merit of the method.
KW - Aperiodic arrays
KW - layout optimization
KW - maximally sparse arrays
KW - packing problem
UR - http://www.scopus.com/inward/record.url?scp=84855417958&partnerID=8YFLogxK
U2 - 10.1109/TAP.2011.2167901
DO - 10.1109/TAP.2011.2167901
M3 - Article
AN - SCOPUS:84855417958
SN - 0018-926X
VL - 60
SP - 148
EP - 163
JO - IEEE Transactions on Antennas and Propagation
JF - IEEE Transactions on Antennas and Propagation
IS - 1
M1 - 6018265
ER -