A PSO Based on SA for the Sparse Linear Array Synthesis with Multiple Constraints
Authors:
- 1 July 2018
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 545-546
Abstract
This paper presents a kind of particle swarm optimization (PSO) algorithm which is based on simulated annealing (SA) for the synthesis of sparse linear arrays. This algorithm is used to optimize the element positions to suppress the peak side lobe level (PSLL) of the array with many constraints. With this method the freedom increase amounts are used as optimization variables, which plus the minimum element spacing constraint is deemed as element spacing of the array. And the method has downsized the searching region by indirect expression of element spacing. The simulated optimization results demonstrate the better suppression effect of PSLL of the proposed algorithm.Keywords
This publication has 3 references indexed in Scilit:
- Modified Compact Genetic Algorithm for Thinned Array SynthesisIEEE Antennas and Wireless Propagation Letters, 2015
- Synthesis of Large Thinned Planar Arrays Using a Modified Iterative Fourier TechniqueIEEE Transactions on Antennas and Propagation, 2014
- Design of unequally spaced arrays for performance improvementIEEE Transactions on Antennas and Propagation, 1999