A robust, parallelizable, \(O(m)\), a posteriori recursive least squares algorithm for efficient adaptive filtering (Q2732851)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1632248
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A robust, parallelizable, \(O(m)\), a posteriori recursive least squares algorithm for efficient adaptive filtering |
scientific article; zbMATH DE number 1632248 |
Statements
19 March 2002
0 references
adaptive filtering
0 references
RLS algorithms
0 references
finite memory filtering
0 references
tracking
0 references
A robust, parallelizable, \(O(m)\), a posteriori recursive least squares algorithm for efficient adaptive filtering (English)
0 references
The paper presents a new recursive least squares finite memory adaptive filtering algorithm. Its main properties are small tracking error, high speed of convergence and simple stabilizability. Furthermore, it can be easily parallelized, thus resulting in a particularly fast algorithm, and its stabilized version appears to be suitable also for nonstationary signals. The results of a few applications to real data are shown.
0 references
0.902390480041504
0 references
0.811974287033081
0 references
0.8064841628074646
0 references
0.8049750328063965
0 references
0.8040410280227661
0 references
