The power synthesis of maximally sparse arrays such to maximize the beam efficiency over a target region Ω is addressed. In particular, Ω is the unique input parameter of the proposed design procedure, and once it has been fixed, the approach allows identifying the minimum number of elements required to achieve inside it a beam efficiency close to the theoretical maximum. The problem is cast as a convex programming one that exploits at best the compressive sensing theory. Comparisons to state-of-the-art methods are provided.
Synthesis of Maximum-Efficiency Beam Arrays via Convex Programming and Compressive Sensing
A. F. Morabito
2017-01-01
Abstract
The power synthesis of maximally sparse arrays such to maximize the beam efficiency over a target region Ω is addressed. In particular, Ω is the unique input parameter of the proposed design procedure, and once it has been fixed, the approach allows identifying the minimum number of elements required to achieve inside it a beam efficiency close to the theoretical maximum. The problem is cast as a convex programming one that exploits at best the compressive sensing theory. Comparisons to state-of-the-art methods are provided.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
MORABITO_2017_AWPL_BEAM_EDITOR.pdf
non disponibili
Descrizione: versione editoriale - SOLO GESTORI ARCHIVIO
Tipologia:
Versione Editoriale (PDF)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
255.64 kB
Formato
Adobe PDF
|
255.64 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
MORABITO_2017_AWPL_BEAM_POST.pdf
accesso aperto
Descrizione: POST-PRINT DELL'AUTORE
Tipologia:
Documento in Post-print
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
1.42 MB
Formato
Adobe PDF
|
1.42 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.