A numerically stable, finite memory, fast array recursive least squares filter for broadband active noise control

DOI10.1002/acs.2574zbMath1348.93266OpenAlexW2148036170MaRDI QIDQ2828576

A. P. Berkhoff, S. van Ophem

Publication date: 26 October 2016

Published in: International Journal of Adaptive Control and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/acs.2574

zbMATH Keywords

recursive least squaresactive noise controlround-off errorsprimary path tracking

Mathematics Subject Classification ID

Filtering in stochastic control theory (93E11) Estimation and detection in stochastic control theory (93E10) Least squares and related methods for stochastic control systems (93E24)

Cites Work

• Stability Issues in the Factorization of Structured Matrices
• Filtering and System Identification
• An Affine Combination of Two LMS Adaptive Filters—Transient Mean-Square Analysis
• Improving the Tracking Capability of Adaptive Filters via Convex Combination
• Mean-square performance of a convex combination of two adaptive filters
• A fast‐array Kalman filter solution to active noise control
• Stabilizing the Generalized Schur Algorithm

This page was built for publication: A numerically stable, finite memory, fast array recursive least squares filter for broadband active noise control