A review of recently introduced Bayesian approaches for the synthesis of maximally-sparse antenna arrays is presented. More specifically, the use of numerically-efficient techniques based on the Bayesian Compressive Sampling (BCS) is introduced to solve the linear array design problem. Towards this end, a probabilistic framework is exploited to formulate the synthesis problem, and a fast relevance vector machine (RVM) is employed for the computation of the optimal excitations and geometries. An illustrative numerical validation is presented to show the features of the proposed approach.
BCS-Based Formulations for Antenna Arrays Synthesis
Oliveri, Giacomo;Carlin, Matteo;Massa, Andrea
2012-01-01
Abstract
A review of recently introduced Bayesian approaches for the synthesis of maximally-sparse antenna arrays is presented. More specifically, the use of numerically-efficient techniques based on the Bayesian Compressive Sampling (BCS) is introduced to solve the linear array design problem. Towards this end, a probabilistic framework is exploited to formulate the synthesis problem, and a fast relevance vector machine (RVM) is employed for the computation of the optimal excitations and geometries. An illustrative numerical validation is presented to show the features of the proposed approach.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
C261.pdf
Solo gestori archivio
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
124.47 kB
Formato
Adobe PDF
|
124.47 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione