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.
Efficient large sparse arrays synthesis by means of smooth re-weighted L1 minimization
Pinchera, Daniele
;Migliore, Marco Donald;Lucido, Mario;Schettino, Fulvio;Panariello, Gaetano
2019-01-01
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, 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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
