The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
$l_{0}$ Norm Constraint LMS Algorithm for Sparse System Identification
Open accessAbstract
In order to improve the performance of least mean square (LMS) based system identification of sparse systems, a new adaptive algorithm is proposed which utilizes the sparsity property of such systems. A general approximating approach onl0norm-a typical metric of system sparsity, is proposed and integrated into the cost function of the LMS algorithm. This integration is equivalent to add a zero attractor in the iterations, by which the convergence rate of small coefficients, that dominate the sparse system, can be effectively improved. Moreover, using partial updating method, the computational complexity is reduced. The simulations demonstrate that the proposed algorithm can effectively improve the performance of LMS-based identification algorithms on sparse system.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Proportionate normalized least-mean-squares adaptation in echo cancelers
Duttweiler, D. L. (2000) · IEEE Transactions on Speech and Audio Processing · doi:10.1109/89.861368 · Cited by 879
Advanced television systems for terrestrial broadcasting: Some problems and some proposed solutions
Schreiber, W. F. (1995) · Proceedings of the IEEE · doi:10.1109/5.387095 · Cited by 205
Exploiting sparsity in adaptive filters
Martin, R. K., Sethares, W. A., Williamson, R. C., & Johnson, C. R. (2002) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2002.800414 · Cited by 123
Adaptive algorithms for sparse echo cancellation
Naylor, P. A., Cui, J., & Brookes, M. (2005) · Signal Processing · doi:10.1016/j.sigpro.2005.09.015 · Cited by 107
Metadata
- Authors
- Gu, Y., Jin, J., & Mei, S.
- Venue
- IEEE Signal Processing Letters
- Published
- 2009-09
- Volume
- 16
- Issue
- 9
- Pages
- 774-777
- ISSN
- 1070-9908 (ISSN-L)
- 1558-2361
- OpenAlex
- W2293909378
- Cited by
- 460
- References
- 6
- FWCI
- 9.44
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.