Block- and Rank-Sparse Recovery for Direction Finding in Partly Calibrated Arrays

DOI10.1109/TSP.2017.2770104MaRDI QIDQ4621549zbMATH OpenOpenAlexFDO

Authors Christian Steffens, Marius Pesavento

Publication date 12 February 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1702.05411

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: A sparse recovery approach for direction finding in partly calibrated arrays composed of subarrays with unknown displacements is introduced. The proposed method is based on mixed nuclear norm and 1 norm minimization and exploits block-sparsity and low-rank structure in the signal model. For efficient implementation a compact equivalent problem reformulation is presented. The new technique is applicable to subarrays of arbitrary topologies and grid-based sampling of the subarray manifolds. In the special case of subarrays with a common baseline our new technique admits extension to a gridless implementation. As shown by simulations, our new block- and rank-sparse direction finding technique for partly calibrated arrays outperforms the state of the art method RARE in difficult scenarios of low sample numbers, low signal-to-noise ratio or correlated signals.

Cited in

(2)

This page was built for publication: Block- and Rank-Sparse Recovery for Direction Finding in Partly Calibrated Arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4621549)