Please use this identifier to cite or link to this item:
Title: Linear aperiodic array synthesis using an improved genetic algorithm
Authors: Cen, Ling
Yu, Zhu Liang
Ser, Wee
Cen, Wei
Keywords: DRNTU::Engineering::Electrical and electronic engineering
Issue Date: 2011
Source: Cen, L., Yu, Z. L., Ser, W., & Cen, W. (2012). Linear aperiodic array synthesis using an improved genetic algorithm. IEEE Transactions on Antennas and Propagation, 60(2), 895-902.
Series/Report no.: IEEE transactions on antennas and propagation
Abstract: A novel algorithm on beam pattern synthesis for linear aperiodic arrays with arbitrary geometrical configuration is presented in this paper. Linear aperiodic arrays are attractive for their advantages on higher spatial resolution and lower sidelobe. However, the advantages are attained at the cost of solving a complex non-linear optimization problem. In this paper, we explain the Improved Genetic Algorithm (IGA) that simultaneously adjusts the weight coefficients and inter-sensor spacings of a linear aperiodic array in more details and extend the investigations to include the effects of mutual coupling and the sensitivity of the Peak Sidelobe Level (PSL) to steering angles. Numerical results show that the PSL of the synthesized beam pattern has been successfully lowered with the IGA when compared with other techniques published in the literature. In addition, the computational cost of our algorithm can be as low as 10% of that of a recently reported genetic algorithm based synthesis method. The excellent performance of IGA makes it a promising optimization algorithm where expensive cost functions are involved.
DOI: 10.1109/TAP.2011.2173111
Schools: School of Electrical and Electronic Engineering 
Rights: © 2011 IEEE.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:EEE Journal Articles

Citations 5

Updated on May 27, 2023

Web of ScienceTM
Citations 5

Updated on May 29, 2023

Page view(s) 10

Updated on Jun 3, 2023

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.