Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Error Gradient-based Variable-Lp Norm Constraint LMS Algorithm for Sparse System Identification (1509.07951v1)

Published 26 Sep 2015 in cs.SY

Abstract: Sparse adaptive filtering has gained much attention due to its wide applicability in the field of signal processing. Among the main algorithm families, sparse norm constraint adaptive filters develop rapidly in recent years. However, when applied for system identification, most priori work in sparse norm constraint adaptive filtering suffers from the difficulty of adaptability to the sparsity of the systems to be identified. To address this problem, we propose a novel variable p-norm constraint least mean square (LMS) algorithm, which serves as a variant of the conventional Lp-LMS algorithm established for sparse system identification. The parameter p is iteratively adjusted by the gradient descent method applied to the instantaneous square error. Numerical simulations show that this new approach achieves better performance than the traditional Lp-LMS and LMS algorithms in terms of steady-state error and convergence rate.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Yong Feng (28 papers)
  2. Fei Chen (123 papers)
  3. Rui Zeng (24 papers)
  4. Jiasong Wu (27 papers)
  5. Huazhong Shu (33 papers)
Citations (3)

Summary

We haven't generated a summary for this paper yet.