Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1407.6079 v1 pith:3NIG76TC submitted 2014-07-23 cs.IT math.IT

classification cs.ITmath.IT
keywords sparsesensingalgorithmmeanperformancereweightedadaptiveestimation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Sign in to comment.

Pith tools