Optimization of Sparse Linear Arrays Using Harmony Search Algorithms

A sparse linear array, composed of a uniformly spaced core subarray and an extended sparse subarray, is synthesized using a harmony search (HS) and an exploratory harmony search (EHS) algorithms. The optimal solution is searched by changing the amplitudes of all the elements and the positions of the...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on antennas and propagation 2015-11, Vol.63 (11), p.4732-4738
Main Authors: Yang, Song-Han, Kiang, Jean-Fu
Format: Article
Language:English
Subjects:
Antenna radiation patterns
Genetic algorithms
Linear antenna arrays
Optimization
Particle swarm optimization
Sociology
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A sparse linear array, composed of a uniformly spaced core subarray and an extended sparse subarray, is synthesized using a harmony search (HS) and an exploratory harmony search (EHS) algorithms. The optimal solution is searched by changing the amplitudes of all the elements and the positions of the extended elements, under a set of practical constraints. Performance of the EHS, the HS, a genetic algorithm (GA) and a particle swarm optimization (PSO) algorithm, has also been compared in synthesizing these sparse linear arrays.
ISSN:0018-926X
1558-2221
DOI:10.1109/TAP.2015.2476518