By Topic

GA optimization of terminal antennas by the estimation of the population density of probability using dependency trees

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)

The paper presents an application of a GA algorithm to the optimization of terminal antennas, where the number of variables to optimize and the complexity of the problem could make standard GA approaches fail. This GA algorithm is based on the estimation of the density of probability of the highest fitness chromosomes in the population. This estimation is achieved by the use of dependency trees whose structure varies dynamically along the optimization process. A general overview of Bayesian networks and probability theory is presented. The algorithm based on dependency trees (TREE) is presented with some examples and compared to standard GA with dual population (DUAL) and with linkage crossover operator based GA (GLINX). The structure optimised is an antenna covering three frequency bands (GSM, DCS and UMTS), with one feed port for the two lower bands and another for the upper band. Convergence curves are presented for the three algorithms.

Published in:

Antennas and Propagation Society International Symposium, 2004. IEEE  (Volume:4 )

Date of Conference:

20-25 June 2004