Search arXivSearch

arXiv · 1303.2257

A stochastic gradient approach on compressive sensing signal reconstruction based on adaptive filtering framework

Abstract

Based on the methodological similarity between sparse signal reconstruction and system identification, a new approach for sparse signal reconstruction in compressive sensing (CS) is proposed in this paper. This approach employs a stochastic gradient-based adaptive filtering framework, which is commonly used in system identification, to solve the sparse signal reconstruction problem. Two typical algorithms for this problem: $l_0$-least mean square ($l_0$-LMS) algorithm and $l_0$-exponentially forgetting window LMS ($l_0$-EFWLMS) algorithm are hence introduced here. Both the algorithms utilize a zero attraction method, which has been implemented by minimizing a continuous approximation of $l_0$ norm of the studied signal. To improve the performances of these proposed algorithms, an $l_0$-zero attraction projection ($l_0$-ZAP) algorithm is also adopted, which has effectively accelerated their convergence rates, making them much faster than the other existing algorithms for this problem. Advantages of the proposed approach, such as its robustness against noise etc., are demonstrated by numerical experiments.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jian Jin, Yuantao Gu, Shunliang Mei. 2013-03-09. A stochastic gradient approach on compressive sensing signal reconstruction based on adaptive filtering framework. https://doi.org/10.1109/jstsp.2009.2039173

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT