2008
DOI: 10.1002/mmce.20299
|View full text |Cite
|
Sign up to set email alerts
|

Design of a linear array antenna for shaped beam using genetic algorithm

Abstract: A linear array antenna design with desired radiation pattern has been presented based on genetic algorithm (GA) approach. Examples of cosecant and flat-topped beam patterns are illustrated to show the flexibility of GA to solve complex antenna synthesis problems by suitably selecting the fitness function, even with a simple GA. The results have been validated by IE3D electromagnetic simulation. The antenna arrays with different element geometries can also be implemented using the proposed technique. V V C 2008… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(5 citation statements)
references
References 15 publications
0
5
0
Order By: Relevance
“…Considering the total radiation pattern of an antenna array as in equation ( 1), the optimization problem that GA is trying to maximize is displayed as [41]…”
Section: Genetic Algorithmmentioning
confidence: 99%
“…Considering the total radiation pattern of an antenna array as in equation ( 1), the optimization problem that GA is trying to maximize is displayed as [41]…”
Section: Genetic Algorithmmentioning
confidence: 99%
“…Selection, crossover, and mutation. The crossover and the mutation methods are similar to the traditional genetic algorithm [26][27][28], as shown in Figure 2a,b, respectively.…”
Section: Description Of the Genetic Algorithm Flowmentioning
confidence: 99%
“…These four different algorithms include the GA [36][37][38][39], the particle swarm optimization (PSO) [40][41][42], the DE, and the DDE. In our simulation, when the cost function is less than the threshold value or algorithm does not find a better individual within 300 successive generations, the algorithm will be terminated, and a solution is then obtained.…”
Section: Comparison Of Ga Particle Swarm Optimization De and Ddementioning
confidence: 99%