The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
The complex LMS algorithm
Abstract
A least-mean-square (LMS) adaptive algorithm for complex signals is derived. The original Widrow-Hoff LMS algorithm is Wj+l= Wj+ 2µεjXj. The complex form is shown to be Wj+1= Wj+ 2µεjX-j, where the boldfaced terms represent complex (phasor) signals and the bar above Xjdesignates complex conjugate.
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
WIDROW, B., & HOFF, M. E. (1960) · doi:10.21236/ad0241531 · Cited by 4,009
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-citationWidrow, B., Mantey, P., Griffiths, L., & Goode, B. (1967) · The Journal of the Acoustical Society of America · doi:10.1121/1.2144028 · Cited by 415
Self-citationOn the advantages of the LMS spectrum analyzer over nonadaptive implementations of the sliding-DFT
Beaufays, F., & Widrow, B. C. (1995) · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · doi:10.1109/81.382476 · Cited by 136
Self-citationThe use of an adaptive threshold element to design a linear optimal pattern classifier
Koford, J. S., & Groner, G. F. (1966) · IEEE Transactions on Information Theory · doi:10.1109/tit.1966.1053856 · Cited by 119
An adaptive array for interference rejection
Riegler, R. L., & Compton, R. T. (1973) · Proceedings of the IEEE · doi:10.1109/proc.1973.9154 · Cited by 108
Cited by
Godara, L. C. (1997) · Proceedings of the IEEE · doi:10.1109/5.622504 · Cited by 2,073
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
Complex-Valued Signal Processing: The Proper Way to Deal With Impropriety
Adali, T., Schreier, P. J., & Scharf, L. L. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2162954 · Cited by 398
Complex domain backpropagation
Georgiou, G. M., & Koutsougeras, C. (1992) · IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing · doi:10.1109/82.142037 · Cited by 339
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
Metadata
- Authors
- Widrow, B., McCool, J., & Ball, M.
- Venue
- Proceedings of the IEEE
- Published
- 1975
- Volume
- 63
- Issue
- 4
- Pages
- 719-720
- ISSN
- 0018-9219 (ISSN-L)
- OpenAlex
- W2169571074
- Cited by
- 672
- References
- 6
- FWCI
- 3.01
- 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: The complex LMS algorithm. https://app.cochat.ai/papers/10.1109/proc.1975.9807
- The paper
- Widrow, B., McCool, J., & Ball, M. (1975). The complex LMS algorithm. Proceedings of the IEEE. https://doi.org/10.1109/proc.1975.9807
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.