A Hybrid Approach for the Synthesis of Nonuniformly Spaced and Excited Linear Arrays With Strict Element Spacing Constraints

A hybrid methodology for the synthesis of nonuniformly spaced and excited linear arrays is proposed. At first, a modified genetic algorithm (GA) named linear-constraint genetic algorithm (LCGA) is discussed in this article to adapt to generalized linear-constraint optimization problems. Then, by nes...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on antennas and propagation Vol. 70; no. 7; pp. 5521 - 5533
Main Authors Yang, Jianhua, Yang, Peng, Yang, Feng, Xing, Zhiyu
Format Journal Article
LanguageEnglish
Published New York IEEE 01.07.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Apertures
Array synthesis
Computational geometry
Constraints
Convexity
Genetic algorithms
Genetics
hybrid method
Linear antenna arrays
Linear arrays
Mathematical programming
nonuniformly spaced and excited linear arrays
Optimization
Programming
Search problems
Synthesis
Online AccessGet full text

Cover

More Information
Summary:A hybrid methodology for the synthesis of nonuniformly spaced and excited linear arrays is proposed. At first, a modified genetic algorithm (GA) named linear-constraint genetic algorithm (LCGA) is discussed in this article to adapt to generalized linear-constraint optimization problems. Then, by nesting the technique of convex programming (CP) into LCGA, a hybrid optimization implementation is developed to jointly optimize the position and excitation variables. Due to the linear-constraint character of LCGA, array layouts can be exactly constrained with element spacings and the aperture size. A set of representative numerical experiments shows the effectiveness of this method to obtain very high-quality solutions.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-926X
1558-2221
DOI:10.1109/TAP.2022.3161525