Sparse linear array synthesis with multiple constraints using differential evolution with strategy adaptation

Sotirios K. Goudos, Katherine Siakavara, Theodoros Samaras, Elias E. Vafiadis, John N. Sahalos

Research output: Contribution to journalArticlepeer-review

Abstract

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 predefined 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.

Original languageEnglish
Article number5940202
Pages (from-to)670-673
Number of pages4
JournalIEEE Antennas and Wireless Propagation Letters
Volume10
DOIs
Publication statusPublished - 2011

Keywords

  • Differential evolution (DE)
  • genetic algorithms (GAs)
  • linear array design
  • sidelobe suppression
  • sparse array synthesis
  • unequally spaced array

Fingerprint

Dive into the research topics of 'Sparse linear array synthesis with multiple constraints using differential evolution with strategy adaptation'. Together they form a unique fingerprint.

Cite this