By Topic

Sidelobe reduction in array-pattern synthesis using 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
$33 $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)
Keen-Keong Yan ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Inst., Singapore ; Lu, Y.

A simple and flexible genetic algorithm (GA) for pattern synthesis of antenna array with arbitrary geometric configuration is presented. Unlike conventional GA using binary coding and binary crossover, this approach directly represents the array excitation weighting vectors as complex number chromosomes and uses decimal linear crossover without a crossover site. Compared with conventional GAs, this approach has a few advantages: giving a clearer and simpler representation of the problem, simplifying chromosome construction, and totally avoiding binary encoding and decoding so as to simplify software programming and to reduce CPU time. This method also allows us to impose constraints on phases and magnitudes of complex excitation coefficients for preferable implementation in practice using digital phase shifters and digital attenuators. Successful applications show that the approach can be used as a general tool for pattern synthesis of arbitrary arrays

Published in:

Antennas and Propagation, IEEE Transactions on  (Volume:45 ,  Issue: 7 )