CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
A new regularized QRD recursive least M-estimate algorithm: Performance analysis and applications
Authors
SC Chan
YJ Chu
ZG Zhang
Publication date
1 January 2010
Publisher
'Institute of Electrical and Electronics Engineers (IEEE)'
Doi
Cite
Abstract
Proceedings of the International Conference on Green Circuits and Systems, 2010, p. 190-195This paper proposes a new regularized QR decomposition based recursive least M-estimate (R-QRRLM) adaptive filtering algorithm and studies its mean and mean square convergence performance and application to acoustic echo cancellation (AEC). The proposed algorithm extends the conventional RLM algorithm by imposing a weighted L2 regularization term on the coefficients to reduce the variance of the estimator. Moreover, a QRD-based algorithm is employed for efficient recursive implementation and improved numerical property. The mean convergence analysis shows that a bias solution to the classical Wiener solution will be introduced due to the regularization. The steady-state excess mean square error (EMSE) is derived and it suggests that the variance will decrease while the bias will increase with the regularization parameter. Therefore, regularization can help to trade bias for variance. In this study, the regularization parameter can be adaptively selected and the resultant variable regularization parameter QRRLM (VR-QRRLM) algorithm can obtain both high immunity to input variation and low steady-state EMSE values. The theoretical results are in good agreement with simulation results. Computer simulation results on AEC show that the R-QRRLM and VR-QRRLM algorithms considerably outperform the traditional RLS algorithm when the input signal level is low or during double talk. © 2010 IEEE.published_or_final_versio
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
HKU Scholars Hub
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:hub.hku.hk:10722/126116
Last time updated on 01/06/2016