A connection between the Kalman filter and an optimized LMS algorithm for bilinear forms
From MaRDI portal
Publication:1712076
DOI10.3390/A11120211zbMath1461.93503OpenAlexW2905357467MaRDI QIDQ1712076
Silviu Ciochină, Constantin Paleologu, Laura-Maria Dogariu, Jacob Benesty
Publication date: 21 January 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a11120211
Related Items (3)
A connection between the Kalman filter and an optimized LMS algorithm for bilinear forms ⋮ \(\mathcal{L}_p\)-norm of the LMS algorithm for bilinear forms with \(\alpha\)-stable processes ⋮ System identification based on tensor decompositions: a trilinear approach
Cites Work
- Unnamed Item
- Convergence and steady-state analysis of a variable step-size NLMS algorithm
- Adaptation of a memoryless preprocessor for nonlinear acoustic echo cancelling.
- A connection between the Kalman filter and an optimized LMS algorithm for bilinear forms
- Adaptive identification of nonlinear systems with application to chaotic communications
- Robust two-stage Kalman filters for systems with unknown inputs
- An Overview of Bilinear System Theory and Applications
- Adaptive lattice bilinear filters
This page was built for publication: A connection between the Kalman filter and an optimized LMS algorithm for bilinear forms
