The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Diffusion Least-Mean Squares Over Adaptive Networks: Formulation and Performance Analysis
Open accessAbstract
We formulate and study distributed estimation algorithms based on diffusion protocols to implement cooperation among individual adaptive nodes. The individual nodes are equipped with local learning abilities. They derive local estimates for the parameter of interest and share information with their neighbors only, giving rise to peer-to-peer protocols. The resulting algorithm is distributed, cooperative and able to respond in real time to changes in the environment. It improves performance in terms of transient and steady-state mean-square error, as compared with traditional noncooperative schemes. Closed-form expressions that describe the network performance in terms of mean-square error quantities are derived, presenting a very good match with simulations.
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
Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., & Cayirci, E. (2002) · IEEE Communications Magazine · doi:10.1109/mcom.2002.1024422 · Cited by 13,644
Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
Olfati-Saber, R., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834113 · Cited by 12,788
Haykin, S. (1986) · Cited by 12,603
Coordination of groups of mobile autonomous agents using nearest neighbor rules
Jadbabaie, A., Lin, J., & Morse, A. S. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2003.812781 · Cited by 8,339
(1991) · Springer eBooks · doi:10.1007/978-3-7091-2840-4 · Cited by 5,095
Bellanger, M. (1987) · Signal Processing · doi:10.1016/0165-1684(87)90147-2 · Cited by 2,961
Fast linear iterations for distributed averaging
Xiao, L., & Boyd, S. (2004) · Systems & Control Letters · doi:10.1016/j.sysconle.2004.02.022 · Cited by 2,706
Alexander, S. T. (1986) · Springer eBooks · doi:10.1007/978-1-4612-4978-8 · Cited by 2,646
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
Fundamentals of adaptive filtering
Sayed, A. H. (2003) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 1,673
Self-citation
Cited by
Diffusion Strategies for Distributed Kalman Filtering and Smoothing
Cattivelli, F. S., & Sayed, A. H. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2042987 · Cited by 842
Self-citationSayed, A. H. (2014) · Proceedings of the IEEE · doi:10.1109/jproc.2014.2306253 · Cited by 587
Self-citationSayed, A. H., Tu, S.-Y., Chen, J., Zhao, X., & Towfic, Z. J. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2231991 · Cited by 494
Self-citationKar, S., Moura, J. M. F., & Ramanan, K. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2191450 · Cited by 476
Diffusion Adaptation Over Networks
Sayed, A. H. (2014) · Academic Press Library in Signal Processing · doi:10.1016/b978-0-12-411597-2.00009-6 · Cited by 465
Self-citation
Metadata
- Authors
- Lopes, C. G., & Sayed, A. H.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2008-07
- Volume
- 56
- Issue
- 7
- Pages
- 3122-3136
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2118776392
- Cited by
- 1,109
- References
- 17
- FWCI
- 42.01
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Diffusion Least-Mean Squares Over Adaptive Networks: Formulation and Performance Analysis. https://app.cochat.ai/papers/10.1109/tsp.2008.917383
- The paper
- Lopes, C. G., & Sayed, A. H. (2008). Diffusion Least-Mean Squares Over Adaptive Networks: Formulation and Performance Analysis. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2008.917383
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.