Computer Science – Information Theory
Scientific paper
2011-02-16
Computer Science
Information Theory
Submitted to ISIT2011
Scientific paper
We have developed an approximate signal recovery algorithm with low computational cost for compressed sensing on the basis of randomly constructed sparse measurement matrices. The law of large numbers and the central limit theorem suggest that the developed algorithm saturates the Donoho-Tanner weak threshold for the perfect recovery when the matrix becomes as dense as the signal size $N$ and the number of measurements $M$ tends to infinity keep $\alpha=M/N \sim O(1)$, which is supported by extensive numerical experiments. Even when the numbers of non-zero entries per column/row in the measurement matrices are limited to $O(1)$, numerical experiments indicate that the algorithm can still typically recover the original signal perfectly with an $O(N)$ computational cost per update as well if the density $\rho$ of non-zero entries of the signal is lower than a certain critical value $\rho_{\rm th}(\alpha)$ as $N,M \to \infty$.
Kabashima Yoshiyuki
Wadayama Tadashi
No associations
LandOfFree
A signal recovery algorithm for sparse matrix based compressed sensing 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 A signal recovery algorithm for sparse matrix based compressed sensing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A signal recovery algorithm for sparse matrix based compressed sensing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-416616