Preprint Article Version 1 This version is not peer-reviewed

Efficient Large Sparse Arrays Synthesis by Means of Smooth Re-Weighted L1 Minimization

Version 1 : Received: 2 November 2018 / Approved: 5 November 2018 / Online: 5 November 2018 (14:23:08 CET)

A peer-reviewed article of this Preprint also exists.

Pinchera, D.; Migliore, M.D.; Lucido, M.; Schettino, F.; Panariello, G. Efficient Large Sparse Arrays Synthesis by Means of Smooth Re-Weighted L1 Minimization. Electronics 2019, 8, 83. Pinchera, D.; Migliore, M.D.; Lucido, M.; Schettino, F.; Panariello, G. Efficient Large Sparse Arrays Synthesis by Means of Smooth Re-Weighted L1 Minimization. Electronics 2019, 8, 83.

Journal reference: Electronics 2019, 8, 83
DOI: 10.3390/electronics8010083

Abstract

In this paper we present an efficient technique for the synthesis of very large sparse arrays, with arbitrary circularly symmetrical upper bounds for the pattern specifications. The algorithm, that is based on iterative smooth re-weighted L1 minimizations is very flexible, and is capable of achieving very good performances with respect to competitive algorithms. Furthermore, thanks to its efficiency, planar arrays of hundreds of wavelengths can be synthesized with limited computational effort.

Subject Areas

Antenna Arrays; Sparse arrays; Radar; Pattern Synthesis; Signal Processing

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.