Computer Science – Information Theory
Scientific paper
2010-09-12
Computer Science
Information Theory
23 pages, 4 figures. Submitted to IEEE Trans. Information Theory
Scientific paper
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\`eve transform. The results are illustrated for several types of time-delay estimation problems.
Ben-Haim Zvika
Eldar Yonina C.
Michaeli Tomer
No associations
LandOfFree
Performance Bounds and Design Criteria for Estimating Finite Rate of Innovation Signals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Performance Bounds and Design Criteria for Estimating Finite Rate of Innovation Signals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Performance Bounds and Design Criteria for Estimating Finite Rate of Innovation Signals will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-326482