Computer Science – Information Theory
Scientific paper
2010-06-24
Computer Science
Information Theory
15 pages, one figure with four rows
Scientific paper
In this work, we obtain sufficient conditions for the ``stability" of our recently proposed algorithms, modified-CS (for noisy measurements) and Least Squares CS-residual (LS-CS), designed for recursive reconstruction of sparse signal sequences from noisy measurements. By ``stability" we mean that the number of misses from the current support estimate and the number of extras in it remain bounded by a time-invariant value at all times. The concept is meaningful only if the bound is small compared to the current signal support size. A direct corollary is that the reconstruction errors are also bounded by a time-invariant and small value.
No associations
LandOfFree
Stability (over time) of Modified-CS and LS-CS for Recursive Causal Sparse Reconstruction 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 Stability (over time) of Modified-CS and LS-CS for Recursive Causal Sparse Reconstruction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stability (over time) of Modified-CS and LS-CS for Recursive Causal Sparse Reconstruction will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-676255