English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this paper, we propose two novel p-norm penalty least mean square (&#x2113;p-LMS) algorithms as supplements of the conventional &#x2113;p-LMS algorithm established for sparse adaptive filtering recently. A gradient comparator is employed to selectively apply the zero attractor of p-norm constraint for only those taps that have the same polarity as that of the gradient of the squared instantaneous error, which leads to the new proposed gradient compared p-norm constraint LMS algorithm (&#x2113;pGC-LMS). We explain that the &#x2113;pGC-LMS can achieve lower mean square error than the standard &#x2113;p-LMS algorithm theoretically and experimentally. To further improve the performance of the filter, the &#x2113;pNGC-LMS algorithm is derived using a new gradient comparator which takes the sign-smoothed version of the previous one. The performance of the &#x2113;pNGC-LMS is superior to that of the &#x2113;pGC-LMS in theory and in simulations. Moreover, these two comparators can be easily applied to other norm constraint LMS algorithms to derive some new approaches for sparse adaptive filtering. The numerical simulation results show that the two proposed algorithms achieve better performance than the standard LMS algorithm and &#x2113;p-LMS algorithm in terms of convergence rate and steady-state behavior in sparse system identification settings.

Gradient compared ℓp-LMS algorithms for sparse system identification