<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
	<record>
		<datafield tag="980" ind1=" " ind2=" ">
			<subfield code="a">CONF</subfield>
		</datafield>
		<datafield tag="970" ind1=" " ind2=" ">
			<subfield code="a">Gozcu_CAMSAP_2013/IDIAP</subfield>
		</datafield>
		<datafield tag="245" ind1=" " ind2=" ">
			<subfield code="a">Manifold Sparse Beamforming</subfield>
		</datafield>
		<datafield tag="700" ind1=" " ind2=" ">
			<subfield code="a">Gözcü, Baran</subfield>
		</datafield>
		<datafield tag="700" ind1=" " ind2=" ">
			<subfield code="a">Asaei, Afsaneh</subfield>
		</datafield>
		<datafield tag="700" ind1=" " ind2=" ">
			<subfield code="a">Cevher, Volkan</subfield>
		</datafield>
		<datafield tag="856" ind1="4" ind2="0">
			<subfield code="i">EXTERNAL</subfield>
			<subfield code="u">http://publications.idiap.ch/attachments/papers/2014/Gozcu_CAMSAP_2013.pdf</subfield>
			<subfield code="x">PUBLIC</subfield>
		</datafield>
		<datafield tag="711" ind1="2" ind2=" ">
			<subfield code="a">IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing</subfield>
			<subfield code="c">Saint Martin, France</subfield>
		</datafield>
		<datafield tag="260" ind1=" " ind2=" ">
			<subfield code="c">2013</subfield>
			<subfield code="b">IEEE</subfield>
		</datafield>
		<datafield tag="773" ind1=" " ind2=" ">
			<subfield code="c">113-116</subfield>
			<subfield code="z">978-1-4673-3144-9</subfield>
		</datafield>
		<datafield tag="024" ind1="7" ind2=" ">
			<subfield code="a">10.1109/CAMSAP.2013.6714020</subfield>
			<subfield code="2">doi</subfield>
		</datafield>
		<datafield tag="520" ind1=" " ind2=" ">
			<subfield code="a">We consider the minimum variance distortionless response (MVDR) beamforming problems where the array covariance matrix is rank deficient. The conventional approach handles such rank-deficiencies via diagonal loading on the covariance matrix. In this setting, we show that the array weights for optimal signal estimation can admit a sparse representation on the array manifold. To exploit this structure, we propose a convex regularizer in a grid-free fashion, which requires semidefinite programming. We then provide numerical evidence showing that the new formulation can significantly outperform diagonal loading when the regularization parameters are correctly tuned.</subfield>
		</datafield>
	</record>
</collection>