By Topic

Synthesis of Sparse Planar Arrays Using Modified Real Genetic Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chen, K. ; Sch. of Electron. Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu ; Yun, X. ; Zishu He ; Chunlin Han

In array design, the positions of sparse array elements is an important concern for optimal performance in terms of its ability to achieve minimum peak sidelobe level (SLL). This paper proposes a modified real genetic algorithm (MGA) based on resetting of chromosome for the element position optimization of sparse planar arrays with rectangular boundary. And here the multiple optimization constraints include the number of elements, the aperture and the minimum element spacing. By simplifying the space between the elements from the actual distance to Chebychev distance, the MGA searches a smaller solution space by means of indirect description of individual, and it can avoid infeasible solution during the optimization process by two novel genetic operators. Finally, the simulation results confirming the great efficiency and the robustness of the proposed method are shown in this paper

Published in:

Antennas and Propagation, IEEE Transactions on  (Volume:55 ,  Issue: 4 )