Referenced Items are not available for this document.
This paper demonstrates the application of genetic algorithms (GAs) in array pattern synthesis. GAs have the ability to escape from local minima and maxima and are ideally suited for problems where the number of variables is very high. We present three examples: two for linear arrays and one involving linear and planar arrays
Published in:
Antennas and Propagation, IEEE Transactions on
(Volume:47
,
Issue:
3
)
Date of Publication: Mar 1999
- Page(s):
- 506 - 510
- ISSN :
- 0018-926X
- INSPEC Accession Number:
- 6278985
- Digital Object Identifier :
- 10.1109/8.768786
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Mar 1999
- Sponsored by :
- IEEE Antennas and Propagation Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
