IDEAS home Printed from https://ideas.repec.org/a/taf/tewaxx/v39y2025i10p1115-1132.html
   My bibliography  Save this article

Achievable sidelobe level of the radiation pattern of a linear antenna array thinned by the genetic algorithm

Author

Listed:
  • Maksim Stepanov

Abstract

Thinning of antenna arrays has been a popular topic for the last several decades. This paper suggests a genetic algorithm as an instrument for antenna array thinning. The algorithm with a deliberately chosen fitness function allows synthesizing thinned linear antenna arrays with low peak sidelobe level (SLL) while maintaining the half-power beamwidth (HPBW) of a full linear antenna array. A fitness function is proposed that allows determining by the genetic algorithm the location of the elements of a thinned antenna array, providing for a given amplitude distribution and number of elements a minimum SLL with a slight expansion of the main lobe of the radiation pattern. Based on results from existing papers in the field and known approaches to antenna array thinning, a classification of thinning types is introduced. The optimal thinning type for a linear thinned antenna array is determined on the basis of a maximum attainable SLL. It is shown that edge thinning of antenna arrays allows for obtaining a lower SLL than stochastic thinning. With the optimal thinning coefficient, the SLL of the radiation pattern of the full antenna array is higher than that of the thinned one with almost the same width of the main lobe. For the first time, the effect of the thinning coefficient on main directional pattern characteristics, such as peak SLL and HPBW, is discussed for a number of amplitude distributions.

Suggested Citation

  • Maksim Stepanov, 2025. "Achievable sidelobe level of the radiation pattern of a linear antenna array thinned by the genetic algorithm," Journal of Electromagnetic Waves and Applications, Taylor & Francis Journals, vol. 39(10), pages 1115-1132, July.
  • Handle: RePEc:taf:tewaxx:v:39:y:2025:i:10:p:1115-1132
    DOI: 10.1080/09205071.2025.2496751
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/09205071.2025.2496751
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/09205071.2025.2496751?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tewaxx:v:39:y:2025:i:10:p:1115-1132. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tewa .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.