Distributed Adaptive LMF Algorithm for Sparse Parameter Estimation in Gaussian Mixture Noise
Mojtaba Hajiabadi

TL;DR
This paper introduces a distributed adaptive algorithm based on NLMF for sparse parameter estimation in Gaussian mixture noise, improving convergence and accuracy through zero-norm modification and filter cooperation.
Contribution
It presents a novel distributed adaptive NLMF algorithm with zero-norm modification for faster convergence and better sparse parameter estimation in non-Gaussian noise environments.
Findings
Proposed algorithm outperforms conventional NLMF in simulations.
Distributed cooperation enhances estimation accuracy.
Zero-norm modification accelerates convergence.
Abstract
A distributed adaptive algorithm for estimation of sparse unknown parameters in the presence of nonGaussian noise is proposed in this paper based on normalized least mean fourth (NLMF) criterion. At the first step, local adaptive NLMF algorithm is modified by zero norm in order to speed up the convergence rate and also to reduce the steady state error power in sparse conditions. Then, the proposed algorithm is extended for distributed scenario in which more improvement in estimation performance is achieved due to cooperation of local adaptive filters. Simulation results show the superiority of the proposed algorithm in comparison with conventional NLMF algorithms.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsSPEED: Separable Pyramidal Pooling EncodEr-Decoder for Real-Time Monocular Depth Estimation on Low-Resource Settings
