File Download

There are no files associated with this item.

Supplementary

Conference Paper: Fast Least Mean M-Estimate Algorithms for Robust Adaptive Filtering in Impulse Noise

TitleFast Least Mean M-Estimate Algorithms for Robust Adaptive Filtering in Impulse Noise
Authors
Issue Date2000
Citation
X European Signal Processing Conference, Tampere, Finland, 4-8 September 2000 How to Cite?
AbstractAdaptive filters with suitable nonlinear devices are very effective in suppressing the adverse effect due to impulse noise. In a previous work, the authors have proposed a new class of nonlinear adaptive filters using the concept of robust statistics [1, 2]. The robust M-estimator is used as the objective function, instead of the mean square errors, to suppress the impulse noise. The optimal coefficient vector for such nonlinear filter is governed by a normal equation which can be solved by a recursive least squares like algorithm with O(N^2) arithmetic complexity, where N is the length of the adaptive filter. In this paper, we generalize the robust statistic concept to least mean square (LMS) and transform domain LMS algorithms. The new fast nonlinear adaptive filtering algorithms called the least mean M-estimate (LMM) and transform domain LMM (TLMM) algorithms are derived. Simulation results show that they are robust to impulsive noise in the desired and input signals with an arithmetic complexity of order O(N).
Persistent Identifierhttp://hdl.handle.net/10722/98945

 

DC FieldValueLanguage
dc.contributor.authorZou, YXen_HK
dc.contributor.authorChan, SCen_HK
dc.contributor.authorNg, TSen_HK
dc.date.accessioned2010-09-25T18:09:08Z-
dc.date.available2010-09-25T18:09:08Z-
dc.date.issued2000en_HK
dc.identifier.citationX European Signal Processing Conference, Tampere, Finland, 4-8 September 2000-
dc.identifier.urihttp://hdl.handle.net/10722/98945-
dc.description.abstractAdaptive filters with suitable nonlinear devices are very effective in suppressing the adverse effect due to impulse noise. In a previous work, the authors have proposed a new class of nonlinear adaptive filters using the concept of robust statistics [1, 2]. The robust M-estimator is used as the objective function, instead of the mean square errors, to suppress the impulse noise. The optimal coefficient vector for such nonlinear filter is governed by a normal equation which can be solved by a recursive least squares like algorithm with O(N^2) arithmetic complexity, where N is the length of the adaptive filter. In this paper, we generalize the robust statistic concept to least mean square (LMS) and transform domain LMS algorithms. The new fast nonlinear adaptive filtering algorithms called the least mean M-estimate (LMM) and transform domain LMM (TLMM) algorithms are derived. Simulation results show that they are robust to impulsive noise in the desired and input signals with an arithmetic complexity of order O(N).-
dc.languageengen_HK
dc.relation.ispartofEusipco 2000 CD-ROM Proceedingsen_HK
dc.titleFast Least Mean M-Estimate Algorithms for Robust Adaptive Filtering in Impulse Noiseen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailChan, SC: scchan@eee.hku.hken_HK
dc.identifier.emailHo, KL: klho@eee.hku.hken_HK
dc.identifier.authorityChan, SC=rp00094en_HK
dc.identifier.authorityHo, KL=rp00117en_HK
dc.identifier.hkuros50915en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats