Sparsening Conformal Arrays Through a Versatile [Formula Omitted]-Based Method

Sparsening conformal arrangements is carried out through a versatile Multi-Task Bayesian Compressive Sensing [Formula Omitted] 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.