By Topic

Array failure correction with a genetic algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Beng-Kiong Yeo ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore ; Lu, Y.

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 approach

Published in:

Antennas and Propagation, IEEE Transactions on  (Volume:47 ,  Issue: 5 )