2010/06/24 by Namrata Vaswani, Vaswani, Namrata
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #Methodology (stat.ME) #cs.IT #math.IT #stat.ME
paper · pdf · doi:10.48550/arxiv.1006.4818
15 pages, one figure with four rows
arxiv created 2010/06/24 · arxiv updated 2010/06/25
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.