Further results on performance analysis for compressive sensing using expander graphs

Compressive sensing is an emerging technology which can recover a sparse signal vector of dimension n via a much smaller number of measurements than n. In this paper, we will give further results on the performance bounds of compressive sensing. We consider the newly proposed expander graph based compressive sensing schemes [31] and show that, similar to the l(1) minimization case, we can exactly recover any k-sparse signal using only O(k log(n)) measurements, where k is the number of non-zero elements. The number of computational iterations is of order O(klog(n)), while each iteration involves very simple computational steps.