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, plant sparsity and signal-to-noise ratio. In a practical implementation, these terms are obtained with an unsupervised mechanism tracking the filter weights. Simulation results prove the robustness and superiority of the novel adaptive-tradeoff sparsity-aware method.
منابع مشابه
Sparse least mean fourth filter with zero-attracting ℓ1-norm constraint
Traditional stable adaptive filter was used normalized least-mean square (NLMS) algorithm. However, identification performance of the traditional filter was especially vulnerable to degradation in low signal-noise-ratio (SRN) regime. Recently, adaptive filter using normalized least-mean fourth (NLMF) is attracting attention in adaptive system identifications (ASI) due to its high identification...
متن کاملSparsity-aware Adaptive Filtering Algorithms and Application to System Identification
In this thesis, low-complexity adaptive filtering algorithms that exploit the sparsity of signals and systems are derived and investigated. Specifically, sparsity-aware normalized least-mean square and affine projection algorithms are developed based on the l1-norm incorporated to their cost function, which we term zero-attracting NLMS (ZA-NLMS) and zero-attracting APA (ZA-APA). These algorithm...
متن کاملLeast Mean Square Algorithm with Application to Improved Adaptive Sparse Channel Estimation
Least mean square (LMS) based adaptive algorithms have been attracted much attention since their low computational complexity and robust recovery capability. To exploit the channel sparsity, LMS-based adaptive sparse channel estimation methods, e.g., L1-norm LMS or zero-attracting LMS (sparse LMS or ZA-LMS), reweighted zero attracting LMS (RZA-LMS) and Lp-norm LMS (LP-LMS), have been proposed b...
متن کاملVariable is Better Than Invariable: Stable Sparse VSS-NLMS Algorithms with Application to Estimating MIMO Channels
To estimate multiple-input multiple-output (MIMO) channels, invariable step-size normalized least mean square (ISSNLMS) algorithm was applied to adaptive channel estimation (ACE). Since the MIMO channel is often described by sparse channel model due to broadband signal transmission, such sparsity can be exploited by adaptive sparse channel estimation (ASCE) methods using sparse ISS-NLMS algorit...
متن کاملAdaptive sparse system identification using normalized least mean fourth algorithm
Normalized least mean square (NLMS) was considered as one of the classical adaptive system identification algorithms. Because most of systems are often modeled as sparse, sparse NLMS algorithm was also applied to improve identification performance by taking the advantage of system sparsity. However, identification performances of NLMS type algorithms cannot achieve high-identification performan...
متن کامل