Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
