By exploiting an innovative total-variation compressive sensing (TV-CS) formulation, a new method for the synthesis of physically contiguous clustered linear arrays is presented. The computation of the feed network excitations is recast as the maximization of the gradient sparsity of the excitation vector subject to matching a user-defined pattern. The arising TV-CS functional is then optimized by means of a deterministic alternating direction algorithm. A selected set of representative numerical results, drawn from a wide validation, is reported to illustrate the potentialities and the limitations of the proposed approach when clustering arrays of both ideal and realistic antenna elements. Comparisons with some competitive state-of-the-art subarraying techniques are performed as well.

A Total-Variation Sparseness-Promoting Method for the Synthesis of Contiguously Clustered Linear Arrays / Anselmi, N.; Gottardi, G.; Oliveri, G.; Massa, A.. - In: IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION. - ISSN 0018-926X. - STAMPA. - 2019, 67:7(2019), pp. 4589-4601. [10.1109/TAP.2019.2911375]

A Total-Variation Sparseness-Promoting Method for the Synthesis of Contiguously Clustered Linear Arrays

Anselmi N.;Gottardi G.;Oliveri G.;Massa A.
2019

Abstract

By exploiting an innovative total-variation compressive sensing (TV-CS) formulation, a new method for the synthesis of physically contiguous clustered linear arrays is presented. The computation of the feed network excitations is recast as the maximization of the gradient sparsity of the excitation vector subject to matching a user-defined pattern. The arising TV-CS functional is then optimized by means of a deterministic alternating direction algorithm. A selected set of representative numerical results, drawn from a wide validation, is reported to illustrate the potentialities and the limitations of the proposed approach when clustering arrays of both ideal and realistic antenna elements. Comparisons with some competitive state-of-the-art subarraying techniques are performed as well.
7
Anselmi, N.; Gottardi, G.; Oliveri, G.; Massa, A.
A Total-Variation Sparseness-Promoting Method for the Synthesis of Contiguously Clustered Linear Arrays / Anselmi, N.; Gottardi, G.; Oliveri, G.; Massa, A.. - In: IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION. - ISSN 0018-926X. - STAMPA. - 2019, 67:7(2019), pp. 4589-4601. [10.1109/TAP.2019.2911375]
File in questo prodotto:
File Dimensione Formato  
08692382.pdf

Solo gestori archivio

Tipologia: Versione editoriale (Publisher’s layout)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 3.12 MB
Formato Adobe PDF
3.12 MB Adobe PDF   Visualizza/Apri
R332.pdf

accesso aperto

Tipologia: Pre-print non referato (Non-refereed preprint)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 1.92 MB
Formato Adobe PDF
1.92 MB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11572/240138
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 9
  • ???jsp.display-item.citation.isi??? 8
social impact