Abstract
An improved integer genetic algorithm (IIGA) that overcomes the inefficient searching and the severe computational effort of genetic algorithms (GAs) has been presented. Uniformly excited concentric ring arrays with aperture sizes from the small to the medium (the array diameter is up to 50 wavelengths) are synthesized with IIGA. All the obtained arrays meet the minimum element spacing constraint of a half-wavelength. Numerical results show IIGA can search out a lower peak sidelobe level with less iterations, which provides an alternative global optimum approach to the synthesis of planar arrays with thousands of elements.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
