The Bias-Compensated Proportionate NLMS Algorithm With Sparse Penalty Constraint
نویسندگان
چکیده
منابع مشابه
An improved proportionate NLMS algorithm based on the l0 norm
The proportionate normalized least-mean-square (PNLMS) algorithm was developed in the context of network echo cancellation. It has been proven to be efficient when the echo path is sparse, which is not always the case in realworld echo cancellation. The improved PNLMS (IPNLMS) algorithm is less sensitive to the sparseness character of the echo path. This algorithm uses the l1 norm to exploit sp...
متن کاملA Variable Step-size Proportionate Nlms Algorithm for Echo Cancellation
The proportionate normalized least-mean-square (PNLMS) algorithms were developed in the context of network echo cancellation. They outperform the normalized leastmean-square (NLMS) algorithm only when the echo path is sparse. Unfortunately, realworld network echo path may not be that sparse sometimes, while the acoustic echo paths are usually less sparse. The improved PNLMS (IPNLMS) algorithm i...
متن کاملDiffusion L0-norm constraint improved proportionate LMS algorithm for sparse distributed estimation
To exploit the sparsity of the considered system, the diffusion proportionate-type least mean square (PtLMS) algorithms assign different gains to each tap in the convergence stage while the diffusion sparsity-constrained LMS (ScLMS) algorithms pull the components towards zeros in the steady-state stage. In this paper, by minimizing a differentiable cost function that utilizes the Riemannian dis...
متن کاملMSE Analysis of the Krylov-proportionate NLMS and NLMF Algorithms
This paper proposes a novel adaptive filtering algorithm which converges faster than the Krylov proportionate normalized least mean square (KPNLMS) algorithm. KPNLMS is known to exhibit faster convergence than the standard NLMS algorithm for all unknown systems. Our algorithm is named Krylov proportionate normalized least mean fourth (KPNLMF) and it deals with mean fourth minimization of the er...
متن کاملAdaptive sparsity tradeoff for ℓ1-constraint NLMS algorithm
Embedding the l1 norm in gradient-based adaptive filtering is a popular solution for sparse plant estimation. Even though the foundations are well understood, the selection of the sparsity hyper-parameter still remains today matter of study. Supported on the modal analysis of the adaptive algorithm near steady state, this paper shows that the optimal sparsity tradeoff depends on filter length, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2019.2962861