The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Stationary and nonstationary learning characteristics of the LMS adaptive filter
Abstract
This paper describes the performance characteristics of the LMS adaptive filter, a digital filter composed of a tapped delay line and adjustable weights, whose impulse response is controlled by an adaptive algorithm. For stationary stochastic inputs, the mean-square error, the difference between the filter output and an externally supplied input called the "desired response," is a quadratic function of the weights, a paraboloid with a single fixed minimum point that can be sought by gradient techniques. The gradient estimation process is shown to introduce noise into the weight vector that is proportional to the speed of adaptation and number of weights. The effect of this noise is expressed in terms of a dimensionless quantity "misadjustment" that is a measure of the deviation from optimal Wiener performance. Analysis of a simple nonstationary case, in which the minimum point of the error surface is moving according to an assumed first-order Markov process, shows that an additional contribution to misadjustment arises from "lag" of the adaptive process in tracking the moving minimum point. This contribution, which is additive, is proportional to the number of weights but inversely proportional to the speed of adaptation. The sum of the misadjustments can be minimized by choosing the speed of adaptation to make equal the two contributions. It is further shown, in Appendix A, that for stationary inputs the LMS adaptive algorithm, based on the method of steepest descent, approaches the theoretical limit of efficiency in terms of misadjustment and speed of adaptation when the eigenvalues of the input correlation matrix are equal or close in value. When the eigenvalues are highly disparate (λmax/λmin> 10), an algorithm similar to LMS but based on Newton's method would approach this theoretical limit very closely.
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
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
Linear prediction: A tutorial review
Makhoul, J. (1975) · Proceedings of the IEEE · doi:10.1109/proc.1975.9792 · Cited by 4,023
WIDROW, B., & HOFF, M. E. (1960) · doi:10.21236/ad0241531 · Cited by 4,009
Self-citationAdaptive noise cancelling: Principles and applications
Widrow, B., Glover, J. R., McCool, J. M., Kaunitz, J., Williams, C. S., Hearn, R. H., Zeidler, J. R., Eugene Dong, Jr., & Goodlin, R. C. (1975) · Proceedings of the IEEE · doi:10.1109/proc.1975.10036 · Cited by 3,939
Self-citationAn algorithm for linearly constrained adaptive array processing
Frost, O. L. (1972) · Proceedings of the IEEE · doi:10.1109/proc.1972.8817 · Cited by 2,533
Widrow, B., Mantey, P. E., Griffiths, L. J., & Goode, B. B. (1967) · Proceedings of the IEEE · doi:10.1109/proc.1967.6092 · Cited by 1,051
Self-citationPrinciples of data communication
Lucky, R. W., Weldon, E. J., & Salz, J. (1968) · CERN Document Server (European Organization for Nuclear Research) · Cited by 754
Buehler, R. J., & Wilde, D. J. (1965) · Econometrica · doi:10.2307/1909808 · Cited by 695
Dvoretzky, A. (1956) · Contribution to the Theory of Statistics · doi:10.1525/9780520313880-007 · Cited by 323
Automatic equalization for digital communication
Becker, F. K., Holzman, L. N., Lucky, R. W., & Port, E. (1965) · Proceedings of the IEEE · doi:10.1109/proc.1965.3546 · Cited by 317
Cited by
Godara, L. C. (1997) · Proceedings of the IEEE · doi:10.1109/5.622504 · Cited by 2,073
Fundamentals of Adaptive Filtering
Ramirez, P. S. (2002) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-1-4757-3637-3_2 · Cited by 1,958
A hierarchical neural-network model for control and learning of voluntary movement
Kawato, M., Furukawa, K., & Suzuki, R. (1987) · Biological Cybernetics · doi:10.1007/bf00364149 · Cited by 1,573
Qureshi, S. (1982) · IEEE Communications Magazine · doi:10.1109/mcom.1982.1090994 · Cited by 1,457
A variable step size LMS algorithm
Kwong, R. H., & Johnston, E. W. (1992) · IEEE Transactions on Signal Processing · doi:10.1109/78.143435 · Cited by 1,097
Separation of a mixture of independent signals using time delayed correlations
Molgedey, L., & Schuster, H. G. (1994) · Physical Review Letters · doi:10.1103/physrevlett.72.3634 · Cited by 882
Practical issues in temporal difference learning
Tesauro, G. (1992) · Machine Learning · doi:10.1007/bf00992697 · Cited by 787
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
Sayed, A. H. (2014) · Proceedings of the IEEE · doi:10.1109/jproc.2014.2306253 · Cited by 587
Gradient calculations for dynamic recurrent neural networks: a survey
Pearlmutter, B. A. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.410363 · Cited by 582
Fast Exact Multiplication by the Hessian
Pearlmutter, B. A. (1994) · Neural Computation · doi:10.1162/neco.1994.6.1.147 · Cited by 540
An analysis of multiple correlation cancellation loops with a filter in the auxiliary path
Morgan, D. (1980) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1980.1163430 · Cited by 458
Transform domain LMS algorithm
Narayan, S., Peterson, A., & Narasimha, M. (1983) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1983.1164121 · Cited by 421
Digital signal processing for sonar
Knight, W. C., Pridham, R. G., & Kay, S. M. (1981) · Proceedings of the IEEE · doi:10.1109/proc.1981.12186 · Cited by 410
Hierarchical neural network model for voluntary movement with application to robotics
Kawato, M., Uno, Y., Isobe, M., & Suzuki, R. (1988) · IEEE Control Systems Magazine · doi:10.1109/37.1867 · Cited by 390
A stochastic gradient adaptive filter with gradient adaptive step size
Mathews, V. J., & Xie, Z. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.218137 · Cited by 390
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
The two-dimensional adaptive LMS (TDLMS) algorithm
Hadhoud, M. M., & Thomas, D. W. (1988) · IEEE Transactions on Circuits and Systems · doi:10.1109/31.1775 · Cited by 375
Fast implementations of LMS adaptive filters
Ferrara, E. (1980) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1980.1163432 · Cited by 350
Signal cancellation phenomena in adaptive antennas: Causes and cures
Widrow, B., Duvall, K., Gooch, R., & Newman, W. (1982) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.1982.1142804 · Cited by 316
Self-citationNumerically stable fast transversal filters for recursive least squares adaptive filtering
Slock, D. T. M., & Kailath, T. (1991) · IEEE Transactions on Signal Processing · doi:10.1109/78.80769 · Cited by 305
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
A comparison of adaptive algorithms based on the methods of steepest descent and random search
Widrow, B., & McCool, J. (1976) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.1976.1141414 · Cited by 269
Self-citationAdaptive filtering in the frequency domain
Dentino, M., McCool, J., & Widrow, B. (1978) · Proceedings of the IEEE · doi:10.1109/proc.1978.11177 · Cited by 263
Self-citationEVAM: an eigenvector-based algorithm for multichannel blind deconvolution of input colored signals
Gurelli, M. I., & Nikias, C. L. (1995) · IEEE Transactions on Signal Processing · doi:10.1109/78.365293 · Cited by 196
Adaptive estimation of time delays in sampled data systems
Etter, D., & Stearns, S. (1981) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1981.1163568 · Cited by 156
An adaptive estimation of periodic signals using a Fourier linear combiner
Vaz, C., Kong, X., & Thakor, N. (1994) · IEEE Transactions on Signal Processing · doi:10.1109/78.258116 · Cited by 108
ADAPTIVE SIGNAL PROCESSING FOR ADAPTIVE CONTROL
Widrow, B., & Walach, E. (1984) · Adaptive Systems in Control and Signal Processing 1983 · doi:10.1016/b978-0-08-030565-3.50007-1 · Cited by 76
Self-citation
Metadata
- Authors
- Widrow, B., McCool, J. M., Larimore, M. G., & Johnson, C. R.
- Venue
- Proceedings of the IEEE
- Published
- 1976
- Volume
- 64
- Issue
- 8
- Pages
- 1151-1162
- ISSN
- 0018-9219 (ISSN-L)
- OpenAlex
- W4236087597
- Cited by
- 1,268
- References
- 18
- FWCI
- 18.49
- 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.