Array failure correction with a genetic algorithm
- 1 May 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Antennas and Propagation
- Vol. 47 (5), 823-828
- https://doi.org/10.1109/8.774136
Abstract
A flexible approach using the genetic algorithm (GA) is proposed for array failure correction in digital beamforming of arbitrary arrays. In this approach, beamforming weights of an array are represented directly by a vector of complex numbers. The decimal linear crossover is employed so that no binary coding and decoding is necessary. Three mating schemes, adjacent-fitness-paring (AFP), best-mate-worst (BMW), and emperor-selective (EMS), are proposed and their performances are studied. Near-solutions from other analytic or heuristic techniques may be injected into the initial population to speed up convergence. Numerical examples of single- and multiple-element failure correction are presented to show the effectiveness of the approachKeywords
This publication has 8 references indexed in Scilit:
- The Practical Handbook of Genetic AlgorithmsPublished by Informa UK Limited ,2019
- Array failure correction with a genetic algorithmIEEE Transactions on Antennas and Propagation, 1999
- Sidelobe reduction in array-pattern synthesis using genetic algorithmIEEE Transactions on Antennas and Propagation, 1997
- Array failure correction with a digitally beamformed arrayIEEE Transactions on Antennas and Propagation, 1996
- Thinned arrays using genetic algorithmsIEEE Transactions on Antennas and Propagation, 1994
- Array pattern nulling by element position perturbations using a genetic algorithmElectronics Letters, 1994
- A conjugate gradient-based algorithm to minimize the sidelobe level of planar arrays with element failuresIEEE Transactions on Antennas and Propagation, 1991
- Phase-only synthesis of minimum peak sidelobe patterns for linear and planar arraysIEEE Transactions on Antennas and Propagation, 1988