Performance Bounds and Design Criteria for Estimating Finite Rate of Innovation Signals
arXiv:1009.2221 · doi:10.1109/TIT.2012.2197719
Abstract
In this paper, we consider the problem of estimating finite rate of innovation (FRI) signals from noisy measurements, and specifically analyze the interaction between FRI techniques and the underlying sampling methods. We first obtain a fundamental limit on the estimation accuracy attainable regardless of the sampling method. Next, we provide a bound on the performance achievable using any specific sampling approach. Essential differences between the noisy and noise-free cases arise from this analysis. In particular, we identify settings in which noise-free recovery techniques deteriorate substantially under slight noise levels, thus quantifying the numerical instability inherent in such methods. This instability, which is only present in some families of FRI signals, is shown to be related to a specific type of structure, which can be characterized by viewing the signal model as a union of subspaces. Finally, we develop a methodology for choosing the optimal sampling kernels based on a generalization of the Karhunen--Loève transform. The results are illustrated for several types of time-delay estimation problems.
23 pages, 4 figures. Submitted to IEEE Trans. Information Theory
References in corpus (2)
Cited by in corpus (11)
- Structured Compressed Sensing: From Theory to Applications
- Noise Folding in Compressed Sensing
- Compressive parameter estimation in AWGN
- Xampling at the Rate of Innovation
- Sub-Nyquist Sampling: Bridging Theory and Practice
- Stability and super-resolution of generalized spike recovery
- Deep Task-Based Analog-to-Digital Conversion
- On the SNR Variability in Noisy Compressed Sensing
- Joint Transmit and Receive Filter Optimization for Sub-Nyquist Delay-Doppler Estimation
- An RKHS Approach to Estimation with Sparsity Constraints
- Determination of Multipath Security Using Efficient Pattern Matching