Complex-Weight Sparse Linear Array Synthesis by Bayesian Compressive Sampling

Abstract

An innovative method for the synthesis of maximally sparse linear arrays matching arbitrary reference patterns is proposed. In the framework of sparseness constrained optimization, the approach exploits the multi-task ( <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">MT</i> ) Bayesian compressive sensing ( <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">BCS</i> ) theory to enable the design of complex non-Hermitian layouts with arbitrary radiation and geometrical constraints. By casting the pattern matching problem into a probabilistic formulation, a Relevance-Vector-Machine ( <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">RVM</i> ) technique is used as solution tool. The numerical assessment points out the advances of the proposed implementation over the extension to complex patterns of and it gives some indications about the reliability, flexibility, and numerical efficiency of the <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">MT</i> - <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">BCS</i> approach also in comparison with state-of-the-art sparse-arrays synthesis methods.