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 accessAbstract
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.
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
Adaptive 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
Factorization Methods for Discrete Sequential Estimation
(1977) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)x6052-7 · Cited by 1,847
Lattice filters for adaptive processing
Friedlander, B. (1982) · Proceedings of the IEEE · doi:10.1109/proc.1982.12407 · Cited by 520
Pattern Recognition and Signal Processing
(1978) · Springer eBooks · doi:10.1007/978-94-009-9941-1 · Cited by 354
Application of Fast Kalman Estimation to Adaptive Equalization
Falconer, D. D., & Lennart Ljung, A. (1978) · IRE Transactions on Communications Systems · doi:10.1109/tcom.1978.1093988 · Cited by 319
Channel Equalization Using a Kalman Filter for Fast Data Transmission
Godard, D. (1974) · IBM Journal of Research and Development · doi:10.1147/rd.183.0267 · Cited by 254
FIR system modeling and identification in the presence of noise and with band-limited inputs
Rabiner, L. R., Crochiere, R. E., & Allen, J. B. (1978) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1978.1163113 · Cited by 54
Fast Kalman type algorithms for sequential signal processing
Carayannis, G. V., Manolakis, D. G., & Kalouptsidis, N. (2005) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1983.1172201 · Cited by 25
Self-citation
Cited by
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
A state-space approach to adaptive RLS filtering
Sayed, A. H., & Kailath, T. (1994) · IEEE Signal Processing Magazine · doi:10.1109/79.295229 · Cited by 449
Displacement Structure: Theory and Applications
Kailath, T., & Sayed, A. H. (1995) · SIAM Review · doi:10.1137/1037082 · Cited by 436
Numerically stable fast transversal filters for recursive least squares adaptive filtering
Slock, D. T. M., & Kailath, T. (1991) · IEEE Transactions on Signal Processing · doi:10.1109/78.80769 · Cited by 305
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.