Asymptotic Achievability of the CramÉr–Rao Bound for Noisy Compressive Sampling

DOI10.1109/TSP.2008.2010379zbMath1391.94137MaRDI QIDQ4571618

Vahid Tarokh, Behtash Babadi, Nicholas Kalouptsidis

Publication date: 9 July 2018

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

Mathematics Subject Classification ID

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

Related Items (2)

Recovery error analysis of noisy measurement in compressed sensing ⋮ Adaptive algorithms for sparse system identification

This page was built for publication: Asymptotic Achievability of the CramÉr–Rao Bound for Noisy Compressive Sampling