2017 Sixth Asia-Pacific Conference on Antennas and Propagation (APCAP) 2017
DOI: 10.1109/apcap.2017.8420873
|View full text |Cite
|
Sign up to set email alerts
|

Synthesis of nonuniform sparse linear array antenna using whale optimization algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
4
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 6 publications
0
4
0
Order By: Relevance
“…The WOA [35] has also been employed recently in various optimization problems of antenna design. The optimization problem of sidelobe suppression has been addressed in [64][65][66][67][68]. In detail, Yuan et al [64] applied the WOA to the synthesis of a sparse antenna array.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The WOA [35] has also been employed recently in various optimization problems of antenna design. The optimization problem of sidelobe suppression has been addressed in [64][65][66][67][68]. In detail, Yuan et al [64] applied the WOA to the synthesis of a sparse antenna array.…”
Section: Related Workmentioning
confidence: 99%
“…The optimization problem of sidelobe suppression has been addressed in [64][65][66][67][68]. In detail, Yuan et al [64] applied the WOA to the synthesis of a sparse antenna array. Their objective was to achieve a significantly lower peak sidelobe level (pSSL) value in the radiation pattern of the antenna array.…”
Section: Related Workmentioning
confidence: 99%
“…To reduce the number of elements while keeping the array factor unchanged, the spaces between the elements had better be different. The special types of arrays created in this way are called nonuniformly spaced antenna arrays (NSAA) [3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22].…”
Section: Introductionmentioning
confidence: 99%
“…These methods can be divided into two main groups. First group includes various optimization procedures such as genetic algorithm (GA), dynamic programming (DP), particle swarm optimization (PSO), differential evolution algorithm (DEA) [3][4][5][6][7][8][9][10][11]. Second group includes various analytical procedures such as perturbation, integral techniques, probabilistic approaches, matrix pencil method (MPM) and iterations methods [12][13][14][15][16][17][18][19][20][21][22][23][24][25][26][27][28][29].…”
Section: Introductionmentioning
confidence: 99%