z-logo
Premium
Particle swarm optimization for reconfigurable phase‐differentiated array design
Author(s) -
Gies Dennis,
RahmatSamii Yahya
Publication year - 2003
Publication title -
microwave and optical technology letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.304
H-Index - 76
eISSN - 1098-2760
pISSN - 0895-2477
DOI - 10.1002/mop.11005
Subject(s) - particle swarm optimization , directivity , side lobe , antenna array , antenna (radio) , beam (structure) , electronic engineering , phased array , microwave , node (physics) , metaheuristic , engineering , computer science , algorithm , optics , acoustics , physics , telecommunications
Abstract Multiple‐beam antenna arrays have important applications in communications and radar. This paper describes a method of designing a reconfigurable dual‐beam antenna array using a new evolutionary algorithm called particle swarm optimization (PSO). The design problem is to find element excitations that will result in a sector pattern main beam with low side lobes with the additional requirement that the same excitation amplitudes applied to the array with zero phase should result in a high directivity, low side lobe, and pencil‐shaped main beam. Two approaches to the optimization are detailed. First, the PSO is used to optimize the coefficients of the Woodward–Lawson array synthesis method. Second, the element excitations will be optimized directly using PSO. The performance of the two methods is compared and the viability of the resulting designs are discussed in terms of sensitivity to errors in the excitation. Additionally, a parallel version of the particle swarm code developed for a multi‐node Beowulf cluster and the benefits that multi‐node computing bring to global optimization will be discussed. © 2003 Wiley Periodicals, Inc. Microwave Opt Technol Lett 38: 168–175, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.11005

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here