The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
A comparison of adaptive algorithms based on the methods of steepest descent and random search
Abstract
This paper compares the performance characteristics of three algorithms useful in adjusting the parameters of adaptive systems: the differential (DSD) and least-mean-square (LMS) algorithms, both based on the method of steepest descent, and the linear random search (LRS) algorithm, based on a random search procedure derived from the Darwinian concept of "natural selection." The LRS algorithm is presented here for the first time. Analytical expressions are developed that define the relationship between rate of adaptation and "misadjustment," a dimensionless measure of the difference between actual and optimal performance due to noise in the adaptive process. For a fixed rate of adaptation it is shown that the LMS algorithm, which is the most efficient, has a misadjustment proportional to the number of adaptive parameters, while the DSD and LRS algorithms have misadjustments proportional to the square of the number of adaptive parameters. The expressions developed are verified by computer simulations that demonstrate the application of the three algorithms to system modeling problems, of the LMS algorithm to the cancelling of broadband interference in the sidelobes of a receiving antenna array, and of the DSD and LRS algorithms to the phase control of a transmitting antenna array. The second application introduces a new method of constrained adaptive beamforming whose performance is not significantly affected by element nonuniformity. The third application represents a class of problems to which the LMS algorithm in the basic form described in this paper is not applicable.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Extrapolation, Interpolation, and Smoothing of Stationary Time Series: With Engineering Applications
Wiener, N. (1949) · The MIT Press eBooks · doi:10.7551/mitpress/2946.001.0001 · Cited by 4,826
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
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
Self-citationStationary 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
Self-citationWidrow, 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-citationApplebaum, S. (1976) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.1976.1141417 · Cited by 793
A view of three decades of linear filtering theory
Kailath, T. (1974) · IEEE Transactions on Information Theory · doi:10.1109/tit.1974.1055174 · Cited by 702
Buehler, R. J., & Wilde, D. J. (1965) · Econometrica · doi:10.2307/1909808 · Cited by 695
Cited by
Godara, L. C. (1997) · Proceedings of the IEEE · doi:10.1109/5.622504 · Cited by 2,073
Fast, recursive-least-squares transversal filters for adaptive filtering
Cioffi, J., & Kailath, T. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164334 · Cited by 730
Lattice filters for adaptive processing
Friedlander, B. (1982) · Proceedings of the IEEE · doi:10.1109/proc.1982.12407 · Cited by 520
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
Metadata
- Authors
- Widrow, B., & McCool, J.
- Venue
- IEEE Transactions on Antennas and Propagation
- Published
- 1976-09
- Volume
- 24
- Issue
- 5
- Pages
- 615-637
- ISSN
- 0096-1973 (ISSN-L)
- OpenAlex
- W2103248455
- Cited by
- 269
- References
- 21
- FWCI
- 3.42
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A comparison of adaptive algorithms based on the methods of steepest descent and random search. https://app.cochat.ai/papers/10.1109/tap.1976.1141414
- The paper
- Widrow, B., & McCool, J. (1976). A comparison of adaptive algorithms based on the methods of steepest descent and random search. IEEE Transactions on Antennas and Propagation. https://doi.org/10.1109/tap.1976.1141414
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.