CaltechAUTHORS
  A Caltech Library Service

Robustness Analysis of a List Decoding Algorithm for Compressed Sensing

Chowdhury, Mainak and Oymak, Samet and Khajehnejad, M. Amin and Hassibi, Babak (2011) Robustness Analysis of a List Decoding Algorithm for Compressed Sensing. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20150223-073119058

Full text is not posted in this repository.

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20150223-073119058

Abstract

We analyze the noise robustness of sparse signal recon-struction based on the compressive sensing equivalent of a list-decoding algorithm for Reed Solomon codes -the Coppersmith-Sudan algorithm. We use results from the per-turbation analysis of singular subspaces of matrices to prove the existence of bounds for the noise levels (in the measure-ments) below which the error in the recovered signal (with respect to the original sparse signal) will be guaranteed to be upper bounded. Numerical simulations have been presented which compare the experimental recovery probability to the theoretical lower bound.


Item Type:Report or Paper (Discussion Paper)
Subject Keywords:Compressed Sensing, Reed Solomon decoding.
Record Number:CaltechAUTHORS:20150223-073119058
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20150223-073119058
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:55082
Collection:CaltechAUTHORS
Deposited By: Shirley Slattery
Deposited On:06 Mar 2015 18:49
Last Modified:03 Oct 2019 08:03

Repository Staff Only: item control page