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

Pattern-reconfigurable sparse array synthesis with minimum element spacing constraint

Author

Listed:
  • Zhongyuan Wang
  • Min Xu
  • Mingwei Shen
  • Yipin Shen

Abstract

Due to the coupling effects caused by closely spaced array elements, the minimum spacing constraint is introduced into the synthesis of a multiple-pattern sparse array, and a low-complexity off-grid sparse reconstruction algorithm is applied to achieve precise array element position. The auxiliary weighted vector with spacing constraint is incorporated into the off-grid synthesis problem, transforming the initial l0-norm optimization into the mixed l0/l1-norm optimization, and a sequential alternating iteration (SAI) method has been presented to approach the optimization problems. In addition, convex optimization is employed to simultaneously obtain offsets to decrease reconstruction errors in different beam patterns. The experimental results show that the SAI method achieves the desired antenna patterns for multiple scanning angles through the optimal arrangement of sparse array elements while ensuring sufficient array element spacing. Compared to the previous method, the pattern error is reduced by 16.67% and the sparsity is increased by 20%.

Suggested Citation

  • Zhongyuan Wang & Min Xu & Mingwei Shen & Yipin Shen, 2025. "Pattern-reconfigurable sparse array synthesis with minimum element spacing constraint," Journal of Electromagnetic Waves and Applications, Taylor & Francis Journals, vol. 39(7), pages 810-821, May.
  • Handle: RePEc:taf:tewaxx:v:39:y:2025:i:7:p:810-821
    DOI: 10.1080/09205071.2025.2477662
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/09205071.2025.2477662?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:7:p:810-821. 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.