.png){kind=icon}
.png){kind=icon}
Return
Sparse Linear Array Synthesis With Multiple Constraints Using Differential Evolution With Strategy Adaptation
.png){kind=icon}
PRE
AI
DOI：10.1109/LAWP.2011.2161256.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This letter addresses the problem of designing sparse linear arrays with multiple constraints. The constraints could include the minimum and maximum distance between two adjacent elements, the total array length, the sidelobe level suppression in specified angular intervals, the main-lobe beamwidth, and the pre-defined number of elements. Our design method is based on differential evolution (DE) with strategy adaptation. We apply a DE algorithm (SaDE) that uses previous experience in both trial vector generation strategies and control parameter tuning. Design cases found in the literature are compared to those found by SaDE and other DE algorithms. The results show that fewer objective-function evaluations are required than those reported in the literature to obtain better designs. SaDE also outperforms the other DE algorithms in terms of statistical results.
Keywords:
Differential evolution (DE)
genetic algorithms (GAs)
linear array design
sidelobe suppression
sparse array synthesis
unequally spaced array
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