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

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

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, which is based on iterative smooth re-weighted L1 minimizations, is very flexible and is capable of achiev...

Full description

Bibliographic Details
Main Authors: Daniele Pinchera, Marco Donald Migliore, Mario Lucido, Fulvio Schettino, Gaetano Panariello
Format: Article
Language:English
Published: MDPI AG 2019-01-01
Series:Electronics
Subjects:
antenna arrays
sparse arrays
radar
pattern synthesis
signal processing
Online Access:http://www.mdpi.com/2079-9292/8/1/83
Description
Summary: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, which 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.
ISSN:2079-9292

Similar Items