Skip to main navigation Skip to search Skip to main content

Robust augmented space recursive least-constrained-squares algorithms

  • Qiangqiang Zhang
  • , Shiyuan Wang*
  • , Dongyuan Lin
  • , Yunfei Zheng
  • , Chi K. Tse
  • *Corresponding author for this work

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

Abstract

This paper proposes a novel augmented space robust adaptive filter by reusing the errors for online applications. First, a batched augmented space constrained model (ASCM) is constructed to combat non-Gaussian noise. In ASCM, the errors are reused by k nearest neighbors (k-NN) estimation. Then, an augmented space recursive least-constrained-squares algorithm integrating with distance-based k-NN method (ARLCS-dk) is developed within the framework of ASCM for adaptive filtering. Finally, to curb the size of ever-growing error network, a sliding window ARLCS-dk (SW-ARLCS-dk) is proposed to reduce the computational burden. Theoretical analyses of excess mean square error (EMSE) and testing mean square error (TMSE) are carried out for performance evaluation. Examples on time-series prediction of simulated and real-world data are used to illustrate the advantages of proposed algorithms on robustness and prediction accuracy. © 2024 Elsevier B.V.
Original languageEnglish
Article number109388
JournalSignal Processing
Volume219
Online published12 Jan 2024
DOIs
Publication statusPublished - Jun 2024

Funding

This work was supported by the National Natural Science Foundation of China (62071391 and 62306245), Chongqing Postdoctoral Science Foundation, China Special Funded (2022CQBSHTB3076), and City University of Hong Kong Research Project (9229105).

Research Keywords

  • Adaptive filters
  • Augmented space constrained model
  • k nearest neighbors method
  • Robustness
  • Sliding window

RGC Funding Information

  • RGC-funded

Fingerprint

Dive into the research topics of 'Robust augmented space recursive least-constrained-squares algorithms'. Together they form a unique fingerprint.

Cite this