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

Design of concentric ring arrays for low side lobe level using SQP algorithm

Author

Listed:
  • A. Hammami
  • R. Ghayoula
  • A. Gharsallah

Abstract

In this paper, an efficient method based on the sequential quadratic programming (SQP) algorithm for the pattern synthesis of concentric rings antenna arrays to reduce side lobe levels (SLL) by controlling only the amplitude excitations of each array element was presented. SQP algorithm is a deterministic method of multi-objective optimization. It is the most widely used for the resolution of nonlinear problems. It consists of transforming the nonlinear problem to sequence of quadratic sub-problems by using a quadratic approximation of the Lagrangian function. In order to illustrate the performance of the proposed method, several examples of planar concentric rings antenna array patterns with almost one-half wavelength spaced isotropic elements to reduce the SLL and to norrow the half power beam width are presented. The results shown in this paper and compared with those obtained by the application of uniform, Hamming and Blackman weighting, demonstrate the effectiveness of this optimization method based on the SQP algorithm.

Suggested Citation

  • A. Hammami & R. Ghayoula & A. Gharsallah, 2013. "Design of concentric ring arrays for low side lobe level using SQP algorithm," Journal of Electromagnetic Waves and Applications, Taylor & Francis Journals, vol. 27(7), pages 807-818, May.
    • Handle: RePEc:taf:tewaxx:v:27:y:2013:i:7:p:807-818
    DOI: 10.1080/09205071.2013.787375
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/09205071.2013.787375
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/09205071.2013.787375?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:27:y:2013:i:7:p:807-818. 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.