2022
DOI: 10.3390/electronics11020237
|View full text |Cite
|
Sign up to set email alerts
|

Tensor-Based Recursive Least-Squares Adaptive Algorithms with Low-Complexity and High Robustness Features

Abstract: The recently proposed tensor-based recursive least-squares dichotomous coordinate descent algorithm, namely RLS-DCD-T, was designed for the identification of multilinear forms. In this context, a high-dimensional system identification problem can be efficiently addressed (gaining in terms of both performance and complexity), based on tensor decomposition and modeling. In this paper, following the framework of the RLS-DCD-T, we propose a regularized version of this algorithm, where the regularization terms are … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
1
1
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 31 publications
0
1
0
Order By: Relevance
“…A larger value of δ will tend to slow down (or even freeze) the filter updates, which is preferable in low SNR conditions. [11][12][13] The update equation of the regularized RLS can be rewritten as:…”
Section: Regularized Rls Algorithmmentioning
confidence: 99%
“…A larger value of δ will tend to slow down (or even freeze) the filter updates, which is preferable in low SNR conditions. [11][12][13] The update equation of the regularized RLS can be rewritten as:…”
Section: Regularized Rls Algorithmmentioning
confidence: 99%
“…In [3], Fîciu et al develop a robust and computationally efficient tensor-based recursive least-squares (RLS) algorithm for the identification of multilinear forms. In this context, a high-dimensional system identification problem can be efficiently addressed based on tensor decomposition and modeling.…”
Section: Short Presentation Of the Papersmentioning
confidence: 99%