pith. sign in

arxiv: 1407.6079 · v1 · pith:3NIG76TCnew · submitted 2014-07-23 · 💻 cs.IT · math.IT

Novel Realization of Adaptive Sparse Sensing with Sparse Least Mean Fourth Algorithm

classification 💻 cs.IT math.IT
keywords sparsesensingalgorithmmeanperformancereweightedadaptiveestimation
0
0 comments X
read the original abstract

Nonlinear sparse sensing (NSS) techniques have been adopted for realizing compressive sensing (CS) in many applications such as Radar imaging and sparse channel estimation. Unlike the NSS, in this paper, we propose an adaptive sparse sensing (ASS) approach using reweighted zero-attracting normalized least mean fourth (RZA-NLMF) algorithm which depends on several given parameters, i.e., reweighted factor, regularization parameter and initial step-size. First, based on the independent assumption, Cramer Rao lower bound (CRLB) is derived as for the performance comparisons. In addition, reweighted factor selection method is proposed for achieving robust estimation performance. Finally, to verify the algorithm, Monte Carlo based computer simulations are given to show that the ASS achieves much better mean square error (MSE) performance than the NSS.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.