Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 405

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

A Robust Variable Forgetting Factor Recursive Least-Squares Algorithm for System Identification

Paleologu, C., Benesty, J., Ciochina, S.·2008·IEEE Signal Processing Letters

Abstract

The performance of the recursive least-squares (RLS) algorithm is governed by the forgetting factor. This parameter leads to a compromise between (1) the tracking capabilities and (2) the misadjustment and stability. In this letter, a variable forgetting factor RLS (VFF-RLS) algorithm is proposed for system identification. In general, the output of the unknown system is corrupted by a noise-like signal. This signal should be recovered in the error signal of the adaptive filter after this one converges to the true solution. This condition is used to control the value of the forgetting factor. The simulation results indicate the good performance and the robustness of the proposed algorithm.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/lsp.2008.2001559

Cites

4 of 4 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 4 references

Cited by

See all 405

Metadata

Authors
Paleologu, C., Benesty, J., & Ciochina, S.
Venue
IEEE Signal Processing Letters
Published
2008
Volume
15
Pages
597-600
ISSN
1070-9908 (ISSN-L)
OpenAlex
W2126491786
Cited by
405
References
4
FWCI
9.80
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 Robust Variable Forgetting Factor Recursive Least-Squares Algorithm for System Identification. https://app.cochat.ai/papers/10.1109/lsp.2008.2001559
The paper
Paleologu, C., Benesty, J., & Ciochina, S. (2008). A Robust Variable Forgetting Factor Recursive Least-Squares Algorithm for System Identification. IEEE Signal Processing Letters. https://doi.org/10.1109/lsp.2008.2001559

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.