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

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

A fast sequential algorithm for least-squares filtering and prediction

Open access
Carayannis, G., Manolakis, D., Kalouptsidis, N. · 1983 · IEEE Transactions on Acoustics, Speech, and Signal Processing

Abstract

A new computationally efficient algorithm for sequential least-squares (LS) estimation is presented in this paper. This fast a posteriori error sequential technique (FAEST) requires 5p MADPR (multiplications and divisions per recursion) for AR modeling and 7p MADPR for LS FIR filtering, where p is the number of estimated parameters. In contrast the well-known fast Kalman algorithm requires 8p MADPR for AR modeling and 10p MADPR for FIR filtering. The increased computational speed of the introduced algorithm stems from an alternative definition of the so-called Kalman gain vector, which takes better advantage of the relationships between forward and backward linear prediction.

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/tassp.1983.1164224

Cites

8 of 8 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 8 references

Cited by

See all 272

Metadata

Authors
Carayannis, G., Manolakis, D., & Kalouptsidis, N.
Venue
IEEE Transactions on Acoustics, Speech, and Signal Processing
Published
1983-12
Volume
31
Issue
6
Pages
1394-1402
ISSN
0096-3518 (ISSN-L)
OpenAlex
W2101903757
Cited by
272
References
8
FWCI
11.34
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: A fast sequential algorithm for least-squares filtering and prediction. https://app.cochat.ai/papers/10.1109/tassp.1983.1164224
The paper
Carayannis, G., Manolakis, D., & Kalouptsidis, N. (1983). A fast sequential algorithm for least-squares filtering and prediction. IEEE Transactions on Acoustics, Speech, and Signal Processing. https://doi.org/10.1109/tassp.1983.1164224

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.