.png){kind=icon}
.png){kind=icon}
Return
Linear Aperiodic Array Synthesis Using Differential Evolution Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/LAWP.2013.2270930.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, a modified differential evolution (DE) based on harmony search algorithm is developed for the linear aperiodic array synthesis. By adding the parameter selection strategy into the classic differential evolution, the modified DE combines the good local search capability of the classic DE and the great search diversity of harmony search algorithm. The pattern optimization simulations of the linear aperiodic array verify that it converges faster and requires less computation.
Keywords:
Differential evolution (DE)
pattern synthesis
peak sidelobe level (PSLL)
sparse arrays
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.8
Papers:
1.0W
Citations:
2.8W