The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
A stochastic gradient adaptive filter with gradient adaptive step size
Abstract
The step size of this adaptive filter is changed according to a gradient descent algorithm designed to reduce the squared estimation error during each iteration. An approximate analysis of the performance of the adaptive filter when its inputs are zero mean, white, and Gaussian noise and the set of optimal coefficients are time varying according to a random-walk model is presented. The algorithm has very good convergence speed and low steady-state misadjustment. The tracking performance of these algorithms in nonstationary environments is relatively insensitive to the choice of the parameters of the adaptive filter and is very close to the best possible performance of the least mean square (LMS) algorithm for a large range of values of the step size of the adaptation algorithm. Several simulation examples demonstrating the good properties of the adaptive filters as well as verifying the analytical results are also presented.>
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
Stationary and nonstationary learning characteristics of the LMS adaptive filter
Widrow, B., McCool, J. M., Larimore, M. G., & Johnson, C. R. (1976) · Proceedings of the IEEE · doi:10.1109/proc.1976.10286 · Cited by 1,268
Stationary and Nonstationary Learning Characteristics of the LMS Adaptive Filter
Widrow, B., McCool, J., Larimore, M. G., & Johnson, C. R. (1977) · Aspects of Signal Processing · doi:10.1007/978-94-010-1223-2_23 · Cited by 1,195
A variable step (VS) adaptive filter algorithm
Harris, R., Chabries, D., & Bishop, F. (1986) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1986.1164814 · Cited by 377
Convergence analysis of LMS filters with uncorrelated Gaussian data
Feuer, A., & Weinstein, E. (1985) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1985.1164493 · Cited by 375
Improved convergence analysis of stochastic gradient adaptive filters using the sign algorithm
Mathews, V., & Cho, S. (1987) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1987.1165167 · Cited by 299
Self-citationAdaptive algorithms with an automatic gain control feature
Shan, T., & Kailath, T. (1988) · IEEE Transactions on Circuits and Systems · doi:10.1109/31.1709 · Cited by 131
Adaptive filters with individual adaptation of parameters
Mikhael, W. B., Wu, F., Kazovsky, L. G., Kang, G. S., & Fransen, L. (1986) · IEEE Transactions on Circuits and Systems · doi:10.1109/tcs.1986.1085982 · Cited by 117
Dual Sign Algorithm for Adaptive Filtering
Kwong, C. (1986) · IRE Transactions on Communications Systems · doi:10.1109/tcom.1986.1096490 · Cited by 75
Cited by
A robust variable step-size LMS-type algorithm: analysis and simulations
Aboulnasr, T., & Mayyas, K. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.558478 · Cited by 732
The Quaternion LMS Algorithm for Adaptive Filtering of Hypercomplex Processes
Took, C. C., & Mandic, D. P. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.2010600 · Cited by 332
A brief survey of machine learning methods and their sensor and IoT applications
Shanthamallu, U. S., Spanias, A., Tepedelenlioglu, C., & Stanley, M. (2017) · 2017 8th International Conference on Information, Intelligence, Systems & Applications (IISA) · doi:10.1109/iisa.2017.8316459 · Cited by 264
Metadata
- Authors
- Mathews, V. J., & Xie, Z.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 1993-06
- Volume
- 41
- Issue
- 6
- Pages
- 2075-2087
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2132749914
- Cited by
- 390
- References
- 8
- FWCI
- 1.40
- Type
- journal article
- Language
- en
- Open access
- closed
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.