Linear Aperiodic Array Synthesis Using an Improved Genetic Algorithm

被引:99
作者
Cen, Ling [1 ]
Yu, Zhu Liang [2 ]
Ser, Wee [3 ]
Cen, Wei [4 ]
机构
[1] ASTAR, Inst Infocomm Res I2R, Singapore 138632, Singapore
[2] S China Univ Technol, Coll Automat Sci & Engn, Guangzhou 510641, Peoples R China
[3] Nanyang Technol Univ, Singapore 639798, Singapore
[4] Elektrotechnik GmbH, D-34063 Kassel, Germany
关键词
Aperiodic arrays; beam pattern synthesis; Genetic Algorithms (GAs); linear arrays; Peak Sidelobe Level (PSL); UNEQUALLY SPACED ARRAYS; ANTENNA-ARRAYS; DESIGN; OPTIMIZATION;
D O I
10.1109/TAP.2011.2173111
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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 side-lobe. 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.
引用
收藏
页码:895 / 902
页数:8
相关论文
共 32 条
[21]   ON THE DESIGN OF MAXIMALLY SPARSE BEAMFORMING ARRAYS [J].
LEAHY, RM ;
JEFFS, BD .
IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, 1991, 39 (08) :1178-1188
[22]   Sidelobe reduction in sparse linear arrays by genetic algorithms [J].
Lommi, A ;
Massa, A ;
Storti, E ;
Trucco, A .
MICROWAVE AND OPTICAL TECHNOLOGY LETTERS, 2002, 32 (03) :194-196
[23]   Synthesis of antenna arrays using genetic algorithms [J].
Marcano, D ;
Durán, F .
IEEE ANTENNAS AND PROPAGATION MAGAZINE, 2000, 42 (03) :12-20
[24]   Synthesis of unequally spaced arrays by simulated annealing [J].
Murino, V ;
Trucco, A ;
Regazzoni, CS .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1996, 44 (01) :119-123
[25]   A NUMERICAL PATTERN SYNTHESIS ALGORITHM FOR ARRAYS [J].
OLEN, CA ;
COMPTON, RT .
IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, 1990, 38 (10) :1666-1676
[26]   Genetic algorithms and their applications [J].
Tang, KS ;
Man, KF ;
Kwong, S ;
He, Q .
IEEE SIGNAL PROCESSING MAGAZINE, 1996, 13 (06) :22-37
[27]   Synthesizing asymmetric beam patterns [J].
Trucco, A .
IEEE JOURNAL OF OCEANIC ENGINEERING, 2000, 25 (03) :347-350
[28]   Stochastic optimization of linear sparse arrays [J].
Trucco, A ;
Murino, V .
IEEE JOURNAL OF OCEANIC ENGINEERING, 1999, 24 (03) :291-299
[29]   A SIMPLE ALGORITHM TO ACHIEVE DESIRED PATTERNS FOR ARBITRARY ARRAYS [J].
TSENG, CY ;
GRIFFITHS, LJ .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1992, 40 (11) :2737-2746
[30]  
Wang LL, 2003, ASIA-PACIFIC CONFERENCE ON ENVIRONMENTAL ELECTROMAGNETICS, CEEM'2003, PROCEEDINGS, P302