Sparsening Conformal Arrays Through a Versatile BCS-Based Method
Sparsening conformal arrangements is carried out through a versatile Multi-Task Bayesian Compressive Sensing (MT-BCS) strategy. The problem, formulated in a probabilistic fashion as a pattern-matching synthesis, is that of determining the sparsest excitation set (locations and weights) fitting a ref...
Saved in:
| Published in | IEEE transactions on antennas and propagation Vol. 62; no. 4; pp. 1681 - 1689 |
|---|---|
| Main Authors | , , , |
| Format | Journal Article |
| Language | English |
| Published |
IEEE
01.04.2014
Institute of Electrical and Electronics Engineers |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0018-926X 1558-2221 |
| DOI | 10.1109/TAP.2013.2287894 |
Cover
| Summary: | Sparsening conformal arrangements is carried out through a versatile Multi-Task Bayesian Compressive Sensing (MT-BCS) strategy. The problem, formulated in a probabilistic fashion as a pattern-matching synthesis, is that of determining the sparsest excitation set (locations and weights) fitting a reference pattern subject to user-defined geometrical constraints. Results from a set of representative numerical experiments are presented to illustrate the key-features of the proposed approach as well as to assess, also through comparisons, its potentials in terms of matching accuracy, element saving, and computational costs. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| ISSN: | 0018-926X 1558-2221 |
| DOI: | 10.1109/TAP.2013.2287894 |